./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.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 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:14:22,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:14:22,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:14:22,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:14:22,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:14:22,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:14:22,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:14:22,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:14:22,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:14:22,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:14:22,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:14:22,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:14:22,267 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:14:22,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:14:22,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:14:22,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:14:22,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:14:22,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:14:22,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:14:22,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:14:22,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:14:22,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:14:22,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:22,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:14:22,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:14:22,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:14:22,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:14:22,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:14:22,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:14:22,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:14:22,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:14:22,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:14:22,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:14:22,270 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2025-03-17 11:14:22,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:14:22,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:14:22,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:14:22,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:14:22,568 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:14:22,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-03-17 11:14:23,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4eee729e/2b79b90846bc420cbcb4d683b44142e4/FLAGe086bc808 [2025-03-17 11:14:24,049 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:14:24,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-03-17 11:14:24,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4eee729e/2b79b90846bc420cbcb4d683b44142e4/FLAGe086bc808 [2025-03-17 11:14:24,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4eee729e/2b79b90846bc420cbcb4d683b44142e4 [2025-03-17 11:14:24,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:14:24,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:14:24,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:24,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:14:24,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:14:24,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c66aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24, skipping insertion in model container [2025-03-17 11:14:24,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:14:24,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:24,538 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:14:24,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:24,587 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:14:24,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24 WrapperNode [2025-03-17 11:14:24,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:24,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:24,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:14:24,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:14:24,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,634 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 397 [2025-03-17 11:14:24,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:24,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:14:24,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:14:24,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:14:24,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:14:24,672 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:14:24,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:14:24,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:14:24,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (1/1) ... [2025-03-17 11:14:24,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:24,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:14:24,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:14:24,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:14:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:14:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:14:24,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:14:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:14:24,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:14:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:14:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:14:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:14:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:14:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:14:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:14:24,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:14:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:14:24,724 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:14:24,815 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:14:24,818 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:14:25,325 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:14:25,325 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:14:25,571 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:14:25,571 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:14:25,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:25 BoogieIcfgContainer [2025-03-17 11:14:25,572 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:14:25,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:14:25,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:14:25,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:14:25,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:14:24" (1/3) ... [2025-03-17 11:14:25,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416fb7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:25, skipping insertion in model container [2025-03-17 11:14:25,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:24" (2/3) ... [2025-03-17 11:14:25,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416fb7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:25, skipping insertion in model container [2025-03-17 11:14:25,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:25" (3/3) ... [2025-03-17 11:14:25,579 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2025-03-17 11:14:25,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:14:25,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-dec-subseq.wvr.c that has 3 procedures, 358 locations, 1 initial locations, 4 loop locations, and 67 error locations. [2025-03-17 11:14:25,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:14:25,668 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:14:25,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 364 places, 370 transitions, 754 flow [2025-03-17 11:14:25,792 INFO L124 PetriNetUnfolderBase]: 13/368 cut-off events. [2025-03-17 11:14:25,796 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:14:25,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 368 events. 13/368 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 641 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 290. Up to 2 conditions per place. [2025-03-17 11:14:25,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 370 transitions, 754 flow [2025-03-17 11:14:25,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 351 transitions, 714 flow [2025-03-17 11:14:25,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:14:25,826 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;@1548d5c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:14:25,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2025-03-17 11:14:25,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:14:25,833 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-17 11:14:25,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:14:25,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:25,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:25,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:25,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1120318605, now seen corresponding path program 1 times [2025-03-17 11:14:25,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:25,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257200277] [2025-03-17 11:14:25,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:25,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:14:25,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:14:25,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:25,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:25,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:25,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257200277] [2025-03-17 11:14:25,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257200277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:25,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:25,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:25,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907824924] [2025-03-17 11:14:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:25,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:25,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:25,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:25,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:26,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-03-17 11:14:26,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 351 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:26,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-03-17 11:14:26,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:26,164 INFO L124 PetriNetUnfolderBase]: 40/483 cut-off events. [2025-03-17 11:14:26,164 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2025-03-17 11:14:26,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 483 events. 40/483 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1403 event pairs, 13 based on Foata normal form. 16/401 useless extension candidates. Maximal degree in co-relation 278. Up to 61 conditions per place. [2025-03-17 11:14:26,171 INFO L140 encePairwiseOnDemand]: 329/370 looper letters, 15 selfloop transitions, 2 changer transitions 5/312 dead transitions. [2025-03-17 11:14:26,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 312 transitions, 670 flow [2025-03-17 11:14:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 989 transitions. [2025-03-17 11:14:26,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.890990990990991 [2025-03-17 11:14:26,189 INFO L175 Difference]: Start difference. First operand has 346 places, 351 transitions, 714 flow. Second operand 3 states and 989 transitions. [2025-03-17 11:14:26,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 312 transitions, 670 flow [2025-03-17 11:14:26,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 312 transitions, 662 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:14:26,200 INFO L231 Difference]: Finished difference. Result has 311 places, 307 transitions, 622 flow [2025-03-17 11:14:26,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=311, PETRI_TRANSITIONS=307} [2025-03-17 11:14:26,204 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -35 predicate places. [2025-03-17 11:14:26,205 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 307 transitions, 622 flow [2025-03-17 11:14:26,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:26,205 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] [2025-03-17 11:14:26,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:14:26,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:26,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1891512952, now seen corresponding path program 1 times [2025-03-17 11:14:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970924409] [2025-03-17 11:14:26,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:26,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 11:14:26,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:14:26,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:26,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:26,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970924409] [2025-03-17 11:14:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970924409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:26,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:26,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6511342] [2025-03-17 11:14:26,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:26,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:26,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:26,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:26,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:26,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-03-17 11:14:26,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 307 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:26,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-03-17 11:14:26,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:26,374 INFO L124 PetriNetUnfolderBase]: 26/481 cut-off events. [2025-03-17 11:14:26,375 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:14:26,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 481 events. 26/481 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1303 event pairs, 10 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 503. Up to 44 conditions per place. [2025-03-17 11:14:26,382 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 15 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2025-03-17 11:14:26,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 306 transitions, 654 flow [2025-03-17 11:14:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-03-17 11:14:26,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567567567567568 [2025-03-17 11:14:26,389 INFO L175 Difference]: Start difference. First operand has 311 places, 307 transitions, 622 flow. Second operand 3 states and 951 transitions. [2025-03-17 11:14:26,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 306 transitions, 654 flow [2025-03-17 11:14:26,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 306 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:26,399 INFO L231 Difference]: Finished difference. Result has 305 places, 306 transitions, 620 flow [2025-03-17 11:14:26,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=305, PETRI_TRANSITIONS=306} [2025-03-17 11:14:26,401 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -41 predicate places. [2025-03-17 11:14:26,401 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 306 transitions, 620 flow [2025-03-17 11:14:26,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:26,402 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-17 11:14:26,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:14:26,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:26,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1242548701, now seen corresponding path program 1 times [2025-03-17 11:14:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:26,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566519177] [2025-03-17 11:14:26,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:26,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:26,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:14:26,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:14:26,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:26,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:26,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566519177] [2025-03-17 11:14:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566519177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864334767] [2025-03-17 11:14:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:26,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:26,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:26,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:26,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-03-17 11:14:26,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 306 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:26,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-03-17 11:14:26,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:26,568 INFO L124 PetriNetUnfolderBase]: 28/464 cut-off events. [2025-03-17 11:14:26,569 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-17 11:14:26,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 464 events. 28/464 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1200 event pairs, 7 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 474. Up to 41 conditions per place. [2025-03-17 11:14:26,572 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 13 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-03-17 11:14:26,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 648 flow [2025-03-17 11:14:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2025-03-17 11:14:26,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8603603603603603 [2025-03-17 11:14:26,578 INFO L175 Difference]: Start difference. First operand has 305 places, 306 transitions, 620 flow. Second operand 3 states and 955 transitions. [2025-03-17 11:14:26,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 648 flow [2025-03-17 11:14:26,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 305 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:26,582 INFO L231 Difference]: Finished difference. Result has 304 places, 305 transitions, 618 flow [2025-03-17 11:14:26,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=304, PETRI_TRANSITIONS=305} [2025-03-17 11:14:26,583 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -42 predicate places. [2025-03-17 11:14:26,583 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 305 transitions, 618 flow [2025-03-17 11:14:26,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:26,585 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] [2025-03-17 11:14:26,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:14:26,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:26,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash 73757284, now seen corresponding path program 1 times [2025-03-17 11:14:26,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:26,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965203203] [2025-03-17 11:14:26,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:26,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:14:26,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:14:26,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965203203] [2025-03-17 11:14:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965203203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:26,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:26,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:26,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224000264] [2025-03-17 11:14:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:26,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:26,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:26,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:26,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:26,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-03-17 11:14:26,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 305 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:26,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-03-17 11:14:26,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:26,747 INFO L124 PetriNetUnfolderBase]: 28/463 cut-off events. [2025-03-17 11:14:26,748 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-17 11:14:26,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 463 events. 28/463 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1196 event pairs, 7 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 465. Up to 41 conditions per place. [2025-03-17 11:14:26,750 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 13 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-03-17 11:14:26,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 304 transitions, 646 flow [2025-03-17 11:14:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2025-03-17 11:14:26,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8603603603603603 [2025-03-17 11:14:26,753 INFO L175 Difference]: Start difference. First operand has 304 places, 305 transitions, 618 flow. Second operand 3 states and 955 transitions. [2025-03-17 11:14:26,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 304 transitions, 646 flow [2025-03-17 11:14:26,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 304 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:26,757 INFO L231 Difference]: Finished difference. Result has 303 places, 304 transitions, 616 flow [2025-03-17 11:14:26,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=303, PETRI_TRANSITIONS=304} [2025-03-17 11:14:26,758 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -43 predicate places. [2025-03-17 11:14:26,759 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 304 transitions, 616 flow [2025-03-17 11:14:26,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:26,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:26,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:14:26,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:26,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1755839025, now seen corresponding path program 1 times [2025-03-17 11:14:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:26,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092702977] [2025-03-17 11:14:26,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:26,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:14:26,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:14:26,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:26,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092702977] [2025-03-17 11:14:26,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092702977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:26,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:26,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:26,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401300218] [2025-03-17 11:14:26,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:26,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:26,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:26,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:26,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:26,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 370 [2025-03-17 11:14:26,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 304 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:26,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 370 [2025-03-17 11:14:26,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:26,881 INFO L124 PetriNetUnfolderBase]: 34/491 cut-off events. [2025-03-17 11:14:26,881 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-17 11:14:26,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 491 events. 34/491 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1449 event pairs, 4 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 493. Up to 27 conditions per place. [2025-03-17 11:14:26,884 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 15 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-03-17 11:14:26,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 308 transitions, 660 flow [2025-03-17 11:14:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2025-03-17 11:14:26,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8729729729729729 [2025-03-17 11:14:26,886 INFO L175 Difference]: Start difference. First operand has 303 places, 304 transitions, 616 flow. Second operand 3 states and 969 transitions. [2025-03-17 11:14:26,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 308 transitions, 660 flow [2025-03-17 11:14:26,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:26,892 INFO L231 Difference]: Finished difference. Result has 303 places, 304 transitions, 620 flow [2025-03-17 11:14:26,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=303, PETRI_TRANSITIONS=304} [2025-03-17 11:14:26,892 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -43 predicate places. [2025-03-17 11:14:26,892 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 304 transitions, 620 flow [2025-03-17 11:14:26,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:26,893 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] [2025-03-17 11:14:26,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:14:26,894 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:26,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:26,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2131388804, now seen corresponding path program 1 times [2025-03-17 11:14:26,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:26,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712371478] [2025-03-17 11:14:26,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:26,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:14:26,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:14:26,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:26,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:26,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:26,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712371478] [2025-03-17 11:14:26,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712371478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:26,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:26,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:26,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076820029] [2025-03-17 11:14:26,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:26,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:26,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:26,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:26,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 370 [2025-03-17 11:14:26,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 304 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:26,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:26,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 370 [2025-03-17 11:14:26,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:27,037 INFO L124 PetriNetUnfolderBase]: 34/490 cut-off events. [2025-03-17 11:14:27,037 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-03-17 11:14:27,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 490 events. 34/490 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1448 event pairs, 10 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 309. Up to 51 conditions per place. [2025-03-17 11:14:27,039 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 13 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-03-17 11:14:27,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 303 transitions, 648 flow [2025-03-17 11:14:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-17 11:14:27,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8621621621621621 [2025-03-17 11:14:27,041 INFO L175 Difference]: Start difference. First operand has 303 places, 304 transitions, 620 flow. Second operand 3 states and 957 transitions. [2025-03-17 11:14:27,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 303 transitions, 648 flow [2025-03-17 11:14:27,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 303 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:27,044 INFO L231 Difference]: Finished difference. Result has 303 places, 303 transitions, 620 flow [2025-03-17 11:14:27,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=303, PETRI_TRANSITIONS=303} [2025-03-17 11:14:27,045 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -43 predicate places. [2025-03-17 11:14:27,045 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 303 transitions, 620 flow [2025-03-17 11:14:27,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:27,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:27,046 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] [2025-03-17 11:14:27,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:14:27,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:27,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash -591803071, now seen corresponding path program 1 times [2025-03-17 11:14:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:27,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466773052] [2025-03-17 11:14:27,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:27,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:14:27,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:14:27,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:27,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466773052] [2025-03-17 11:14:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466773052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:27,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:27,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:27,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968533881] [2025-03-17 11:14:27,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:27,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:27,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:27,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:27,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 370 [2025-03-17 11:14:27,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 303 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:27,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:27,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 370 [2025-03-17 11:14:27,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:27,159 INFO L124 PetriNetUnfolderBase]: 34/489 cut-off events. [2025-03-17 11:14:27,160 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-03-17 11:14:27,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 489 events. 34/489 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1447 event pairs, 10 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 492. Up to 49 conditions per place. [2025-03-17 11:14:27,164 INFO L140 encePairwiseOnDemand]: 368/370 looper letters, 12 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2025-03-17 11:14:27,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 302 transitions, 644 flow [2025-03-17 11:14:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-17 11:14:27,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8684684684684685 [2025-03-17 11:14:27,166 INFO L175 Difference]: Start difference. First operand has 303 places, 303 transitions, 620 flow. Second operand 3 states and 964 transitions. [2025-03-17 11:14:27,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 302 transitions, 644 flow [2025-03-17 11:14:27,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:27,172 INFO L231 Difference]: Finished difference. Result has 302 places, 302 transitions, 616 flow [2025-03-17 11:14:27,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=302, PETRI_TRANSITIONS=302} [2025-03-17 11:14:27,173 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -44 predicate places. [2025-03-17 11:14:27,173 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 302 transitions, 616 flow [2025-03-17 11:14:27,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:27,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:27,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] [2025-03-17 11:14:27,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:14:27,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:27,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash 998262559, now seen corresponding path program 1 times [2025-03-17 11:14:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:27,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338501144] [2025-03-17 11:14:27,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:27,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:27,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:14:27,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:14:27,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:27,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:27,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:27,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338501144] [2025-03-17 11:14:27,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338501144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:27,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:27,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859939347] [2025-03-17 11:14:27,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:27,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:27,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:27,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:27,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:27,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 370 [2025-03-17 11:14:27,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 302 transitions, 616 flow. Second operand has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:27,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:27,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 370 [2025-03-17 11:14:27,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:27,976 INFO L124 PetriNetUnfolderBase]: 73/656 cut-off events. [2025-03-17 11:14:27,976 INFO L125 PetriNetUnfolderBase]: For 34/35 co-relation queries the response was YES. [2025-03-17 11:14:27,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 656 events. 73/656 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2650 event pairs, 42 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 786. Up to 144 conditions per place. [2025-03-17 11:14:27,978 INFO L140 encePairwiseOnDemand]: 358/370 looper letters, 38 selfloop transitions, 10 changer transitions 0/300 dead transitions. [2025-03-17 11:14:27,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 300 transitions, 708 flow [2025-03-17 11:14:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1735 transitions. [2025-03-17 11:14:27,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7815315315315315 [2025-03-17 11:14:27,985 INFO L175 Difference]: Start difference. First operand has 302 places, 302 transitions, 616 flow. Second operand 6 states and 1735 transitions. [2025-03-17 11:14:27,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 300 transitions, 708 flow [2025-03-17 11:14:27,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 300 transitions, 707 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:27,990 INFO L231 Difference]: Finished difference. Result has 304 places, 300 transitions, 631 flow [2025-03-17 11:14:27,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=631, PETRI_PLACES=304, PETRI_TRANSITIONS=300} [2025-03-17 11:14:27,992 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -42 predicate places. [2025-03-17 11:14:27,993 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 300 transitions, 631 flow [2025-03-17 11:14:27,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:27,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:27,994 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] [2025-03-17 11:14:27,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:14:27,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:27,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1036963342, now seen corresponding path program 1 times [2025-03-17 11:14:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:27,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340536610] [2025-03-17 11:14:27,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:28,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:14:28,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:14:28,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:28,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:28,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:28,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340536610] [2025-03-17 11:14:28,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340536610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:28,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:28,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:28,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813739728] [2025-03-17 11:14:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:28,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:28,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:28,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:28,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:28,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 370 [2025-03-17 11:14:28,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 300 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:28,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:28,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 370 [2025-03-17 11:14:28,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:28,098 INFO L124 PetriNetUnfolderBase]: 34/486 cut-off events. [2025-03-17 11:14:28,098 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-03-17 11:14:28,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 486 events. 34/486 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1436 event pairs, 10 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 531. Up to 51 conditions per place. [2025-03-17 11:14:28,101 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 13 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2025-03-17 11:14:28,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 299 transitions, 659 flow [2025-03-17 11:14:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-17 11:14:28,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8621621621621621 [2025-03-17 11:14:28,103 INFO L175 Difference]: Start difference. First operand has 304 places, 300 transitions, 631 flow. Second operand 3 states and 957 transitions. [2025-03-17 11:14:28,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 299 transitions, 659 flow [2025-03-17 11:14:28,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 299 transitions, 639 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:14:28,107 INFO L231 Difference]: Finished difference. Result has 300 places, 299 transitions, 613 flow [2025-03-17 11:14:28,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=300, PETRI_TRANSITIONS=299} [2025-03-17 11:14:28,108 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -46 predicate places. [2025-03-17 11:14:28,108 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 299 transitions, 613 flow [2025-03-17 11:14:28,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:28,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:28,110 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] [2025-03-17 11:14:28,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:14:28,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 51333675, now seen corresponding path program 1 times [2025-03-17 11:14:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:28,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184329628] [2025-03-17 11:14:28,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:28,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 11:14:28,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:14:28,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:28,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:28,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184329628] [2025-03-17 11:14:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184329628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:28,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600369398] [2025-03-17 11:14:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:28,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:28,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:28,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-03-17 11:14:28,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 299 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:28,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:28,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-03-17 11:14:28,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:28,199 INFO L124 PetriNetUnfolderBase]: 37/537 cut-off events. [2025-03-17 11:14:28,200 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 11:14:28,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 537 events. 37/537 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1650 event pairs, 18 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 561. Up to 63 conditions per place. [2025-03-17 11:14:28,202 INFO L140 encePairwiseOnDemand]: 366/370 looper letters, 16 selfloop transitions, 1 changer transitions 0/296 dead transitions. [2025-03-17 11:14:28,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 296 transitions, 641 flow [2025-03-17 11:14:28,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-17 11:14:28,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8576576576576577 [2025-03-17 11:14:28,204 INFO L175 Difference]: Start difference. First operand has 300 places, 299 transitions, 613 flow. Second operand 3 states and 952 transitions. [2025-03-17 11:14:28,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 296 transitions, 641 flow [2025-03-17 11:14:28,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 296 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:28,208 INFO L231 Difference]: Finished difference. Result has 297 places, 296 transitions, 605 flow [2025-03-17 11:14:28,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=297, PETRI_TRANSITIONS=296} [2025-03-17 11:14:28,209 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -49 predicate places. [2025-03-17 11:14:28,209 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 296 transitions, 605 flow [2025-03-17 11:14:28,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:28,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:28,210 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] [2025-03-17 11:14:28,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:14:28,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:28,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2041881144, now seen corresponding path program 1 times [2025-03-17 11:14:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:28,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570382712] [2025-03-17 11:14:28,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:28,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 11:14:28,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 11:14:28,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:28,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:28,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570382712] [2025-03-17 11:14:28,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570382712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:28,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:28,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:28,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021062169] [2025-03-17 11:14:28,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:28,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:28,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:28,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:28,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-03-17 11:14:28,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 296 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:28,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:28,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-03-17 11:14:28,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:28,335 INFO L124 PetriNetUnfolderBase]: 45/595 cut-off events. [2025-03-17 11:14:28,336 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-03-17 11:14:28,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 595 events. 45/595 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2156 event pairs, 18 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 627. Up to 72 conditions per place. [2025-03-17 11:14:28,338 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 16 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2025-03-17 11:14:28,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 295 transitions, 639 flow [2025-03-17 11:14:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-03-17 11:14:28,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567567567567568 [2025-03-17 11:14:28,341 INFO L175 Difference]: Start difference. First operand has 297 places, 296 transitions, 605 flow. Second operand 3 states and 951 transitions. [2025-03-17 11:14:28,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 295 transitions, 639 flow [2025-03-17 11:14:28,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 295 transitions, 638 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:28,344 INFO L231 Difference]: Finished difference. Result has 297 places, 295 transitions, 606 flow [2025-03-17 11:14:28,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=297, PETRI_TRANSITIONS=295} [2025-03-17 11:14:28,345 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -49 predicate places. [2025-03-17 11:14:28,345 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 295 transitions, 606 flow [2025-03-17 11:14:28,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:28,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:28,346 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] [2025-03-17 11:14:28,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:14:28,346 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:28,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1519788397, now seen corresponding path program 1 times [2025-03-17 11:14:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:28,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445869635] [2025-03-17 11:14:28,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:28,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 11:14:28,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 11:14:28,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:28,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445869635] [2025-03-17 11:14:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445869635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:28,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:28,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:28,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461510646] [2025-03-17 11:14:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:28,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:28,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:28,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:28,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-03-17 11:14:28,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 295 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:28,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:28,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-03-17 11:14:28,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:28,500 INFO L124 PetriNetUnfolderBase]: 53/616 cut-off events. [2025-03-17 11:14:28,501 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2025-03-17 11:14:28,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 616 events. 53/616 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2336 event pairs, 26 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 670. Up to 85 conditions per place. [2025-03-17 11:14:28,504 INFO L140 encePairwiseOnDemand]: 366/370 looper letters, 16 selfloop transitions, 1 changer transitions 0/292 dead transitions. [2025-03-17 11:14:28,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 292 transitions, 634 flow [2025-03-17 11:14:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-17 11:14:28,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8576576576576577 [2025-03-17 11:14:28,507 INFO L175 Difference]: Start difference. First operand has 297 places, 295 transitions, 606 flow. Second operand 3 states and 952 transitions. [2025-03-17 11:14:28,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 292 transitions, 634 flow [2025-03-17 11:14:28,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 292 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:28,526 INFO L231 Difference]: Finished difference. Result has 294 places, 292 transitions, 598 flow [2025-03-17 11:14:28,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=294, PETRI_TRANSITIONS=292} [2025-03-17 11:14:28,528 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -52 predicate places. [2025-03-17 11:14:28,528 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 292 transitions, 598 flow [2025-03-17 11:14:28,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:28,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:28,529 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] [2025-03-17 11:14:28,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:14:28,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:28,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1729875804, now seen corresponding path program 1 times [2025-03-17 11:14:28,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:28,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382375619] [2025-03-17 11:14:28,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:28,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 11:14:28,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 11:14:28,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:28,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:28,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:28,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382375619] [2025-03-17 11:14:28,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382375619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:28,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:28,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979311435] [2025-03-17 11:14:28,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:28,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:28,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:28,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:29,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 370 [2025-03-17 11:14:29,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 292 transitions, 598 flow. Second operand has 6 states, 6 states have (on average 306.1666666666667) internal successors, (1837), 6 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:29,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 370 [2025-03-17 11:14:29,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:29,104 INFO L124 PetriNetUnfolderBase]: 34/476 cut-off events. [2025-03-17 11:14:29,105 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-03-17 11:14:29,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 476 events. 34/476 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1395 event pairs, 10 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 492. Up to 49 conditions per place. [2025-03-17 11:14:29,106 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 21 selfloop transitions, 4 changer transitions 0/291 dead transitions. [2025-03-17 11:14:29,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 291 transitions, 646 flow [2025-03-17 11:14:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1855 transitions. [2025-03-17 11:14:29,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355855855855856 [2025-03-17 11:14:29,110 INFO L175 Difference]: Start difference. First operand has 294 places, 292 transitions, 598 flow. Second operand 6 states and 1855 transitions. [2025-03-17 11:14:29,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 291 transitions, 646 flow [2025-03-17 11:14:29,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 291 transitions, 645 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:29,113 INFO L231 Difference]: Finished difference. Result has 297 places, 291 transitions, 603 flow [2025-03-17 11:14:29,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=603, PETRI_PLACES=297, PETRI_TRANSITIONS=291} [2025-03-17 11:14:29,114 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -49 predicate places. [2025-03-17 11:14:29,114 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 291 transitions, 603 flow [2025-03-17 11:14:29,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 306.1666666666667) internal successors, (1837), 6 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:29,115 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] [2025-03-17 11:14:29,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:14:29,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:29,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 899180065, now seen corresponding path program 1 times [2025-03-17 11:14:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:29,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670565779] [2025-03-17 11:14:29,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:29,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 11:14:29,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 11:14:29,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:29,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:29,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:29,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670565779] [2025-03-17 11:14:29,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670565779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:29,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:29,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831271549] [2025-03-17 11:14:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:29,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:29,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:29,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:29,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-03-17 11:14:29,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 291 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:29,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-03-17 11:14:29,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:29,226 INFO L124 PetriNetUnfolderBase]: 46/487 cut-off events. [2025-03-17 11:14:29,226 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-03-17 11:14:29,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 487 events. 46/487 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1582 event pairs, 16 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 518. Up to 72 conditions per place. [2025-03-17 11:14:29,228 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 16 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-03-17 11:14:29,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 290 transitions, 637 flow [2025-03-17 11:14:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-03-17 11:14:29,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567567567567568 [2025-03-17 11:14:29,230 INFO L175 Difference]: Start difference. First operand has 297 places, 291 transitions, 603 flow. Second operand 3 states and 951 transitions. [2025-03-17 11:14:29,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 290 transitions, 637 flow [2025-03-17 11:14:29,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 290 transitions, 630 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:14:29,234 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 598 flow [2025-03-17 11:14:29,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2025-03-17 11:14:29,235 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -52 predicate places. [2025-03-17 11:14:29,235 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 598 flow [2025-03-17 11:14:29,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:29,236 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] [2025-03-17 11:14:29,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:14:29,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:29,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1248117506, now seen corresponding path program 1 times [2025-03-17 11:14:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:29,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677596663] [2025-03-17 11:14:29,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:29,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 11:14:29,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 11:14:29,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:29,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:29,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:29,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677596663] [2025-03-17 11:14:29,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677596663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:29,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:29,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318304477] [2025-03-17 11:14:29,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:29,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:29,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:29,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:29,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-03-17 11:14:29,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:29,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-03-17 11:14:29,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:29,346 INFO L124 PetriNetUnfolderBase]: 62/574 cut-off events. [2025-03-17 11:14:29,346 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2025-03-17 11:14:29,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 574 events. 62/574 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2111 event pairs, 13 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 626. Up to 58 conditions per place. [2025-03-17 11:14:29,349 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 19 selfloop transitions, 3 changer transitions 0/294 dead transitions. [2025-03-17 11:14:29,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 294 transitions, 652 flow [2025-03-17 11:14:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2025-03-17 11:14:29,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8675675675675676 [2025-03-17 11:14:29,351 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 598 flow. Second operand 3 states and 963 transitions. [2025-03-17 11:14:29,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 294 transitions, 652 flow [2025-03-17 11:14:29,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 294 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:29,354 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 610 flow [2025-03-17 11:14:29,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2025-03-17 11:14:29,355 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -52 predicate places. [2025-03-17 11:14:29,355 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 610 flow [2025-03-17 11:14:29,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:29,356 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-17 11:14:29,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:14:29,356 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:29,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 908399313, now seen corresponding path program 1 times [2025-03-17 11:14:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966857494] [2025-03-17 11:14:29,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:29,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:14:29,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:14:29,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:29,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:29,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966857494] [2025-03-17 11:14:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966857494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350503289] [2025-03-17 11:14:29,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:29,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:29,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:29,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 370 [2025-03-17 11:14:29,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:29,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 370 [2025-03-17 11:14:29,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:29,472 INFO L124 PetriNetUnfolderBase]: 55/681 cut-off events. [2025-03-17 11:14:29,472 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2025-03-17 11:14:29,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 681 events. 55/681 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2656 event pairs, 23 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 755. Up to 74 conditions per place. [2025-03-17 11:14:29,475 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 15 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-03-17 11:14:29,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 289 transitions, 642 flow [2025-03-17 11:14:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 953 transitions. [2025-03-17 11:14:29,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8585585585585586 [2025-03-17 11:14:29,477 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 610 flow. Second operand 3 states and 953 transitions. [2025-03-17 11:14:29,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 289 transitions, 642 flow [2025-03-17 11:14:29,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 289 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:29,480 INFO L231 Difference]: Finished difference. Result has 293 places, 289 transitions, 606 flow [2025-03-17 11:14:29,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=293, PETRI_TRANSITIONS=289} [2025-03-17 11:14:29,481 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -53 predicate places. [2025-03-17 11:14:29,481 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 289 transitions, 606 flow [2025-03-17 11:14:29,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:29,482 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-17 11:14:29,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:14:29,482 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1379337147, now seen corresponding path program 1 times [2025-03-17 11:14:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:29,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668590575] [2025-03-17 11:14:29,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:29,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 11:14:29,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 11:14:29,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:29,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:29,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:29,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668590575] [2025-03-17 11:14:29,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668590575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:29,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:29,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852102147] [2025-03-17 11:14:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:29,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:29,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:29,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:29,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 370 [2025-03-17 11:14:29,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 289 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:29,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 370 [2025-03-17 11:14:29,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:29,643 INFO L124 PetriNetUnfolderBase]: 78/848 cut-off events. [2025-03-17 11:14:29,643 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-17 11:14:29,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 848 events. 78/848 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3977 event pairs, 28 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 967. Up to 106 conditions per place. [2025-03-17 11:14:29,648 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 18 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2025-03-17 11:14:29,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 292 transitions, 661 flow [2025-03-17 11:14:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2025-03-17 11:14:29,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8639639639639639 [2025-03-17 11:14:29,650 INFO L175 Difference]: Start difference. First operand has 293 places, 289 transitions, 606 flow. Second operand 3 states and 959 transitions. [2025-03-17 11:14:29,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 292 transitions, 661 flow [2025-03-17 11:14:29,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 292 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:29,654 INFO L231 Difference]: Finished difference. Result has 291 places, 289 transitions, 620 flow [2025-03-17 11:14:29,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=291, PETRI_TRANSITIONS=289} [2025-03-17 11:14:29,655 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -55 predicate places. [2025-03-17 11:14:29,655 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 289 transitions, 620 flow [2025-03-17 11:14:29,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:29,656 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] [2025-03-17 11:14:29,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:14:29,656 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:29,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash -616344151, now seen corresponding path program 1 times [2025-03-17 11:14:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:29,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860229072] [2025-03-17 11:14:29,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:29,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 11:14:29,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 11:14:29,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:29,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:29,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860229072] [2025-03-17 11:14:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860229072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119674869] [2025-03-17 11:14:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:29,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:29,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:29,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:29,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-03-17 11:14:29,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 289 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:29,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-03-17 11:14:29,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:29,825 INFO L124 PetriNetUnfolderBase]: 63/652 cut-off events. [2025-03-17 11:14:29,825 INFO L125 PetriNetUnfolderBase]: For 74/82 co-relation queries the response was YES. [2025-03-17 11:14:29,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 652 events. 63/652 cut-off events. For 74/82 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2872 event pairs, 17 based on Foata normal form. 2/576 useless extension candidates. Maximal degree in co-relation 785. Up to 69 conditions per place. [2025-03-17 11:14:29,828 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 16 selfloop transitions, 2 changer transitions 2/290 dead transitions. [2025-03-17 11:14:29,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 290 transitions, 666 flow [2025-03-17 11:14:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2025-03-17 11:14:29,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863063063063063 [2025-03-17 11:14:29,830 INFO L175 Difference]: Start difference. First operand has 291 places, 289 transitions, 620 flow. Second operand 3 states and 958 transitions. [2025-03-17 11:14:29,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 290 transitions, 666 flow [2025-03-17 11:14:29,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 290 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:29,833 INFO L231 Difference]: Finished difference. Result has 290 places, 285 transitions, 611 flow [2025-03-17 11:14:29,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=290, PETRI_TRANSITIONS=285} [2025-03-17 11:14:29,834 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -56 predicate places. [2025-03-17 11:14:29,834 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 285 transitions, 611 flow [2025-03-17 11:14:29,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:29,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:29,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:29,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:14:29,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:29,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash -229910417, now seen corresponding path program 1 times [2025-03-17 11:14:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862225928] [2025-03-17 11:14:29,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:29,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:29,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 11:14:29,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 11:14:29,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:29,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:29,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:29,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862225928] [2025-03-17 11:14:29,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862225928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:29,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:29,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:14:29,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140167108] [2025-03-17 11:14:29,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:29,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:14:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:29,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:14:29,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:14:30,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 370 [2025-03-17 11:14:30,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 285 transitions, 611 flow. Second operand has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:30,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:30,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 370 [2025-03-17 11:14:30,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:30,391 INFO L124 PetriNetUnfolderBase]: 91/1159 cut-off events. [2025-03-17 11:14:30,391 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-17 11:14:30,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 1159 events. 91/1159 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5677 event pairs, 19 based on Foata normal form. 0/1034 useless extension candidates. Maximal degree in co-relation 1397. Up to 65 conditions per place. [2025-03-17 11:14:30,396 INFO L140 encePairwiseOnDemand]: 356/370 looper letters, 43 selfloop transitions, 15 changer transitions 0/309 dead transitions. [2025-03-17 11:14:30,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 309 transitions, 801 flow [2025-03-17 11:14:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:14:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:14:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3032 transitions. [2025-03-17 11:14:30,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194594594594594 [2025-03-17 11:14:30,401 INFO L175 Difference]: Start difference. First operand has 290 places, 285 transitions, 611 flow. Second operand 10 states and 3032 transitions. [2025-03-17 11:14:30,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 309 transitions, 801 flow [2025-03-17 11:14:30,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 309 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:30,406 INFO L231 Difference]: Finished difference. Result has 299 places, 292 transitions, 681 flow [2025-03-17 11:14:30,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=681, PETRI_PLACES=299, PETRI_TRANSITIONS=292} [2025-03-17 11:14:30,406 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -47 predicate places. [2025-03-17 11:14:30,406 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 292 transitions, 681 flow [2025-03-17 11:14:30,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:30,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:30,407 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] [2025-03-17 11:14:30,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:14:30,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:30,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1573430321, now seen corresponding path program 1 times [2025-03-17 11:14:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:30,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796241865] [2025-03-17 11:14:30,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:30,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 11:14:30,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 11:14:30,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:30,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:30,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:30,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796241865] [2025-03-17 11:14:30,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796241865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:30,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:30,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:30,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723710255] [2025-03-17 11:14:30,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:30,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:30,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:30,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:30,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-03-17 11:14:30,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 292 transitions, 681 flow. Second operand has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:30,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:30,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-03-17 11:14:30,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:30,598 INFO L124 PetriNetUnfolderBase]: 136/1073 cut-off events. [2025-03-17 11:14:30,598 INFO L125 PetriNetUnfolderBase]: For 176/202 co-relation queries the response was YES. [2025-03-17 11:14:30,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1073 events. 136/1073 cut-off events. For 176/202 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5730 event pairs, 57 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1486. Up to 188 conditions per place. [2025-03-17 11:14:30,604 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 20 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2025-03-17 11:14:30,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 295 transitions, 741 flow [2025-03-17 11:14:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-17 11:14:30,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8621621621621621 [2025-03-17 11:14:30,606 INFO L175 Difference]: Start difference. First operand has 299 places, 292 transitions, 681 flow. Second operand 3 states and 957 transitions. [2025-03-17 11:14:30,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 295 transitions, 741 flow [2025-03-17 11:14:30,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 295 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:30,611 INFO L231 Difference]: Finished difference. Result has 298 places, 291 transitions, 677 flow [2025-03-17 11:14:30,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=298, PETRI_TRANSITIONS=291} [2025-03-17 11:14:30,612 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -48 predicate places. [2025-03-17 11:14:30,612 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 291 transitions, 677 flow [2025-03-17 11:14:30,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:30,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:30,612 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] [2025-03-17 11:14:30,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:14:30,612 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:30,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:30,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1572475054, now seen corresponding path program 1 times [2025-03-17 11:14:30,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:30,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545933456] [2025-03-17 11:14:30,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:30,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:30,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 11:14:30,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 11:14:30,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:30,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:30,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545933456] [2025-03-17 11:14:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545933456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:30,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116506088] [2025-03-17 11:14:30,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:30,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:30,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:30,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:30,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 370 [2025-03-17 11:14:30,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 291 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:30,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:30,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 370 [2025-03-17 11:14:30,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:30,795 INFO L124 PetriNetUnfolderBase]: 110/1090 cut-off events. [2025-03-17 11:14:30,795 INFO L125 PetriNetUnfolderBase]: For 140/160 co-relation queries the response was YES. [2025-03-17 11:14:30,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 1090 events. 110/1090 cut-off events. For 140/160 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5691 event pairs, 18 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1474. Up to 130 conditions per place. [2025-03-17 11:14:30,801 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 18 selfloop transitions, 3 changer transitions 0/294 dead transitions. [2025-03-17 11:14:30,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 294 transitions, 734 flow [2025-03-17 11:14:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-17 11:14:30,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8684684684684685 [2025-03-17 11:14:30,803 INFO L175 Difference]: Start difference. First operand has 298 places, 291 transitions, 677 flow. Second operand 3 states and 964 transitions. [2025-03-17 11:14:30,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 294 transitions, 734 flow [2025-03-17 11:14:30,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 294 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:30,808 INFO L231 Difference]: Finished difference. Result has 297 places, 290 transitions, 682 flow [2025-03-17 11:14:30,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=297, PETRI_TRANSITIONS=290} [2025-03-17 11:14:30,808 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -49 predicate places. [2025-03-17 11:14:30,808 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 290 transitions, 682 flow [2025-03-17 11:14:30,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:30,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:30,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:30,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:14:30,809 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:30,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -344246411, now seen corresponding path program 1 times [2025-03-17 11:14:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:30,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325857892] [2025-03-17 11:14:30,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:30,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 11:14:30,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 11:14:30,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:30,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:30,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:30,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325857892] [2025-03-17 11:14:30,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325857892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:30,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:30,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:30,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633681335] [2025-03-17 11:14:30,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:30,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:30,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:30,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:30,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-03-17 11:14:30,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 290 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:30,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:30,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-03-17 11:14:30,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:30,984 INFO L124 PetriNetUnfolderBase]: 112/1078 cut-off events. [2025-03-17 11:14:30,984 INFO L125 PetriNetUnfolderBase]: For 210/229 co-relation queries the response was YES. [2025-03-17 11:14:30,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 1078 events. 112/1078 cut-off events. For 210/229 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5592 event pairs, 45 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 1501. Up to 168 conditions per place. [2025-03-17 11:14:30,989 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 21 selfloop transitions, 3 changer transitions 5/293 dead transitions. [2025-03-17 11:14:30,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 293 transitions, 747 flow [2025-03-17 11:14:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2025-03-17 11:14:30,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863063063063063 [2025-03-17 11:14:30,991 INFO L175 Difference]: Start difference. First operand has 297 places, 290 transitions, 682 flow. Second operand 3 states and 958 transitions. [2025-03-17 11:14:30,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 293 transitions, 747 flow [2025-03-17 11:14:30,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 293 transitions, 740 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:30,995 INFO L231 Difference]: Finished difference. Result has 296 places, 285 transitions, 660 flow [2025-03-17 11:14:30,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=296, PETRI_TRANSITIONS=285} [2025-03-17 11:14:30,996 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -50 predicate places. [2025-03-17 11:14:30,996 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 285 transitions, 660 flow [2025-03-17 11:14:30,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:30,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:30,996 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] [2025-03-17 11:14:30,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:14:30,997 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:30,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1340650551, now seen corresponding path program 1 times [2025-03-17 11:14:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:30,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766668269] [2025-03-17 11:14:30,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:31,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 11:14:31,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 11:14:31,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:31,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:14:31,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:31,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766668269] [2025-03-17 11:14:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766668269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:31,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:31,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167290083] [2025-03-17 11:14:31,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:31,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:31,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:31,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:31,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 370 [2025-03-17 11:14:31,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 285 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 300.1666666666667) internal successors, (1801), 6 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:31,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:31,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 370 [2025-03-17 11:14:31,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:31,711 INFO L124 PetriNetUnfolderBase]: 168/1128 cut-off events. [2025-03-17 11:14:31,711 INFO L125 PetriNetUnfolderBase]: For 176/178 co-relation queries the response was YES. [2025-03-17 11:14:31,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1689 conditions, 1128 events. 168/1128 cut-off events. For 176/178 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6292 event pairs, 14 based on Foata normal form. 0/1060 useless extension candidates. Maximal degree in co-relation 1613. Up to 176 conditions per place. [2025-03-17 11:14:31,720 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 47 selfloop transitions, 6 changer transitions 0/303 dead transitions. [2025-03-17 11:14:31,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 303 transitions, 834 flow [2025-03-17 11:14:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1835 transitions. [2025-03-17 11:14:31,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8265765765765766 [2025-03-17 11:14:31,724 INFO L175 Difference]: Start difference. First operand has 296 places, 285 transitions, 660 flow. Second operand 6 states and 1835 transitions. [2025-03-17 11:14:31,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 303 transitions, 834 flow [2025-03-17 11:14:31,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 303 transitions, 813 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-17 11:14:31,728 INFO L231 Difference]: Finished difference. Result has 290 places, 283 transitions, 647 flow [2025-03-17 11:14:31,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=647, PETRI_PLACES=290, PETRI_TRANSITIONS=283} [2025-03-17 11:14:31,729 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -56 predicate places. [2025-03-17 11:14:31,729 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 283 transitions, 647 flow [2025-03-17 11:14:31,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.1666666666667) internal successors, (1801), 6 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:31,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:31,730 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] [2025-03-17 11:14:31,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:14:31,730 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:31,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash 125043786, now seen corresponding path program 1 times [2025-03-17 11:14:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084604616] [2025-03-17 11:14:31,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:31,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:31,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 11:14:31,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 11:14:31,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:31,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:14:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:31,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084604616] [2025-03-17 11:14:31,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084604616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:31,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:31,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937270027] [2025-03-17 11:14:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:31,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:31,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:31,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:31,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 370 [2025-03-17 11:14:31,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 283 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:31,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:31,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 370 [2025-03-17 11:14:31,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:31,910 INFO L124 PetriNetUnfolderBase]: 113/1179 cut-off events. [2025-03-17 11:14:31,910 INFO L125 PetriNetUnfolderBase]: For 208/211 co-relation queries the response was YES. [2025-03-17 11:14:31,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 1179 events. 113/1179 cut-off events. For 208/211 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6312 event pairs, 21 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 1557. Up to 103 conditions per place. [2025-03-17 11:14:31,916 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 25 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-03-17 11:14:31,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 293 transitions, 746 flow [2025-03-17 11:14:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-17 11:14:31,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872072072072072 [2025-03-17 11:14:31,918 INFO L175 Difference]: Start difference. First operand has 290 places, 283 transitions, 647 flow. Second operand 3 states and 968 transitions. [2025-03-17 11:14:31,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 293 transitions, 746 flow [2025-03-17 11:14:31,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 293 transitions, 730 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:14:31,923 INFO L231 Difference]: Finished difference. Result has 287 places, 283 transitions, 643 flow [2025-03-17 11:14:31,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=287, PETRI_TRANSITIONS=283} [2025-03-17 11:14:31,924 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -59 predicate places. [2025-03-17 11:14:31,924 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 283 transitions, 643 flow [2025-03-17 11:14:31,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:31,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:31,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:31,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:14:31,925 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-03-17 11:14:31,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2133604355, now seen corresponding path program 1 times [2025-03-17 11:14:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:31,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875567867] [2025-03-17 11:14:31,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:31,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-17 11:14:31,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 11:14:31,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:31,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:14:32,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:32,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875567867] [2025-03-17 11:14:32,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875567867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:32,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:32,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:32,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639699209] [2025-03-17 11:14:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:32,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:32,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:32,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:32,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:32,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 370 [2025-03-17 11:14:32,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 283 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:32,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:32,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 370 [2025-03-17 11:14:32,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:32,190 INFO L124 PetriNetUnfolderBase]: 153/1359 cut-off events. [2025-03-17 11:14:32,190 INFO L125 PetriNetUnfolderBase]: For 188/201 co-relation queries the response was YES. [2025-03-17 11:14:32,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 1359 events. 153/1359 cut-off events. For 188/201 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7899 event pairs, 60 based on Foata normal form. 1/1288 useless extension candidates. Maximal degree in co-relation 1828. Up to 175 conditions per place. [2025-03-17 11:14:32,194 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2025-03-17 11:14:32,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 287 transitions, 707 flow [2025-03-17 11:14:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2025-03-17 11:14:32,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8657657657657658 [2025-03-17 11:14:32,196 INFO L175 Difference]: Start difference. First operand has 287 places, 283 transitions, 643 flow. Second operand 3 states and 961 transitions. [2025-03-17 11:14:32,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 287 transitions, 707 flow [2025-03-17 11:14:32,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 287 transitions, 705 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:32,199 INFO L231 Difference]: Finished difference. Result has 287 places, 0 transitions, 0 flow [2025-03-17 11:14:32,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=287, PETRI_TRANSITIONS=0} [2025-03-17 11:14:32,199 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -59 predicate places. [2025-03-17 11:14:32,199 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 0 transitions, 0 flow [2025-03-17 11:14:32,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:32,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (116 of 117 remaining) [2025-03-17 11:14:32,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (115 of 117 remaining) [2025-03-17 11:14:32,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (114 of 117 remaining) [2025-03-17 11:14:32,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (113 of 117 remaining) [2025-03-17 11:14:32,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (112 of 117 remaining) [2025-03-17 11:14:32,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (111 of 117 remaining) [2025-03-17 11:14:32,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (110 of 117 remaining) [2025-03-17 11:14:32,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (109 of 117 remaining) [2025-03-17 11:14:32,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (108 of 117 remaining) [2025-03-17 11:14:32,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (107 of 117 remaining) [2025-03-17 11:14:32,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (106 of 117 remaining) [2025-03-17 11:14:32,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (105 of 117 remaining) [2025-03-17 11:14:32,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (104 of 117 remaining) [2025-03-17 11:14:32,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (103 of 117 remaining) [2025-03-17 11:14:32,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (102 of 117 remaining) [2025-03-17 11:14:32,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (101 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (100 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (99 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (98 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (97 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (96 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (95 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (94 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (93 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (92 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (91 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (90 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (89 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (88 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (87 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (86 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (85 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (84 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (83 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (82 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (81 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (80 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (79 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (78 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (77 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (76 of 117 remaining) [2025-03-17 11:14:32,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (75 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (74 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (73 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (72 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (71 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (70 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (69 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (68 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (67 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (66 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (65 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (64 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (63 of 117 remaining) [2025-03-17 11:14:32,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (61 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (60 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (59 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (58 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (57 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (56 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (55 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (54 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (53 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (51 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (50 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (47 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (46 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (45 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (44 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (43 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (42 of 117 remaining) [2025-03-17 11:14:32,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (41 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (40 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (39 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (38 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (37 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (35 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (34 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (32 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (31 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (28 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (24 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (21 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (20 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 117 remaining) [2025-03-17 11:14:32,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 117 remaining) [2025-03-17 11:14:32,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 117 remaining) [2025-03-17 11:14:32,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:14:32,208 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:32,212 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:14:32,212 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:14:32,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:14:32 BasicIcfg [2025-03-17 11:14:32,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:14:32,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:14:32,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:14:32,218 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:14:32,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:25" (3/4) ... [2025-03-17 11:14:32,219 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:14:32,221 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:14:32,221 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:14:32,225 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-17 11:14:32,226 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:14:32,226 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:14:32,226 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:14:32,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:14:32,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:14:32,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:14:32,286 INFO L158 Benchmark]: Toolchain (without parser) took 7931.97ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 123.6MB in the beginning and 328.9MB in the end (delta: -205.2MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2025-03-17 11:14:32,286 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:14:32,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.95ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 110.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:14:32,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.86ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 107.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:14:32,286 INFO L158 Benchmark]: Boogie Preprocessor took 36.03ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:14:32,287 INFO L158 Benchmark]: IcfgBuilder took 900.15ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 117.1MB in the end (delta: -11.3MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2025-03-17 11:14:32,287 INFO L158 Benchmark]: TraceAbstraction took 6643.78ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 116.2MB in the beginning and 337.3MB in the end (delta: -221.0MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2025-03-17 11:14:32,287 INFO L158 Benchmark]: Witness Printer took 67.65ms. Allocated memory is still 520.1MB. Free memory was 337.3MB in the beginning and 328.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:14:32,288 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.95ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 110.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.86ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 107.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.03ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 900.15ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 117.1MB in the end (delta: -11.3MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6643.78ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 116.2MB in the beginning and 337.3MB in the end (delta: -221.0MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. * Witness Printer took 67.65ms. Allocated memory is still 520.1MB. Free memory was 337.3MB in the beginning and 328.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 480 locations, 497 edges, 117 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.5s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1087 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 594 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1700 IncrementalHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 111 mSDtfsCounter, 1700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=714occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3058 NumberOfCodeBlocks, 3058 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3033 ConstructedInterpolants, 0 QuantifiedInterpolants, 3979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 33/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:14:32,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE