./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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-three-array-sum.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 c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:56:08,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:56:08,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:56:08,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:56:08,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:56:08,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:56:08,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:56:08,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:56:08,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:56:08,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:56:08,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:56:08,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:56:08,481 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:56:08,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:56:08,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:56:08,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:56:08,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:56:08,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:56:08,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:56:08,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:56:08,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:56:08,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:56:08,482 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:56:08,482 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:56:08,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:56:08,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:56:08,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:56:08,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:56:08,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:56:08,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:56:08,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:56:08,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:08,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:56:08,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:56:08,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:56:08,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:56:08,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:56:08,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:56:08,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:56:08,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:56:08,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:56:08,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:56:08,484 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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2025-03-04 06:56:08,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:56:08,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:56:08,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:56:08,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:56:08,697 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:56:08,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-04 06:56:09,859 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36ab4012/e72a8f7ced9c4a159d3ca435c611ed7f/FLAG5bf7a99ad [2025-03-04 06:56:10,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:56:10,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-04 06:56:10,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36ab4012/e72a8f7ced9c4a159d3ca435c611ed7f/FLAG5bf7a99ad [2025-03-04 06:56:10,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36ab4012/e72a8f7ced9c4a159d3ca435c611ed7f [2025-03-04 06:56:10,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:56:10,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:56:10,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:10,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:56:10,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:56:10,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343b0fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10, skipping insertion in model container [2025-03-04 06:56:10,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:56:10,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:10,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:56:10,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:10,666 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:56:10,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10 WrapperNode [2025-03-04 06:56:10,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:10,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:10,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:56:10,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:56:10,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,719 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 180 [2025-03-04 06:56:10,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:10,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:56:10,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:56:10,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:56:10,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,757 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:56:10,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:56:10,767 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:56:10,767 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:56:10,768 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (1/1) ... [2025-03-04 06:56:10,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:10,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:10,796 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-04 06:56:10,798 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-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:56:10,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:56:10,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:56:10,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:56:10,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:56:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:56:10,820 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:56:10,925 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:56:10,926 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:56:11,365 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:56:11,365 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:56:11,445 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:56:11,446 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:56:11,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:11 BoogieIcfgContainer [2025-03-04 06:56:11,446 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:56:11,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:56:11,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:56:11,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:56:11,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:56:10" (1/3) ... [2025-03-04 06:56:11,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62467df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:11, skipping insertion in model container [2025-03-04 06:56:11,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:10" (2/3) ... [2025-03-04 06:56:11,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62467df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:11, skipping insertion in model container [2025-03-04 06:56:11,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:11" (3/3) ... [2025-03-04 06:56:11,454 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-03-04 06:56:11,465 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:56:11,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 325 locations, 1 initial locations, 6 loop locations, and 36 error locations. [2025-03-04 06:56:11,466 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:56:11,566 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:56:11,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 341 transitions, 703 flow [2025-03-04 06:56:11,693 INFO L124 PetriNetUnfolderBase]: 17/338 cut-off events. [2025-03-04 06:56:11,696 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:56:11,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 338 events. 17/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 471 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 288. Up to 2 conditions per place. [2025-03-04 06:56:11,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 341 transitions, 703 flow [2025-03-04 06:56:11,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 321 transitions, 660 flow [2025-03-04 06:56:11,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:11,727 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;@68b752f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:11,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-04 06:56:11,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:11,732 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-04 06:56:11,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:11,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:11,733 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-04 06:56:11,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:11,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1511404121, now seen corresponding path program 1 times [2025-03-04 06:56:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:11,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693807532] [2025-03-04 06:56:11,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:11,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:56:11,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:56:11,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:11,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:11,875 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-04 06:56:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:11,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693807532] [2025-03-04 06:56:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693807532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:11,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:11,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629784207] [2025-03-04 06:56:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:11,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:11,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:11,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:11,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 341 [2025-03-04 06:56:11,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 321 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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-04 06:56:11,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:11,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 341 [2025-03-04 06:56:11,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:12,125 INFO L124 PetriNetUnfolderBase]: 85/884 cut-off events. [2025-03-04 06:56:12,126 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 06:56:12,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 884 events. 85/884 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4525 event pairs, 51 based on Foata normal form. 6/746 useless extension candidates. Maximal degree in co-relation 759. Up to 134 conditions per place. [2025-03-04 06:56:12,135 INFO L140 encePairwiseOnDemand]: 317/341 looper letters, 18 selfloop transitions, 2 changer transitions 6/299 dead transitions. [2025-03-04 06:56:12,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 656 flow [2025-03-04 06:56:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-03-04 06:56:12,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-04 06:56:12,152 INFO L175 Difference]: Start difference. First operand has 315 places, 321 transitions, 660 flow. Second operand 3 states and 930 transitions. [2025-03-04 06:56:12,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 656 flow [2025-03-04 06:56:12,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 299 transitions, 644 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:56:12,163 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 596 flow [2025-03-04 06:56:12,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=296, 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=596, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2025-03-04 06:56:12,170 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -17 predicate places. [2025-03-04 06:56:12,171 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 596 flow [2025-03-04 06:56:12,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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-04 06:56:12,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:12,172 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] [2025-03-04 06:56:12,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:56:12,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:12,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash -599509574, now seen corresponding path program 1 times [2025-03-04 06:56:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:12,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055831979] [2025-03-04 06:56:12,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:12,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 06:56:12,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 06:56:12,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:12,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:12,223 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-04 06:56:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:12,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055831979] [2025-03-04 06:56:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055831979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989369128] [2025-03-04 06:56:12,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:12,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:12,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:12,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 341 [2025-03-04 06:56:12,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 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-04 06:56:12,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:12,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 341 [2025-03-04 06:56:12,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:12,395 INFO L124 PetriNetUnfolderBase]: 213/995 cut-off events. [2025-03-04 06:56:12,395 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 06:56:12,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 995 events. 213/995 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5256 event pairs, 128 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 1281. Up to 297 conditions per place. [2025-03-04 06:56:12,404 INFO L140 encePairwiseOnDemand]: 334/341 looper letters, 21 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2025-03-04 06:56:12,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 287 transitions, 628 flow [2025-03-04 06:56:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-03-04 06:56:12,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778103616813294 [2025-03-04 06:56:12,408 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 596 flow. Second operand 3 states and 898 transitions. [2025-03-04 06:56:12,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 287 transitions, 628 flow [2025-03-04 06:56:12,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 287 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:12,414 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 582 flow [2025-03-04 06:56:12,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=286, PETRI_TRANSITIONS=287} [2025-03-04 06:56:12,416 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -29 predicate places. [2025-03-04 06:56:12,417 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 582 flow [2025-03-04 06:56:12,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 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-04 06:56:12,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:12,417 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] [2025-03-04 06:56:12,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:56:12,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:12,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:12,418 INFO L85 PathProgramCache]: Analyzing trace with hash 230068609, now seen corresponding path program 1 times [2025-03-04 06:56:12,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:12,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364767030] [2025-03-04 06:56:12,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:12,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:56:12,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:56:12,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:12,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:12,973 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-04 06:56:12,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:12,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364767030] [2025-03-04 06:56:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364767030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:12,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:12,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130788094] [2025-03-04 06:56:12,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:12,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:12,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:12,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:13,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 341 [2025-03-04 06:56:13,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 287 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 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-04 06:56:13,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:13,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 341 [2025-03-04 06:56:13,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:13,424 INFO L124 PetriNetUnfolderBase]: 130/889 cut-off events. [2025-03-04 06:56:13,425 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 06:56:13,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 889 events. 130/889 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4386 event pairs, 100 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1133. Up to 230 conditions per place. [2025-03-04 06:56:13,431 INFO L140 encePairwiseOnDemand]: 323/341 looper letters, 41 selfloop transitions, 15 changer transitions 0/284 dead transitions. [2025-03-04 06:56:13,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 688 flow [2025-03-04 06:56:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1613 transitions. [2025-03-04 06:56:13,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7883675464320625 [2025-03-04 06:56:13,435 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 582 flow. Second operand 6 states and 1613 transitions. [2025-03-04 06:56:13,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 688 flow [2025-03-04 06:56:13,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:13,440 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 605 flow [2025-03-04 06:56:13,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2025-03-04 06:56:13,441 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -28 predicate places. [2025-03-04 06:56:13,441 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 605 flow [2025-03-04 06:56:13,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 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-04 06:56:13,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:13,442 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-04 06:56:13,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:56:13,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:13,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:13,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1114254746, now seen corresponding path program 1 times [2025-03-04 06:56:13,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:13,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334898163] [2025-03-04 06:56:13,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:13,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:56:13,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:56:13,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:13,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:13,482 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-04 06:56:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334898163] [2025-03-04 06:56:13,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334898163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:13,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:13,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:13,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733793760] [2025-03-04 06:56:13,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:13,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:13,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:13,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:13,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:13,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 341 [2025-03-04 06:56:13,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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-04 06:56:13,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:13,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 341 [2025-03-04 06:56:13,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:13,575 INFO L124 PetriNetUnfolderBase]: 37/389 cut-off events. [2025-03-04 06:56:13,575 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:56:13,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 389 events. 37/389 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1081 event pairs, 23 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 438. Up to 55 conditions per place. [2025-03-04 06:56:13,578 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 13 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-03-04 06:56:13,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 633 flow [2025-03-04 06:56:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-03-04 06:56:13,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983382209188661 [2025-03-04 06:56:13,580 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 605 flow. Second operand 3 states and 919 transitions. [2025-03-04 06:56:13,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 633 flow [2025-03-04 06:56:13,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 283 transitions, 603 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:13,584 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 577 flow [2025-03-04 06:56:13,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2025-03-04 06:56:13,585 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-03-04 06:56:13,585 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 577 flow [2025-03-04 06:56:13,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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-04 06:56:13,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:13,586 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-04 06:56:13,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:56:13,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:13,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash -744180188, now seen corresponding path program 1 times [2025-03-04 06:56:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056150728] [2025-03-04 06:56:13,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:13,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:56:13,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:56:13,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:13,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:13,623 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-04 06:56:13,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:13,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056150728] [2025-03-04 06:56:13,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056150728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:13,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:13,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:13,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222264713] [2025-03-04 06:56:13,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:13,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:13,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:13,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:13,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:13,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 341 [2025-03-04 06:56:13,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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-04 06:56:13,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:13,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 341 [2025-03-04 06:56:13,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:13,704 INFO L124 PetriNetUnfolderBase]: 37/388 cut-off events. [2025-03-04 06:56:13,705 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:56:13,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 388 events. 37/388 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1060 event pairs, 23 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 424. Up to 55 conditions per place. [2025-03-04 06:56:13,707 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-04 06:56:13,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 605 flow [2025-03-04 06:56:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-03-04 06:56:13,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983382209188661 [2025-03-04 06:56:13,709 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 577 flow. Second operand 3 states and 919 transitions. [2025-03-04 06:56:13,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 605 flow [2025-03-04 06:56:13,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 282 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:13,713 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 575 flow [2025-03-04 06:56:13,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2025-03-04 06:56:13,714 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2025-03-04 06:56:13,714 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 575 flow [2025-03-04 06:56:13,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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-04 06:56:13,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:13,715 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] [2025-03-04 06:56:13,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:56:13,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:13,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1189391878, now seen corresponding path program 1 times [2025-03-04 06:56:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592661460] [2025-03-04 06:56:13,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:13,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 06:56:13,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 06:56:13,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:13,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:13,772 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-04 06:56:13,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:13,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592661460] [2025-03-04 06:56:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592661460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:13,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268924534] [2025-03-04 06:56:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:13,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:13,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:13,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:13,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:13,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-04 06:56:13,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-04 06:56:13,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:13,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-04 06:56:13,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:13,854 INFO L124 PetriNetUnfolderBase]: 21/319 cut-off events. [2025-03-04 06:56:13,854 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:56:13,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 319 events. 21/319 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 12 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 332. Up to 35 conditions per place. [2025-03-04 06:56:13,856 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 12 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-04 06:56:13,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 281 transitions, 601 flow [2025-03-04 06:56:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-03-04 06:56:13,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9002932551319648 [2025-03-04 06:56:13,859 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 575 flow. Second operand 3 states and 921 transitions. [2025-03-04 06:56:13,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 281 transitions, 601 flow [2025-03-04 06:56:13,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 281 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:13,864 INFO L231 Difference]: Finished difference. Result has 281 places, 281 transitions, 573 flow [2025-03-04 06:56:13,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=281, PETRI_TRANSITIONS=281} [2025-03-04 06:56:13,865 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -34 predicate places. [2025-03-04 06:56:13,865 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 281 transitions, 573 flow [2025-03-04 06:56:13,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-04 06:56:13,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:13,866 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] [2025-03-04 06:56:13,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:56:13,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:13,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1284512868, now seen corresponding path program 1 times [2025-03-04 06:56:13,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289589525] [2025-03-04 06:56:13,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:13,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 06:56:13,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 06:56:13,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:13,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:13,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:13,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289589525] [2025-03-04 06:56:13,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289589525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:13,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:13,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:13,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600090847] [2025-03-04 06:56:13,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:13,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:13,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:13,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:13,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:13,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-04 06:56:13,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 281 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 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-04 06:56:13,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:13,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-04 06:56:13,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:14,073 INFO L124 PetriNetUnfolderBase]: 59/519 cut-off events. [2025-03-04 06:56:14,073 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:56:14,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 519 events. 59/519 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2017 event pairs, 23 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 599. Up to 52 conditions per place. [2025-03-04 06:56:14,076 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 16 selfloop transitions, 3 changer transitions 0/284 dead transitions. [2025-03-04 06:56:14,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 284 transitions, 619 flow [2025-03-04 06:56:14,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2025-03-04 06:56:14,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.906158357771261 [2025-03-04 06:56:14,079 INFO L175 Difference]: Start difference. First operand has 281 places, 281 transitions, 573 flow. Second operand 3 states and 927 transitions. [2025-03-04 06:56:14,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 284 transitions, 619 flow [2025-03-04 06:56:14,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:14,082 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 571 flow [2025-03-04 06:56:14,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2025-03-04 06:56:14,083 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2025-03-04 06:56:14,083 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 571 flow [2025-03-04 06:56:14,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 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-04 06:56:14,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:14,084 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] [2025-03-04 06:56:14,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:56:14,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:14,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1761227139, now seen corresponding path program 1 times [2025-03-04 06:56:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893936502] [2025-03-04 06:56:14,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:14,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 06:56:14,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 06:56:14,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:14,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:14,128 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-04 06:56:14,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893936502] [2025-03-04 06:56:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893936502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:14,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782797768] [2025-03-04 06:56:14,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:14,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:14,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 341 [2025-03-04 06:56:14,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-04 06:56:14,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:14,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 341 [2025-03-04 06:56:14,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:14,234 INFO L124 PetriNetUnfolderBase]: 76/765 cut-off events. [2025-03-04 06:56:14,234 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 06:56:14,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 765 events. 76/765 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3517 event pairs, 8 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 878. Up to 99 conditions per place. [2025-03-04 06:56:14,239 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 19 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-03-04 06:56:14,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 287 transitions, 634 flow [2025-03-04 06:56:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2025-03-04 06:56:14,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9159335288367546 [2025-03-04 06:56:14,241 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 571 flow. Second operand 3 states and 937 transitions. [2025-03-04 06:56:14,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 287 transitions, 634 flow [2025-03-04 06:56:14,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 287 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:14,249 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 577 flow [2025-03-04 06:56:14,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2025-03-04 06:56:14,250 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2025-03-04 06:56:14,250 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 577 flow [2025-03-04 06:56:14,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-04 06:56:14,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:14,251 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] [2025-03-04 06:56:14,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:56:14,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:14,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 23314304, now seen corresponding path program 1 times [2025-03-04 06:56:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292200908] [2025-03-04 06:56:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:14,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 06:56:14,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 06:56:14,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:14,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:14,418 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-04 06:56:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292200908] [2025-03-04 06:56:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292200908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:56:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191187745] [2025-03-04 06:56:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:14,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:56:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:14,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:56:14,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:56:14,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 341 [2025-03-04 06:56:14,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 577 flow. Second operand has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 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-04 06:56:14,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:14,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 341 [2025-03-04 06:56:14,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:15,110 INFO L124 PetriNetUnfolderBase]: 202/1252 cut-off events. [2025-03-04 06:56:15,111 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-04 06:56:15,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 1252 events. 202/1252 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5665 event pairs, 96 based on Foata normal form. 9/1179 useless extension candidates. Maximal degree in co-relation 1748. Up to 201 conditions per place. [2025-03-04 06:56:15,118 INFO L140 encePairwiseOnDemand]: 312/341 looper letters, 52 selfloop transitions, 42 changer transitions 0/331 dead transitions. [2025-03-04 06:56:15,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 331 transitions, 885 flow [2025-03-04 06:56:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:56:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:56:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2852 transitions. [2025-03-04 06:56:15,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2025-03-04 06:56:15,123 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 577 flow. Second operand 10 states and 2852 transitions. [2025-03-04 06:56:15,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 331 transitions, 885 flow [2025-03-04 06:56:15,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 331 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:15,128 INFO L231 Difference]: Finished difference. Result has 292 places, 305 transitions, 769 flow [2025-03-04 06:56:15,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=769, PETRI_PLACES=292, PETRI_TRANSITIONS=305} [2025-03-04 06:56:15,129 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2025-03-04 06:56:15,129 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 305 transitions, 769 flow [2025-03-04 06:56:15,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 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-04 06:56:15,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:15,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:15,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:56:15,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:15,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1674449826, now seen corresponding path program 1 times [2025-03-04 06:56:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:15,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452892839] [2025-03-04 06:56:15,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:15,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:15,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 06:56:15,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 06:56:15,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:15,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:15,186 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-04 06:56:15,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:15,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452892839] [2025-03-04 06:56:15,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452892839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:15,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:15,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:15,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657363483] [2025-03-04 06:56:15,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:15,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:15,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:15,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:15,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 341 [2025-03-04 06:56:15,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 305 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 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-04 06:56:15,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:15,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 341 [2025-03-04 06:56:15,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:15,277 INFO L124 PetriNetUnfolderBase]: 90/783 cut-off events. [2025-03-04 06:56:15,277 INFO L125 PetriNetUnfolderBase]: For 77/80 co-relation queries the response was YES. [2025-03-04 06:56:15,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 783 events. 90/783 cut-off events. For 77/80 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2575 event pairs, 32 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 1037. Up to 120 conditions per place. [2025-03-04 06:56:15,282 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 11 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2025-03-04 06:56:15,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 304 transitions, 791 flow [2025-03-04 06:56:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-03-04 06:56:15,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-04 06:56:15,284 INFO L175 Difference]: Start difference. First operand has 292 places, 305 transitions, 769 flow. Second operand 3 states and 930 transitions. [2025-03-04 06:56:15,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 304 transitions, 791 flow [2025-03-04 06:56:15,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 304 transitions, 791 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:15,289 INFO L231 Difference]: Finished difference. Result has 293 places, 304 transitions, 769 flow [2025-03-04 06:56:15,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=293, PETRI_TRANSITIONS=304} [2025-03-04 06:56:15,290 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2025-03-04 06:56:15,291 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 304 transitions, 769 flow [2025-03-04 06:56:15,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 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-04 06:56:15,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:15,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:15,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:56:15,292 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:15,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1189261552, now seen corresponding path program 1 times [2025-03-04 06:56:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161220863] [2025-03-04 06:56:15,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:15,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:15,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 06:56:15,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 06:56:15,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:15,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:15,340 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-04 06:56:15,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:15,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161220863] [2025-03-04 06:56:15,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161220863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:15,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:15,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630273952] [2025-03-04 06:56:15,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:15,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:15,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:15,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:15,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-04 06:56:15,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 304 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 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-04 06:56:15,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:15,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-04 06:56:15,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:15,489 INFO L124 PetriNetUnfolderBase]: 136/970 cut-off events. [2025-03-04 06:56:15,490 INFO L125 PetriNetUnfolderBase]: For 98/99 co-relation queries the response was YES. [2025-03-04 06:56:15,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 970 events. 136/970 cut-off events. For 98/99 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3901 event pairs, 39 based on Foata normal form. 4/916 useless extension candidates. Maximal degree in co-relation 1330. Up to 141 conditions per place. [2025-03-04 06:56:15,495 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 15 selfloop transitions, 2 changer transitions 28/307 dead transitions. [2025-03-04 06:56:15,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 307 transitions, 817 flow [2025-03-04 06:56:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-03-04 06:56:15,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9051808406647116 [2025-03-04 06:56:15,497 INFO L175 Difference]: Start difference. First operand has 293 places, 304 transitions, 769 flow. Second operand 3 states and 926 transitions. [2025-03-04 06:56:15,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 307 transitions, 817 flow [2025-03-04 06:56:15,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:15,503 INFO L231 Difference]: Finished difference. Result has 292 places, 274 transitions, 644 flow [2025-03-04 06:56:15,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=292, PETRI_TRANSITIONS=274} [2025-03-04 06:56:15,504 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2025-03-04 06:56:15,504 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 274 transitions, 644 flow [2025-03-04 06:56:15,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 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-04 06:56:15,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:15,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:15,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:56:15,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:15,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:15,506 INFO L85 PathProgramCache]: Analyzing trace with hash -665219497, now seen corresponding path program 1 times [2025-03-04 06:56:15,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:15,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351809346] [2025-03-04 06:56:15,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:15,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:15,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 06:56:15,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 06:56:15,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:15,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:16,019 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-04 06:56:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351809346] [2025-03-04 06:56:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351809346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:16,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:16,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637661745] [2025-03-04 06:56:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:16,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:16,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:16,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:16,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:16,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 341 [2025-03-04 06:56:16,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 274 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 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-04 06:56:16,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:16,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 341 [2025-03-04 06:56:16,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:16,624 INFO L124 PetriNetUnfolderBase]: 231/1287 cut-off events. [2025-03-04 06:56:16,624 INFO L125 PetriNetUnfolderBase]: For 159/166 co-relation queries the response was YES. [2025-03-04 06:56:16,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 1287 events. 231/1287 cut-off events. For 159/166 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7356 event pairs, 74 based on Foata normal form. 0/1197 useless extension candidates. Maximal degree in co-relation 1900. Up to 282 conditions per place. [2025-03-04 06:56:16,629 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 47 selfloop transitions, 10 changer transitions 0/299 dead transitions. [2025-03-04 06:56:16,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 299 transitions, 824 flow [2025-03-04 06:56:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2025-03-04 06:56:16,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8665689149560117 [2025-03-04 06:56:16,633 INFO L175 Difference]: Start difference. First operand has 292 places, 274 transitions, 644 flow. Second operand 6 states and 1773 transitions. [2025-03-04 06:56:16,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 299 transitions, 824 flow [2025-03-04 06:56:16,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 299 transitions, 768 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-04 06:56:16,637 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 668 flow [2025-03-04 06:56:16,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2025-03-04 06:56:16,639 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2025-03-04 06:56:16,639 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 668 flow [2025-03-04 06:56:16,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 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-04 06:56:16,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:16,640 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] [2025-03-04 06:56:16,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:56:16,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:16,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash -618590951, now seen corresponding path program 1 times [2025-03-04 06:56:16,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:16,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279771767] [2025-03-04 06:56:16,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:16,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:16,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 06:56:16,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 06:56:16,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:16,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:16,723 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-04 06:56:16,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:16,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279771767] [2025-03-04 06:56:16,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279771767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:16,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:16,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:16,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113447793] [2025-03-04 06:56:16,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:16,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:16,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:16,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:16,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:16,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-04 06:56:16,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 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-04 06:56:16,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:16,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-04 06:56:16,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:16,928 INFO L124 PetriNetUnfolderBase]: 283/1423 cut-off events. [2025-03-04 06:56:16,928 INFO L125 PetriNetUnfolderBase]: For 823/835 co-relation queries the response was YES. [2025-03-04 06:56:16,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2408 conditions, 1423 events. 283/1423 cut-off events. For 823/835 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8226 event pairs, 84 based on Foata normal form. 0/1307 useless extension candidates. Maximal degree in co-relation 2370. Up to 293 conditions per place. [2025-03-04 06:56:16,940 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 22 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-03-04 06:56:16,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 288 transitions, 738 flow [2025-03-04 06:56:16,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-03-04 06:56:16,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042033235581622 [2025-03-04 06:56:16,942 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 668 flow. Second operand 3 states and 925 transitions. [2025-03-04 06:56:16,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 288 transitions, 738 flow [2025-03-04 06:56:16,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 288 transitions, 728 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:16,947 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 662 flow [2025-03-04 06:56:16,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2025-03-04 06:56:16,949 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-03-04 06:56:16,949 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 662 flow [2025-03-04 06:56:16,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 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-04 06:56:16,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:16,950 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] [2025-03-04 06:56:16,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:56:16,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1727169092, now seen corresponding path program 1 times [2025-03-04 06:56:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:16,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894549996] [2025-03-04 06:56:16,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:16,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 06:56:16,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 06:56:16,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:16,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:17,016 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-04 06:56:17,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:17,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894549996] [2025-03-04 06:56:17,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894549996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:17,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:17,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:17,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132807941] [2025-03-04 06:56:17,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:17,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:17,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:17,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:17,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 341 [2025-03-04 06:56:17,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-04 06:56:17,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:17,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 341 [2025-03-04 06:56:17,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:17,192 INFO L124 PetriNetUnfolderBase]: 194/1198 cut-off events. [2025-03-04 06:56:17,193 INFO L125 PetriNetUnfolderBase]: For 421/431 co-relation queries the response was YES. [2025-03-04 06:56:17,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 1198 events. 194/1198 cut-off events. For 421/431 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6443 event pairs, 4 based on Foata normal form. 0/1127 useless extension candidates. Maximal degree in co-relation 1871. Up to 220 conditions per place. [2025-03-04 06:56:17,200 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 21 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2025-03-04 06:56:17,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 293 transitions, 764 flow [2025-03-04 06:56:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2025-03-04 06:56:17,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139784946236559 [2025-03-04 06:56:17,202 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 662 flow. Second operand 3 states and 935 transitions. [2025-03-04 06:56:17,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 293 transitions, 764 flow [2025-03-04 06:56:17,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:17,206 INFO L231 Difference]: Finished difference. Result has 283 places, 287 transitions, 721 flow [2025-03-04 06:56:17,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=283, PETRI_TRANSITIONS=287} [2025-03-04 06:56:17,207 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-03-04 06:56:17,207 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 287 transitions, 721 flow [2025-03-04 06:56:17,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-04 06:56:17,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:17,208 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] [2025-03-04 06:56:17,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:56:17,208 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:17,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1273136677, now seen corresponding path program 1 times [2025-03-04 06:56:17,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:17,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637771758] [2025-03-04 06:56:17,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:17,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 06:56:17,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:56:17,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:18,621 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-04 06:56:18,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637771758] [2025-03-04 06:56:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637771758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-04 06:56:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048245340] [2025-03-04 06:56:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:18,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 06:56:18,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:18,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 06:56:18,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-03-04 06:56:21,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 341 [2025-03-04 06:56:21,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 287 transitions, 721 flow. Second operand has 22 states, 22 states have (on average 254.45454545454547) internal successors, (5598), 22 states have internal predecessors, (5598), 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-04 06:56:21,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:21,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 341 [2025-03-04 06:56:21,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:23,234 INFO L124 PetriNetUnfolderBase]: 1226/4757 cut-off events. [2025-03-04 06:56:23,235 INFO L125 PetriNetUnfolderBase]: For 2170/2283 co-relation queries the response was YES. [2025-03-04 06:56:23,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8406 conditions, 4757 events. 1226/4757 cut-off events. For 2170/2283 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 39890 event pairs, 307 based on Foata normal form. 62/4432 useless extension candidates. Maximal degree in co-relation 8363. Up to 689 conditions per place. [2025-03-04 06:56:23,267 INFO L140 encePairwiseOnDemand]: 306/341 looper letters, 105 selfloop transitions, 53 changer transitions 4/369 dead transitions. [2025-03-04 06:56:23,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 369 transitions, 1430 flow [2025-03-04 06:56:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 06:56:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 06:56:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8436 transitions. [2025-03-04 06:56:23,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7496667555318581 [2025-03-04 06:56:23,280 INFO L175 Difference]: Start difference. First operand has 283 places, 287 transitions, 721 flow. Second operand 33 states and 8436 transitions. [2025-03-04 06:56:23,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 369 transitions, 1430 flow [2025-03-04 06:56:23,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 369 transitions, 1430 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:23,287 INFO L231 Difference]: Finished difference. Result has 320 places, 308 transitions, 1023 flow [2025-03-04 06:56:23,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1023, PETRI_PLACES=320, PETRI_TRANSITIONS=308} [2025-03-04 06:56:23,289 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 5 predicate places. [2025-03-04 06:56:23,289 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 308 transitions, 1023 flow [2025-03-04 06:56:23,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 254.45454545454547) internal successors, (5598), 22 states have internal predecessors, (5598), 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-04 06:56:23,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:23,291 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] [2025-03-04 06:56:23,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:56:23,291 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1923154053, now seen corresponding path program 2 times [2025-03-04 06:56:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248503039] [2025-03-04 06:56:23,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:56:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:23,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 06:56:23,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 160 of 202 statements. [2025-03-04 06:56:23,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:56:23,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:24,246 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-04 06:56:24,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:24,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248503039] [2025-03-04 06:56:24,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248503039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:24,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:24,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 06:56:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971322183] [2025-03-04 06:56:24,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:24,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 06:56:24,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:24,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 06:56:24,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-04 06:56:25,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 341 [2025-03-04 06:56:25,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 308 transitions, 1023 flow. Second operand has 20 states, 20 states have (on average 256.6) internal successors, (5132), 20 states have internal predecessors, (5132), 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-04 06:56:25,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:25,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 341 [2025-03-04 06:56:25,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:27,805 INFO L124 PetriNetUnfolderBase]: 1245/5462 cut-off events. [2025-03-04 06:56:27,805 INFO L125 PetriNetUnfolderBase]: For 5364/5513 co-relation queries the response was YES. [2025-03-04 06:56:27,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10977 conditions, 5462 events. 1245/5462 cut-off events. For 5364/5513 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 48866 event pairs, 223 based on Foata normal form. 93/5142 useless extension candidates. Maximal degree in co-relation 10928. Up to 851 conditions per place. [2025-03-04 06:56:27,853 INFO L140 encePairwiseOnDemand]: 306/341 looper letters, 84 selfloop transitions, 74 changer transitions 0/369 dead transitions. [2025-03-04 06:56:27,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 369 transitions, 1707 flow [2025-03-04 06:56:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 06:56:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 06:56:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8488 transitions. [2025-03-04 06:56:27,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542877454900915 [2025-03-04 06:56:27,869 INFO L175 Difference]: Start difference. First operand has 320 places, 308 transitions, 1023 flow. Second operand 33 states and 8488 transitions. [2025-03-04 06:56:27,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 369 transitions, 1707 flow [2025-03-04 06:56:27,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 369 transitions, 1656 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-04 06:56:27,884 INFO L231 Difference]: Finished difference. Result has 327 places, 336 transitions, 1421 flow [2025-03-04 06:56:27,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1421, PETRI_PLACES=327, PETRI_TRANSITIONS=336} [2025-03-04 06:56:27,886 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 12 predicate places. [2025-03-04 06:56:27,886 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 336 transitions, 1421 flow [2025-03-04 06:56:27,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 256.6) internal successors, (5132), 20 states have internal predecessors, (5132), 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-04 06:56:27,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:27,890 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] [2025-03-04 06:56:27,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:56:27,890 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:27,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:27,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1399264513, now seen corresponding path program 1 times [2025-03-04 06:56:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332515624] [2025-03-04 06:56:27,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:27,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-04 06:56:27,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-04 06:56:27,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:27,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:28,323 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-04 06:56:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332515624] [2025-03-04 06:56:28,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332515624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:28,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:28,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699487264] [2025-03-04 06:56:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:28,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:28,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:28,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:28,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:28,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 341 [2025-03-04 06:56:28,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 336 transitions, 1421 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 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-04 06:56:28,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:28,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 341 [2025-03-04 06:56:28,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:29,340 INFO L124 PetriNetUnfolderBase]: 1531/6031 cut-off events. [2025-03-04 06:56:29,340 INFO L125 PetriNetUnfolderBase]: For 10376/10511 co-relation queries the response was YES. [2025-03-04 06:56:29,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13857 conditions, 6031 events. 1531/6031 cut-off events. For 10376/10511 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 54133 event pairs, 353 based on Foata normal form. 87/5740 useless extension candidates. Maximal degree in co-relation 13806. Up to 1206 conditions per place. [2025-03-04 06:56:29,384 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 74 selfloop transitions, 23 changer transitions 0/369 dead transitions. [2025-03-04 06:56:29,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 369 transitions, 1783 flow [2025-03-04 06:56:29,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1771 transitions. [2025-03-04 06:56:29,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655913978494624 [2025-03-04 06:56:29,386 INFO L175 Difference]: Start difference. First operand has 327 places, 336 transitions, 1421 flow. Second operand 6 states and 1771 transitions. [2025-03-04 06:56:29,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 369 transitions, 1783 flow [2025-03-04 06:56:29,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 369 transitions, 1700 flow, removed 16 selfloop flow, removed 26 redundant places. [2025-03-04 06:56:29,408 INFO L231 Difference]: Finished difference. Result has 311 places, 353 transitions, 1582 flow [2025-03-04 06:56:29,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1582, PETRI_PLACES=311, PETRI_TRANSITIONS=353} [2025-03-04 06:56:29,409 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -4 predicate places. [2025-03-04 06:56:29,409 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 353 transitions, 1582 flow [2025-03-04 06:56:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 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-04 06:56:29,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:29,410 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:56:29,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:56:29,410 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:29,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash -598934692, now seen corresponding path program 1 times [2025-03-04 06:56:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:29,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202162571] [2025-03-04 06:56:29,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:29,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 06:56:29,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 06:56:29,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:29,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 06:56:29,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202162571] [2025-03-04 06:56:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202162571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:56:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894466976] [2025-03-04 06:56:29,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:29,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:56:29,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:29,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:56:29,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:56:29,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 06:56:29,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 06:56:29,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:29,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:29,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 06:56:29,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:56:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 06:56:30,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:56:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 06:56:30,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894466976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:56:30,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:56:30,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-04 06:56:30,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790346495] [2025-03-04 06:56:30,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:56:30,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 06:56:30,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:30,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 06:56:30,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-04 06:56:31,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 341 [2025-03-04 06:56:31,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 353 transitions, 1582 flow. Second operand has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 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-04 06:56:31,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:31,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 341 [2025-03-04 06:56:31,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:33,102 INFO L124 PetriNetUnfolderBase]: 2977/10478 cut-off events. [2025-03-04 06:56:33,102 INFO L125 PetriNetUnfolderBase]: For 22181/23553 co-relation queries the response was YES. [2025-03-04 06:56:33,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25992 conditions, 10478 events. 2977/10478 cut-off events. For 22181/23553 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 101536 event pairs, 1131 based on Foata normal form. 472/10361 useless extension candidates. Maximal degree in co-relation 25936. Up to 2706 conditions per place. [2025-03-04 06:56:33,196 INFO L140 encePairwiseOnDemand]: 299/341 looper letters, 137 selfloop transitions, 95 changer transitions 0/488 dead transitions. [2025-03-04 06:56:33,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 488 transitions, 2696 flow [2025-03-04 06:56:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 06:56:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 06:56:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6226 transitions. [2025-03-04 06:56:33,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7938288920056101 [2025-03-04 06:56:33,201 INFO L175 Difference]: Start difference. First operand has 311 places, 353 transitions, 1582 flow. Second operand 23 states and 6226 transitions. [2025-03-04 06:56:33,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 488 transitions, 2696 flow [2025-03-04 06:56:33,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 488 transitions, 2664 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:33,246 INFO L231 Difference]: Finished difference. Result has 346 places, 417 transitions, 2199 flow [2025-03-04 06:56:33,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2199, PETRI_PLACES=346, PETRI_TRANSITIONS=417} [2025-03-04 06:56:33,247 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 31 predicate places. [2025-03-04 06:56:33,248 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 417 transitions, 2199 flow [2025-03-04 06:56:33,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 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-04 06:56:33,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:33,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:33,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:56:33,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 06:56:33,451 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:33,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1852097855, now seen corresponding path program 1 times [2025-03-04 06:56:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:33,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624511870] [2025-03-04 06:56:33,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:33,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-04 06:56:33,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 06:56:33,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:33,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:56:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:33,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624511870] [2025-03-04 06:56:33,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624511870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:33,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:33,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:33,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794836413] [2025-03-04 06:56:33,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:33,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:33,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:33,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:33,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-04 06:56:33,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 417 transitions, 2199 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 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-04 06:56:33,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:33,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-04 06:56:33,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:35,445 INFO L124 PetriNetUnfolderBase]: 2446/10380 cut-off events. [2025-03-04 06:56:35,445 INFO L125 PetriNetUnfolderBase]: For 20333/20698 co-relation queries the response was YES. [2025-03-04 06:56:35,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26107 conditions, 10380 events. 2446/10380 cut-off events. For 20333/20698 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 102744 event pairs, 841 based on Foata normal form. 59/9983 useless extension candidates. Maximal degree in co-relation 26036. Up to 2061 conditions per place. [2025-03-04 06:56:35,518 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 42 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-03-04 06:56:35,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 423 transitions, 2323 flow [2025-03-04 06:56:35,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-03-04 06:56:35,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022482893450635 [2025-03-04 06:56:35,523 INFO L175 Difference]: Start difference. First operand has 346 places, 417 transitions, 2199 flow. Second operand 3 states and 923 transitions. [2025-03-04 06:56:35,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 423 transitions, 2323 flow [2025-03-04 06:56:35,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 423 transitions, 2291 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:35,574 INFO L231 Difference]: Finished difference. Result has 346 places, 416 transitions, 2169 flow [2025-03-04 06:56:35,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2169, PETRI_PLACES=346, PETRI_TRANSITIONS=416} [2025-03-04 06:56:35,575 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 31 predicate places. [2025-03-04 06:56:35,575 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 416 transitions, 2169 flow [2025-03-04 06:56:35,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 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-04 06:56:35,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:35,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:35,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:56:35,577 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:35,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash -359876861, now seen corresponding path program 1 times [2025-03-04 06:56:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116809688] [2025-03-04 06:56:35,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:35,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-04 06:56:35,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 06:56:35,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:35,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:56:36,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:36,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116809688] [2025-03-04 06:56:36,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116809688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:56:36,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100101057] [2025-03-04 06:56:36,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:36,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:56:36,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:36,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:56:36,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:56:36,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-04 06:56:36,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 06:56:36,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:36,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:36,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 06:56:36,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:56:36,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:56:36,483 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:56:36,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 06:56:36,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2025-03-04 06:56:36,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2025-03-04 06:56:36,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2025-03-04 06:56:36,721 INFO L349 Elim1Store]: treesize reduction 458, result has 0.2 percent of original size [2025-03-04 06:56:36,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 43 [2025-03-04 06:56:36,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-04 06:56:36,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2025-03-04 06:56:36,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 45 [2025-03-04 06:56:36,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2025-03-04 06:56:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:56:36,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:56:36,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:56:36,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-04 06:56:36,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:56:36,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-04 06:56:36,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2025-03-04 06:56:36,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:56:36,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2025-03-04 06:56:36,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-04 06:56:36,853 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:56:36,858 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-04 06:56:36,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-04 06:56:36,860 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:56:36,864 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-04 06:56:36,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-04 06:56:36,867 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:56:36,870 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-04 06:56:36,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-04 06:56:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:56:37,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100101057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:56:37,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:56:37,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-04 06:56:37,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988693768] [2025-03-04 06:56:37,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:56:37,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 06:56:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:37,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 06:56:37,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-04 06:56:38,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 341 [2025-03-04 06:56:38,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 416 transitions, 2169 flow. Second operand has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 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-04 06:56:38,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:38,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 341 [2025-03-04 06:56:38,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:39,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L51-5-->L51-6: Formula: (let ((.cse0 (select |v_#race_1| v_~B~0.base_1)) (.cse1 (* v_thread1Thread1of1ForFork0_~i~0_33 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_1 1)) 0) (= (select .cse0 (+ 2 .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ 3 .cse1 v_~B~0.offset_1)) 0))) InVars {#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} OutVars{#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} AuxVars[] AssignedVars[][355], [408#(= |#race~B~0| 0), Black: 570#true, Black: 375#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 572#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), 1898#true, Black: 574#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 397#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 573#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 209#L78-2true, Black: 395#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 396#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 394#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), 588#(<= ~N~0 1), Black: 392#true, 483#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 244#L96-1true, Black: 406#true, 82#L65true, Black: 1856#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1884#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 1854#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1882#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 1862#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1)), Black: 1872#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), 575#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1860#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 1866#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 589#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 477#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 475#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1876#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 1864#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1)), Black: 479#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1164#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 481#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 151#L51-6true, Black: 361#true, 363#(= |#race~A~0| 0), 3262#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| ~B~0.base)) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset)) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (= (select (select |#race| ~B~0.base) ~B~0.offset) 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 1)) 0) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 560#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 556#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 558#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 554#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 562#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 342#(= |#race~N~0| 0)]) [2025-03-04 06:56:39,687 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is not cut-off event [2025-03-04 06:56:39,687 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-03-04 06:56:39,687 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-03-04 06:56:39,687 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is not cut-off event [2025-03-04 06:56:40,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L51-5-->L51-6: Formula: (let ((.cse0 (select |v_#race_1| v_~B~0.base_1)) (.cse1 (* v_thread1Thread1of1ForFork0_~i~0_33 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_1 1)) 0) (= (select .cse0 (+ 2 .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ 3 .cse1 v_~B~0.offset_1)) 0))) InVars {#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} OutVars{#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} AuxVars[] AssignedVars[][355], [Black: 570#true, 408#(= |#race~B~0| 0), Black: 375#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 572#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), 1898#true, Black: 574#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 397#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 573#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 209#L78-2true, Black: 395#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 396#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 394#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), Black: 392#true, 483#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 244#L96-1true, Black: 406#true, 82#L65true, Black: 1856#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1884#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 1854#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1882#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 1862#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1)), Black: 1872#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 588#(<= ~N~0 1), Black: 1860#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), 575#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1866#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 589#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 477#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 475#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1876#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 1864#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1)), Black: 479#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1164#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 481#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 151#L51-6true, Black: 361#true, 363#(= |#race~A~0| 0), 3262#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| ~B~0.base)) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset)) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (= (select (select |#race| ~B~0.base) ~B~0.offset) 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 1)) 0) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 560#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 556#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 558#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 581#true, Black: 554#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 562#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 342#(= |#race~N~0| 0)]) [2025-03-04 06:56:40,588 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is not cut-off event [2025-03-04 06:56:40,588 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is not cut-off event [2025-03-04 06:56:40,588 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is not cut-off event [2025-03-04 06:56:40,588 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is not cut-off event [2025-03-04 06:56:41,249 INFO L124 PetriNetUnfolderBase]: 3396/12612 cut-off events. [2025-03-04 06:56:41,249 INFO L125 PetriNetUnfolderBase]: For 30585/31643 co-relation queries the response was YES. [2025-03-04 06:56:41,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31889 conditions, 12612 events. 3396/12612 cut-off events. For 30585/31643 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 124873 event pairs, 655 based on Foata normal form. 462/12279 useless extension candidates. Maximal degree in co-relation 31814. Up to 1634 conditions per place. [2025-03-04 06:56:41,364 INFO L140 encePairwiseOnDemand]: 309/341 looper letters, 151 selfloop transitions, 83 changer transitions 0/507 dead transitions. [2025-03-04 06:56:41,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 507 transitions, 3307 flow [2025-03-04 06:56:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 06:56:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 06:56:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6554 transitions. [2025-03-04 06:56:41,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7687976539589443 [2025-03-04 06:56:41,369 INFO L175 Difference]: Start difference. First operand has 346 places, 416 transitions, 2169 flow. Second operand 25 states and 6554 transitions. [2025-03-04 06:56:41,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 507 transitions, 3307 flow [2025-03-04 06:56:41,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 507 transitions, 3303 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:41,433 INFO L231 Difference]: Finished difference. Result has 373 places, 432 transitions, 2600 flow [2025-03-04 06:56:41,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2600, PETRI_PLACES=373, PETRI_TRANSITIONS=432} [2025-03-04 06:56:41,433 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 58 predicate places. [2025-03-04 06:56:41,434 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 432 transitions, 2600 flow [2025-03-04 06:56:41,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 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-04 06:56:41,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:41,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:41,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:56:41,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-04 06:56:41,636 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:41,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:41,637 INFO L85 PathProgramCache]: Analyzing trace with hash -657447165, now seen corresponding path program 2 times [2025-03-04 06:56:41,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:41,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936476556] [2025-03-04 06:56:41,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:56:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:41,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-03-04 06:56:41,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 06:56:41,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:56:41,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:56:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936476556] [2025-03-04 06:56:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936476556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:56:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703617752] [2025-03-04 06:56:42,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:56:42,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:56:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:42,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:56:42,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:56:42,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-03-04 06:56:42,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 06:56:42,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:56:42,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:42,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:56:42,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:56:42,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:56:43,102 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:56:43,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 06:56:43,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2025-03-04 06:56:43,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 89 [2025-03-04 06:56:43,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2025-03-04 06:56:43,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 45 [2025-03-04 06:56:43,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2025-03-04 06:56:43,476 INFO L349 Elim1Store]: treesize reduction 458, result has 0.2 percent of original size [2025-03-04 06:56:43,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 43 [2025-03-04 06:56:43,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-04 06:56:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:56:43,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:56:43,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:56:43,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-04 06:56:43,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-04 06:56:43,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:56:43,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-04 06:56:43,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:56:43,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2025-03-04 06:56:43,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-04 06:56:43,630 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:56:43,636 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-04 06:56:43,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-04 06:56:43,638 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:56:43,643 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-04 06:56:43,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-04 06:56:43,645 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:56:43,650 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-04 06:56:43,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-04 06:56:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:56:43,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703617752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:56:43,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:56:43,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 38 [2025-03-04 06:56:43,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254527224] [2025-03-04 06:56:43,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:56:43,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 06:56:43,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:43,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 06:56:43,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 06:56:47,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 341 [2025-03-04 06:56:47,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 432 transitions, 2600 flow. Second operand has 39 states, 39 states have (on average 207.92307692307693) internal successors, (8109), 39 states have internal predecessors, (8109), 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-04 06:56:47,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:47,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 341 [2025-03-04 06:56:47,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:51,539 INFO L124 PetriNetUnfolderBase]: 3772/14991 cut-off events. [2025-03-04 06:56:51,540 INFO L125 PetriNetUnfolderBase]: For 52837/54245 co-relation queries the response was YES. [2025-03-04 06:56:51,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42617 conditions, 14991 events. 3772/14991 cut-off events. For 52837/54245 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 155822 event pairs, 929 based on Foata normal form. 717/15486 useless extension candidates. Maximal degree in co-relation 42535. Up to 2639 conditions per place. [2025-03-04 06:56:51,740 INFO L140 encePairwiseOnDemand]: 288/341 looper letters, 153 selfloop transitions, 148 changer transitions 0/524 dead transitions. [2025-03-04 06:56:51,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 524 transitions, 3929 flow [2025-03-04 06:56:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 06:56:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 06:56:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 7673 transitions. [2025-03-04 06:56:51,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081477371799953 [2025-03-04 06:56:51,746 INFO L175 Difference]: Start difference. First operand has 373 places, 432 transitions, 2600 flow. Second operand 37 states and 7673 transitions. [2025-03-04 06:56:51,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 524 transitions, 3929 flow [2025-03-04 06:56:51,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 524 transitions, 3866 flow, removed 1 selfloop flow, removed 19 redundant places. [2025-03-04 06:56:51,892 INFO L231 Difference]: Finished difference. Result has 394 places, 458 transitions, 3264 flow [2025-03-04 06:56:51,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=3264, PETRI_PLACES=394, PETRI_TRANSITIONS=458} [2025-03-04 06:56:51,892 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 79 predicate places. [2025-03-04 06:56:51,892 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 458 transitions, 3264 flow [2025-03-04 06:56:51,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 207.92307692307693) internal successors, (8109), 39 states have internal predecessors, (8109), 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-04 06:56:51,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:51,895 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:56:51,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:56:52,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:56:52,099 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:52,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:52,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1000187421, now seen corresponding path program 1 times [2025-03-04 06:56:52,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:52,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055771069] [2025-03-04 06:56:52,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:52,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:52,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 06:56:52,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 06:56:52,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:52,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 06:56:52,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:52,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055771069] [2025-03-04 06:56:52,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055771069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:56:52,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314252227] [2025-03-04 06:56:52,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:52,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:56:52,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:52,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:56:52,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:56:52,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 06:56:52,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 06:56:52,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:52,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:52,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 06:56:52,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:56:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 06:56:52,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:56:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 06:56:53,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314252227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:56:53,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:56:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-04 06:56:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463832314] [2025-03-04 06:56:53,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:56:53,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 06:56:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:53,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 06:56:53,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-04 06:56:54,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 341 [2025-03-04 06:56:54,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 458 transitions, 3264 flow. Second operand has 24 states, 24 states have (on average 267.0) internal successors, (6408), 24 states have internal predecessors, (6408), 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-04 06:56:54,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:54,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 341 [2025-03-04 06:56:54,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:56,682 INFO L124 PetriNetUnfolderBase]: 2298/10935 cut-off events. [2025-03-04 06:56:56,682 INFO L125 PetriNetUnfolderBase]: For 43754/43915 co-relation queries the response was YES. [2025-03-04 06:56:56,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32232 conditions, 10935 events. 2298/10935 cut-off events. For 43754/43915 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 107545 event pairs, 621 based on Foata normal form. 87/10682 useless extension candidates. Maximal degree in co-relation 32149. Up to 1662 conditions per place. [2025-03-04 06:56:56,817 INFO L140 encePairwiseOnDemand]: 299/341 looper letters, 97 selfloop transitions, 44 changer transitions 156/567 dead transitions. [2025-03-04 06:56:56,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 567 transitions, 4864 flow [2025-03-04 06:56:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 06:56:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 06:56:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6238 transitions. [2025-03-04 06:56:56,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953589187810787 [2025-03-04 06:56:56,821 INFO L175 Difference]: Start difference. First operand has 394 places, 458 transitions, 3264 flow. Second operand 23 states and 6238 transitions. [2025-03-04 06:56:56,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 567 transitions, 4864 flow [2025-03-04 06:56:57,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 567 transitions, 4713 flow, removed 22 selfloop flow, removed 29 redundant places. [2025-03-04 06:56:57,100 INFO L231 Difference]: Finished difference. Result has 392 places, 398 transitions, 2651 flow [2025-03-04 06:56:57,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3040, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2651, PETRI_PLACES=392, PETRI_TRANSITIONS=398} [2025-03-04 06:56:57,101 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 77 predicate places. [2025-03-04 06:56:57,101 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 398 transitions, 2651 flow [2025-03-04 06:56:57,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.0) internal successors, (6408), 24 states have internal predecessors, (6408), 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-04 06:56:57,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:57,102 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:57,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:56:57,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:56:57,303 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:56:57,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1943138373, now seen corresponding path program 2 times [2025-03-04 06:56:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989393270] [2025-03-04 06:56:57,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:56:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:57,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-03-04 06:56:57,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 06:56:57,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:56:57,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 06:56:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:59,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989393270] [2025-03-04 06:56:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989393270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:56:59,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763573203] [2025-03-04 06:56:59,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:56:59,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:56:59,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:59,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:56:59,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 06:56:59,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-03-04 06:56:59,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 06:56:59,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:56:59,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:59,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-04 06:56:59,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:56:59,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:56:59,748 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:56:59,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 06:57:00,056 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:57:00,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 06:57:00,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:57:00,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 06:57:00,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 06:57:00,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-04 06:57:00,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:57:00,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:57:00,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:57:00,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:57:00,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 91 [2025-03-04 06:57:00,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 60 [2025-03-04 06:57:00,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:57:00,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:57:00,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:57:00,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:57:00,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 96 [2025-03-04 06:57:00,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2025-03-04 06:57:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 06:57:04,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:57:04,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0)))) (.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4))) (and (forall ((v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1244 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1244) c_~C~0.base v_ArrVal_1245) c_~A~0.base) (+ c_~A~0.offset 2 .cse1)) 0)) (forall ((v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1244 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1244) c_~C~0.base v_ArrVal_1245) c_~A~0.base) (+ c_~A~0.offset 3 .cse1)) 0)) (forall ((v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1244 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1244) c_~C~0.base v_ArrVal_1245) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)) (forall ((v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1244 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1244) c_~C~0.base v_ArrVal_1245) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)))) is different from false [2025-03-04 06:57:05,606 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2025-03-04 06:57:05,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 121 [2025-03-04 06:57:05,614 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-03-04 06:57:05,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 256 treesize of output 168 [2025-03-04 06:57:05,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-04 06:57:05,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2025-03-04 06:57:05,635 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2025-03-04 06:57:05,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2025-03-04 06:57:05,647 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2025-03-04 06:57:05,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 1 [2025-03-04 06:57:05,657 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2025-03-04 06:57:05,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2025-03-04 06:57:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 06:57:07,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763573203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:57:07,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:57:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 21] total 75 [2025-03-04 06:57:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727522587] [2025-03-04 06:57:07,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:57:07,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-04 06:57:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:07,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-04 06:57:07,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=5116, Unknown=104, NotChecked=146, Total=5700 [2025-03-04 06:57:08,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2025-03-04 06:57:08,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 398 transitions, 2651 flow. Second operand has 76 states, 76 states have (on average 159.51315789473685) internal successors, (12123), 76 states have internal predecessors, (12123), 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-04 06:57:08,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:08,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2025-03-04 06:57:08,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:25,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:57:33,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]