./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:38,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:38,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:38:38,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:38,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:38,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:38,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:38,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:38,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:38,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:38,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:38,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:38,581 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:38,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:38,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:38,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:38,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:38,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:38,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:38,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:38,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:38,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:38,583 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:38,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:38,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:38,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:38,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:38,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:38,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:38,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:38,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:38,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:38,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:38,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:38,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:38,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:38,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:38,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:38,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:38,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:38,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:38,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:38,585 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-jdk21/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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2025-02-08 05:38:38,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:38,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:38,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:38,893 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:38,893 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:38,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-02-08 05:38:39,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bb0fb587/8d608e8017c44229bdec7ca266642807/FLAGb47af563d [2025-02-08 05:38:39,902 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:39,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-02-08 05:38:39,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bb0fb587/8d608e8017c44229bdec7ca266642807/FLAGb47af563d [2025-02-08 05:38:41,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bb0fb587/8d608e8017c44229bdec7ca266642807 [2025-02-08 05:38:41,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:41,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:41,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:41,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:41,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:41,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:41" (1/1) ... [2025-02-08 05:38:41,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dd49e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:41, skipping insertion in model container [2025-02-08 05:38:41,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:41" (1/1) ... [2025-02-08 05:38:41,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:42,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:42,144 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:42,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:42,222 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:42,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42 WrapperNode [2025-02-08 05:38:42,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:42,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:42,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:42,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:42,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,279 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 239 [2025-02-08 05:38:42,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:42,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:42,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:42,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:42,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:42,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:42,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:42,339 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:42,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:42,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:42,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:38:42,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:38:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:42,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:42,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:38:42,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:38:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:38:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:38:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:38:42,409 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:38:42,507 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:42,509 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:43,359 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:43,359 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:43,418 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:43,419 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:43,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:43 BoogieIcfgContainer [2025-02-08 05:38:43,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:43,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:43,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:43,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:43,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:38:41" (1/3) ... [2025-02-08 05:38:43,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335355b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:43, skipping insertion in model container [2025-02-08 05:38:43,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (2/3) ... [2025-02-08 05:38:43,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335355b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:43, skipping insertion in model container [2025-02-08 05:38:43,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:43" (3/3) ... [2025-02-08 05:38:43,431 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2025-02-08 05:38:43,444 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:43,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-subst.wvr.c that has 4 procedures, 623 locations, 1 initial locations, 6 loop locations, and 77 error locations. [2025-02-08 05:38:43,448 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:43,637 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:38:43,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 632 places, 652 transitions, 1325 flow [2025-02-08 05:38:43,916 INFO L124 PetriNetUnfolderBase]: 30/649 cut-off events. [2025-02-08 05:38:43,918 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:43,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 649 events. 30/649 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1775 event pairs, 0 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 490. Up to 3 conditions per place. [2025-02-08 05:38:43,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 632 places, 652 transitions, 1325 flow [2025-02-08 05:38:43,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 611 places, 629 transitions, 1276 flow [2025-02-08 05:38:43,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:43,999 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;@28c32bc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:43,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2025-02-08 05:38:44,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:44,007 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-02-08 05:38:44,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:44,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,008 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-02-08 05:38:44,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:44,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash 692580346, now seen corresponding path program 1 times [2025-02-08 05:38:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521515916] [2025-02-08 05:38:44,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:38:44,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:38:44,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:44,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521515916] [2025-02-08 05:38:44,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521515916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078836215] [2025-02-08 05:38:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 652 [2025-02-08 05:38:44,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 629 transitions, 1276 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:44,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 652 [2025-02-08 05:38:44,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:44,741 INFO L124 PetriNetUnfolderBase]: 78/1518 cut-off events. [2025-02-08 05:38:44,742 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:38:44,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1518 events. 78/1518 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9299 event pairs, 20 based on Foata normal form. 27/1246 useless extension candidates. Maximal degree in co-relation 1200. Up to 50 conditions per place. [2025-02-08 05:38:44,773 INFO L140 encePairwiseOnDemand]: 639/652 looper letters, 13 selfloop transitions, 2 changer transitions 7/618 dead transitions. [2025-02-08 05:38:44,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 618 transitions, 1284 flow [2025-02-08 05:38:44,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1895 transitions. [2025-02-08 05:38:44,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688139059304703 [2025-02-08 05:38:44,799 INFO L175 Difference]: Start difference. First operand has 611 places, 629 transitions, 1276 flow. Second operand 3 states and 1895 transitions. [2025-02-08 05:38:44,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 618 transitions, 1284 flow [2025-02-08 05:38:44,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 618 transitions, 1272 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:38:44,822 INFO L231 Difference]: Finished difference. Result has 606 places, 611 transitions, 1232 flow [2025-02-08 05:38:44,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=606, PETRI_TRANSITIONS=611} [2025-02-08 05:38:44,830 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -5 predicate places. [2025-02-08 05:38:44,831 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 611 transitions, 1232 flow [2025-02-08 05:38:44,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:44,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,833 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] [2025-02-08 05:38:44,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:44,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1723939635, now seen corresponding path program 1 times [2025-02-08 05:38:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908821689] [2025-02-08 05:38:44,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:38:44,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:38:44,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:44,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908821689] [2025-02-08 05:38:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908821689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799801424] [2025-02-08 05:38:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 652 [2025-02-08 05:38:44,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 611 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:44,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 652 [2025-02-08 05:38:44,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,170 INFO L124 PetriNetUnfolderBase]: 50/1054 cut-off events. [2025-02-08 05:38:45,171 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:45,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1054 events. 50/1054 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5253 event pairs, 12 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1068. Up to 38 conditions per place. [2025-02-08 05:38:45,198 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/610 dead transitions. [2025-02-08 05:38:45,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 610 transitions, 1260 flow [2025-02-08 05:38:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2025-02-08 05:38:45,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637014314928425 [2025-02-08 05:38:45,208 INFO L175 Difference]: Start difference. First operand has 606 places, 611 transitions, 1232 flow. Second operand 3 states and 1885 transitions. [2025-02-08 05:38:45,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 610 transitions, 1260 flow [2025-02-08 05:38:45,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 610 transitions, 1256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,218 INFO L231 Difference]: Finished difference. Result has 598 places, 610 transitions, 1230 flow [2025-02-08 05:38:45,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=598, PETRI_TRANSITIONS=610} [2025-02-08 05:38:45,219 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -13 predicate places. [2025-02-08 05:38:45,219 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 610 transitions, 1230 flow [2025-02-08 05:38:45,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:45,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,221 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] [2025-02-08 05:38:45,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:45,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:45,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1196222869, now seen corresponding path program 1 times [2025-02-08 05:38:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890112910] [2025-02-08 05:38:45,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:38:45,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:38:45,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890112910] [2025-02-08 05:38:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890112910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934655030] [2025-02-08 05:38:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 652 [2025-02-08 05:38:45,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 610 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:45,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 652 [2025-02-08 05:38:45,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,750 INFO L124 PetriNetUnfolderBase]: 78/1485 cut-off events. [2025-02-08 05:38:45,750 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-02-08 05:38:45,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 1485 events. 78/1485 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8445 event pairs, 20 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 1501. Up to 50 conditions per place. [2025-02-08 05:38:45,781 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2025-02-08 05:38:45,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 609 transitions, 1258 flow [2025-02-08 05:38:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2025-02-08 05:38:45,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637014314928425 [2025-02-08 05:38:45,788 INFO L175 Difference]: Start difference. First operand has 598 places, 610 transitions, 1230 flow. Second operand 3 states and 1885 transitions. [2025-02-08 05:38:45,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 609 transitions, 1258 flow [2025-02-08 05:38:45,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,799 INFO L231 Difference]: Finished difference. Result has 597 places, 609 transitions, 1228 flow [2025-02-08 05:38:45,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=597, PETRI_TRANSITIONS=609} [2025-02-08 05:38:45,802 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2025-02-08 05:38:45,802 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 609 transitions, 1228 flow [2025-02-08 05:38:45,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:45,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,803 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] [2025-02-08 05:38:45,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:45,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:45,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1954389620, now seen corresponding path program 1 times [2025-02-08 05:38:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927396079] [2025-02-08 05:38:45,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:38:45,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:38:45,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:45,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927396079] [2025-02-08 05:38:45,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927396079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173549902] [2025-02-08 05:38:45,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 652 [2025-02-08 05:38:45,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 609 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-02-08 05:38:45,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 652 [2025-02-08 05:38:45,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,350 INFO L124 PetriNetUnfolderBase]: 88/1786 cut-off events. [2025-02-08 05:38:46,351 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:46,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 1786 events. 88/1786 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11620 event pairs, 20 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1803. Up to 51 conditions per place. [2025-02-08 05:38:46,372 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 14 selfloop transitions, 2 changer transitions 0/608 dead transitions. [2025-02-08 05:38:46,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 608 transitions, 1258 flow [2025-02-08 05:38:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2025-02-08 05:38:46,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962678936605317 [2025-02-08 05:38:46,377 INFO L175 Difference]: Start difference. First operand has 597 places, 609 transitions, 1228 flow. Second operand 3 states and 1883 transitions. [2025-02-08 05:38:46,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 608 transitions, 1258 flow [2025-02-08 05:38:46,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 608 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:46,385 INFO L231 Difference]: Finished difference. Result has 596 places, 608 transitions, 1226 flow [2025-02-08 05:38:46,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=596, PETRI_TRANSITIONS=608} [2025-02-08 05:38:46,387 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -15 predicate places. [2025-02-08 05:38:46,387 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 608 transitions, 1226 flow [2025-02-08 05:38:46,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-02-08 05:38:46,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,388 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] [2025-02-08 05:38:46,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:46,389 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:46,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1661919891, now seen corresponding path program 1 times [2025-02-08 05:38:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291904371] [2025-02-08 05:38:46,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:38:46,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:38:46,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291904371] [2025-02-08 05:38:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291904371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807148537] [2025-02-08 05:38:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 652 [2025-02-08 05:38:46,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 608 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-02-08 05:38:46,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 652 [2025-02-08 05:38:46,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,674 INFO L124 PetriNetUnfolderBase]: 50/1089 cut-off events. [2025-02-08 05:38:46,674 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:38:46,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 1089 events. 50/1089 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5528 event pairs, 12 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1080. Up to 39 conditions per place. [2025-02-08 05:38:46,693 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 14 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2025-02-08 05:38:46,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 607 transitions, 1256 flow [2025-02-08 05:38:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2025-02-08 05:38:46,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962678936605317 [2025-02-08 05:38:46,698 INFO L175 Difference]: Start difference. First operand has 596 places, 608 transitions, 1226 flow. Second operand 3 states and 1883 transitions. [2025-02-08 05:38:46,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 607 transitions, 1256 flow [2025-02-08 05:38:46,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 607 transitions, 1252 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:46,707 INFO L231 Difference]: Finished difference. Result has 595 places, 607 transitions, 1224 flow [2025-02-08 05:38:46,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=595, PETRI_TRANSITIONS=607} [2025-02-08 05:38:46,708 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -16 predicate places. [2025-02-08 05:38:46,709 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 607 transitions, 1224 flow [2025-02-08 05:38:46,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-02-08 05:38:46,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:46,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:46,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:46,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,715 INFO L85 PathProgramCache]: Analyzing trace with hash -625836147, now seen corresponding path program 1 times [2025-02-08 05:38:46,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479495170] [2025-02-08 05:38:46,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:38:46,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:38:46,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:46,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479495170] [2025-02-08 05:38:46,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479495170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112147418] [2025-02-08 05:38:46,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 652 [2025-02-08 05:38:46,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 607 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-02-08 05:38:46,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 652 [2025-02-08 05:38:46,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,019 INFO L124 PetriNetUnfolderBase]: 48/866 cut-off events. [2025-02-08 05:38:47,020 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-08 05:38:47,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 866 events. 48/866 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3729 event pairs, 20 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 859. Up to 51 conditions per place. [2025-02-08 05:38:47,033 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 14 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2025-02-08 05:38:47,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 606 transitions, 1254 flow [2025-02-08 05:38:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2025-02-08 05:38:47,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962678936605317 [2025-02-08 05:38:47,038 INFO L175 Difference]: Start difference. First operand has 595 places, 607 transitions, 1224 flow. Second operand 3 states and 1883 transitions. [2025-02-08 05:38:47,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 606 transitions, 1254 flow [2025-02-08 05:38:47,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 606 transitions, 1250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:47,048 INFO L231 Difference]: Finished difference. Result has 594 places, 606 transitions, 1222 flow [2025-02-08 05:38:47,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=594, PETRI_TRANSITIONS=606} [2025-02-08 05:38:47,050 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -17 predicate places. [2025-02-08 05:38:47,050 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 606 transitions, 1222 flow [2025-02-08 05:38:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-02-08 05:38:47,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,052 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] [2025-02-08 05:38:47,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:47,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:47,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,053 INFO L85 PathProgramCache]: Analyzing trace with hash 955014830, now seen corresponding path program 1 times [2025-02-08 05:38:47,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218349079] [2025-02-08 05:38:47,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:38:47,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:38:47,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:47,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218349079] [2025-02-08 05:38:47,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218349079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:47,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893489591] [2025-02-08 05:38:47,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:47,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:47,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:47,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 652 [2025-02-08 05:38:47,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 606 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-02-08 05:38:47,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:47,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 652 [2025-02-08 05:38:47,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,539 INFO L124 PetriNetUnfolderBase]: 165/2324 cut-off events. [2025-02-08 05:38:47,540 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-02-08 05:38:47,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 2324 events. 165/2324 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 17872 event pairs, 64 based on Foata normal form. 0/1904 useless extension candidates. Maximal degree in co-relation 2435. Up to 151 conditions per place. [2025-02-08 05:38:47,583 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 16 selfloop transitions, 1 changer transitions 0/601 dead transitions. [2025-02-08 05:38:47,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 601 transitions, 1246 flow [2025-02-08 05:38:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2025-02-08 05:38:47,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9591002044989775 [2025-02-08 05:38:47,589 INFO L175 Difference]: Start difference. First operand has 594 places, 606 transitions, 1222 flow. Second operand 3 states and 1876 transitions. [2025-02-08 05:38:47,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 601 transitions, 1246 flow [2025-02-08 05:38:47,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 601 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:47,598 INFO L231 Difference]: Finished difference. Result has 589 places, 601 transitions, 1210 flow [2025-02-08 05:38:47,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=589, PETRI_TRANSITIONS=601} [2025-02-08 05:38:47,599 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2025-02-08 05:38:47,600 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 601 transitions, 1210 flow [2025-02-08 05:38:47,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-02-08 05:38:47,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,601 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] [2025-02-08 05:38:47,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:47,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:47,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -992842928, now seen corresponding path program 1 times [2025-02-08 05:38:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668103279] [2025-02-08 05:38:47,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:38:47,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:38:47,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668103279] [2025-02-08 05:38:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668103279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45739541] [2025-02-08 05:38:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:47,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:47,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 652 [2025-02-08 05:38:47,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 601 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:47,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:47,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 652 [2025-02-08 05:38:47,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,010 INFO L124 PetriNetUnfolderBase]: 88/1774 cut-off events. [2025-02-08 05:38:48,010 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:38:48,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1774 events. 88/1774 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10615 event pairs, 20 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 1765. Up to 50 conditions per place. [2025-02-08 05:38:48,036 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2025-02-08 05:38:48,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 600 transitions, 1238 flow [2025-02-08 05:38:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2025-02-08 05:38:48,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637014314928425 [2025-02-08 05:38:48,044 INFO L175 Difference]: Start difference. First operand has 589 places, 601 transitions, 1210 flow. Second operand 3 states and 1885 transitions. [2025-02-08 05:38:48,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 600 transitions, 1238 flow [2025-02-08 05:38:48,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 600 transitions, 1237 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:48,054 INFO L231 Difference]: Finished difference. Result has 589 places, 600 transitions, 1211 flow [2025-02-08 05:38:48,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=589, PETRI_TRANSITIONS=600} [2025-02-08 05:38:48,056 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2025-02-08 05:38:48,058 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 600 transitions, 1211 flow [2025-02-08 05:38:48,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:48,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,059 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] [2025-02-08 05:38:48,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:48,059 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:48,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash -384901922, now seen corresponding path program 1 times [2025-02-08 05:38:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090275626] [2025-02-08 05:38:48,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:38:48,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:38:48,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090275626] [2025-02-08 05:38:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090275626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771757687] [2025-02-08 05:38:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:48,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:49,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 652 [2025-02-08 05:38:49,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 600 transitions, 1211 flow. Second operand has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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-02-08 05:38:49,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:49,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 652 [2025-02-08 05:38:49,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,162 INFO L124 PetriNetUnfolderBase]: 12845/49259 cut-off events. [2025-02-08 05:38:56,162 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2025-02-08 05:38:56,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66742 conditions, 49259 events. 12845/49259 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 647593 event pairs, 10080 based on Foata normal form. 0/40957 useless extension candidates. Maximal degree in co-relation 66666. Up to 17156 conditions per place. [2025-02-08 05:38:56,552 INFO L140 encePairwiseOnDemand]: 634/652 looper letters, 78 selfloop transitions, 15 changer transitions 0/597 dead transitions. [2025-02-08 05:38:56,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 597 transitions, 1391 flow [2025-02-08 05:38:56,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3360 transitions. [2025-02-08 05:38:56,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8588957055214724 [2025-02-08 05:38:56,560 INFO L175 Difference]: Start difference. First operand has 589 places, 600 transitions, 1211 flow. Second operand 6 states and 3360 transitions. [2025-02-08 05:38:56,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 597 transitions, 1391 flow [2025-02-08 05:38:56,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 597 transitions, 1387 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,568 INFO L231 Difference]: Finished difference. Result has 589 places, 597 transitions, 1231 flow [2025-02-08 05:38:56,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1231, PETRI_PLACES=589, PETRI_TRANSITIONS=597} [2025-02-08 05:38:56,571 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2025-02-08 05:38:56,571 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 597 transitions, 1231 flow [2025-02-08 05:38:56,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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-02-08 05:38:56,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,573 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] [2025-02-08 05:38:56,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:56,573 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:56,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash -165297184, now seen corresponding path program 1 times [2025-02-08 05:38:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253171258] [2025-02-08 05:38:56,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:38:56,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:38:56,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253171258] [2025-02-08 05:38:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253171258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466238049] [2025-02-08 05:38:56,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 652 [2025-02-08 05:38:56,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 597 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-02-08 05:38:56,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 652 [2025-02-08 05:38:56,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,944 INFO L124 PetriNetUnfolderBase]: 112/1698 cut-off events. [2025-02-08 05:38:56,945 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-02-08 05:38:56,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 1698 events. 112/1698 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 11042 event pairs, 32 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 1782. Up to 101 conditions per place. [2025-02-08 05:38:56,983 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 16 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2025-02-08 05:38:56,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 592 transitions, 1255 flow [2025-02-08 05:38:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2025-02-08 05:38:56,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9591002044989775 [2025-02-08 05:38:56,988 INFO L175 Difference]: Start difference. First operand has 589 places, 597 transitions, 1231 flow. Second operand 3 states and 1876 transitions. [2025-02-08 05:38:56,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 592 transitions, 1255 flow [2025-02-08 05:38:56,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 592 transitions, 1225 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:56,996 INFO L231 Difference]: Finished difference. Result has 581 places, 592 transitions, 1193 flow [2025-02-08 05:38:56,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1193, PETRI_PLACES=581, PETRI_TRANSITIONS=592} [2025-02-08 05:38:56,997 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2025-02-08 05:38:56,998 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 592 transitions, 1193 flow [2025-02-08 05:38:56,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-02-08 05:38:56,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,999 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] [2025-02-08 05:38:56,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:56,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:57,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:57,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1903694891, now seen corresponding path program 1 times [2025-02-08 05:38:57,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:57,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346437384] [2025-02-08 05:38:57,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:57,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:38:57,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:38:57,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:57,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346437384] [2025-02-08 05:38:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346437384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716353365] [2025-02-08 05:38:57,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 652 [2025-02-08 05:38:57,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 592 transitions, 1193 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:57,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 652 [2025-02-08 05:38:57,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,222 INFO L124 PetriNetUnfolderBase]: 50/1065 cut-off events. [2025-02-08 05:38:57,222 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:38:57,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1065 events. 50/1065 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4869 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2025-02-08 05:38:57,240 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/591 dead transitions. [2025-02-08 05:38:57,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 591 transitions, 1221 flow [2025-02-08 05:38:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2025-02-08 05:38:57,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637014314928425 [2025-02-08 05:38:57,245 INFO L175 Difference]: Start difference. First operand has 581 places, 592 transitions, 1193 flow. Second operand 3 states and 1885 transitions. [2025-02-08 05:38:57,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 591 transitions, 1221 flow [2025-02-08 05:38:57,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 591 transitions, 1220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:57,253 INFO L231 Difference]: Finished difference. Result has 581 places, 591 transitions, 1194 flow [2025-02-08 05:38:57,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=581, PETRI_TRANSITIONS=591} [2025-02-08 05:38:57,255 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2025-02-08 05:38:57,255 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 591 transitions, 1194 flow [2025-02-08 05:38:57,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:57,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:57,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:57,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:57,256 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:57,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash 324805941, now seen corresponding path program 1 times [2025-02-08 05:38:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:57,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147865659] [2025-02-08 05:38:57,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:57,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-08 05:38:57,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-08 05:38:57,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:57,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147865659] [2025-02-08 05:38:57,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147865659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869060727] [2025-02-08 05:38:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 652 [2025-02-08 05:38:57,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 591 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-02-08 05:38:57,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 652 [2025-02-08 05:38:57,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,712 INFO L124 PetriNetUnfolderBase]: 166/1874 cut-off events. [2025-02-08 05:38:57,713 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2025-02-08 05:38:57,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1874 events. 166/1874 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12421 event pairs, 64 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1981. Up to 169 conditions per place. [2025-02-08 05:38:57,751 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 16 selfloop transitions, 1 changer transitions 0/586 dead transitions. [2025-02-08 05:38:57,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 586 transitions, 1218 flow [2025-02-08 05:38:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2025-02-08 05:38:57,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9591002044989775 [2025-02-08 05:38:57,756 INFO L175 Difference]: Start difference. First operand has 581 places, 591 transitions, 1194 flow. Second operand 3 states and 1876 transitions. [2025-02-08 05:38:57,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 586 transitions, 1218 flow [2025-02-08 05:38:57,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 586 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:57,764 INFO L231 Difference]: Finished difference. Result has 576 places, 586 transitions, 1182 flow [2025-02-08 05:38:57,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1182, PETRI_PLACES=576, PETRI_TRANSITIONS=586} [2025-02-08 05:38:57,767 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2025-02-08 05:38:57,767 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 586 transitions, 1182 flow [2025-02-08 05:38:57,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-02-08 05:38:57,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:57,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:57,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:57,769 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:57,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1977665471, now seen corresponding path program 1 times [2025-02-08 05:38:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:57,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115486713] [2025-02-08 05:38:57,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:38:57,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:38:57,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:57,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115486713] [2025-02-08 05:38:57,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115486713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595420652] [2025-02-08 05:38:57,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 652 [2025-02-08 05:38:57,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 586 transitions, 1182 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:57,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 652 [2025-02-08 05:38:57,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,994 INFO L124 PetriNetUnfolderBase]: 48/837 cut-off events. [2025-02-08 05:38:57,994 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-08 05:38:58,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 837 events. 48/837 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3238 event pairs, 20 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2025-02-08 05:38:58,008 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2025-02-08 05:38:58,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 585 transitions, 1210 flow [2025-02-08 05:38:58,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2025-02-08 05:38:58,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637014314928425 [2025-02-08 05:38:58,013 INFO L175 Difference]: Start difference. First operand has 576 places, 586 transitions, 1182 flow. Second operand 3 states and 1885 transitions. [2025-02-08 05:38:58,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 585 transitions, 1210 flow [2025-02-08 05:38:58,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 585 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:58,021 INFO L231 Difference]: Finished difference. Result has 576 places, 585 transitions, 1183 flow [2025-02-08 05:38:58,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=576, PETRI_TRANSITIONS=585} [2025-02-08 05:38:58,023 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2025-02-08 05:38:58,023 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 585 transitions, 1183 flow [2025-02-08 05:38:58,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-02-08 05:38:58,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:58,024 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] [2025-02-08 05:38:58,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:38:58,025 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:58,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash -367998480, now seen corresponding path program 1 times [2025-02-08 05:38:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226628656] [2025-02-08 05:38:58,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:58,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-08 05:38:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-08 05:38:58,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:58,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:58,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:58,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226628656] [2025-02-08 05:38:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226628656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:58,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398388354] [2025-02-08 05:38:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:58,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:58,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:58,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:58,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 652 [2025-02-08 05:38:58,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 585 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-02-08 05:38:58,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:58,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 652 [2025-02-08 05:38:58,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:58,390 INFO L124 PetriNetUnfolderBase]: 157/2220 cut-off events. [2025-02-08 05:38:58,390 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:58,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 2220 events. 157/2220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16961 event pairs, 53 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2309. Up to 123 conditions per place. [2025-02-08 05:38:58,424 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 17 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2025-02-08 05:38:58,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 585 transitions, 1223 flow [2025-02-08 05:38:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2025-02-08 05:38:58,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642126789366053 [2025-02-08 05:38:58,429 INFO L175 Difference]: Start difference. First operand has 576 places, 585 transitions, 1183 flow. Second operand 3 states and 1886 transitions. [2025-02-08 05:38:58,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 585 transitions, 1223 flow [2025-02-08 05:38:58,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 585 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:58,440 INFO L231 Difference]: Finished difference. Result has 573 places, 583 transitions, 1185 flow [2025-02-08 05:38:58,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1185, PETRI_PLACES=573, PETRI_TRANSITIONS=583} [2025-02-08 05:38:58,442 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -38 predicate places. [2025-02-08 05:38:58,442 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 583 transitions, 1185 flow [2025-02-08 05:38:58,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-02-08 05:38:58,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:58,443 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] [2025-02-08 05:38:58,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:38:58,444 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:58,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1459180271, now seen corresponding path program 1 times [2025-02-08 05:38:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120816313] [2025-02-08 05:38:58,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:58,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 05:38:58,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 05:38:58,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:58,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:58,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:58,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120816313] [2025-02-08 05:38:58,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120816313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:58,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:58,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:58,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285287266] [2025-02-08 05:38:58,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:58,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:58,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:58,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:58,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:58,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 652 [2025-02-08 05:38:58,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 583 transitions, 1185 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-02-08 05:38:58,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:58,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 652 [2025-02-08 05:38:58,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:58,819 INFO L124 PetriNetUnfolderBase]: 96/1534 cut-off events. [2025-02-08 05:38:58,819 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:38:58,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1534 events. 96/1534 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9595 event pairs, 20 based on Foata normal form. 0/1315 useless extension candidates. Maximal degree in co-relation 1559. Up to 75 conditions per place. [2025-02-08 05:38:58,846 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 17 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2025-02-08 05:38:58,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 583 transitions, 1225 flow [2025-02-08 05:38:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2025-02-08 05:38:58,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642126789366053 [2025-02-08 05:38:58,851 INFO L175 Difference]: Start difference. First operand has 573 places, 583 transitions, 1185 flow. Second operand 3 states and 1886 transitions. [2025-02-08 05:38:58,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 583 transitions, 1225 flow [2025-02-08 05:38:58,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 583 transitions, 1225 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:58,861 INFO L231 Difference]: Finished difference. Result has 572 places, 581 transitions, 1191 flow [2025-02-08 05:38:58,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=572, PETRI_TRANSITIONS=581} [2025-02-08 05:38:58,862 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2025-02-08 05:38:58,862 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 581 transitions, 1191 flow [2025-02-08 05:38:58,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-02-08 05:38:58,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:58,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:58,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:38:58,864 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:58,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1758161140, now seen corresponding path program 1 times [2025-02-08 05:38:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378696738] [2025-02-08 05:38:58,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:58,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 05:38:58,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 05:38:58,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:58,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:58,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378696738] [2025-02-08 05:38:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378696738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:58,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:58,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731390146] [2025-02-08 05:38:58,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:58,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:58,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:58,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:58,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:58,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 652 [2025-02-08 05:38:58,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 581 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-02-08 05:38:58,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:58,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 652 [2025-02-08 05:38:58,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:59,571 INFO L124 PetriNetUnfolderBase]: 250/3267 cut-off events. [2025-02-08 05:38:59,571 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2025-02-08 05:38:59,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 3267 events. 250/3267 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 28605 event pairs, 52 based on Foata normal form. 1/2784 useless extension candidates. Maximal degree in co-relation 3426. Up to 202 conditions per place. [2025-02-08 05:38:59,597 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 17 selfloop transitions, 2 changer transitions 0/581 dead transitions. [2025-02-08 05:38:59,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 581 transitions, 1231 flow [2025-02-08 05:38:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2025-02-08 05:38:59,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642126789366053 [2025-02-08 05:38:59,601 INFO L175 Difference]: Start difference. First operand has 572 places, 581 transitions, 1191 flow. Second operand 3 states and 1886 transitions. [2025-02-08 05:38:59,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 581 transitions, 1231 flow [2025-02-08 05:38:59,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 581 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:59,610 INFO L231 Difference]: Finished difference. Result has 571 places, 579 transitions, 1197 flow [2025-02-08 05:38:59,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=571, PETRI_TRANSITIONS=579} [2025-02-08 05:38:59,611 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2025-02-08 05:38:59,612 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 579 transitions, 1197 flow [2025-02-08 05:38:59,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-02-08 05:38:59,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:59,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:59,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:38:59,614 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:38:59,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1442643647, now seen corresponding path program 1 times [2025-02-08 05:38:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:59,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105732078] [2025-02-08 05:38:59,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:59,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 05:38:59,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 05:38:59,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:59,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:59,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:59,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105732078] [2025-02-08 05:38:59,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105732078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:59,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:59,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470133728] [2025-02-08 05:38:59,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:59,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:59,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:59,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:59,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:59,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 652 [2025-02-08 05:38:59,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 579 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-02-08 05:38:59,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:59,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 652 [2025-02-08 05:38:59,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:00,134 INFO L124 PetriNetUnfolderBase]: 108/2057 cut-off events. [2025-02-08 05:39:00,134 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-02-08 05:39:00,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 2057 events. 108/2057 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13451 event pairs, 8 based on Foata normal form. 1/1771 useless extension candidates. Maximal degree in co-relation 2089. Up to 33 conditions per place. [2025-02-08 05:39:00,166 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2025-02-08 05:39:00,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 580 transitions, 1231 flow [2025-02-08 05:39:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2025-02-08 05:39:00,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683026584867076 [2025-02-08 05:39:00,170 INFO L175 Difference]: Start difference. First operand has 571 places, 579 transitions, 1197 flow. Second operand 3 states and 1894 transitions. [2025-02-08 05:39:00,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 580 transitions, 1231 flow [2025-02-08 05:39:00,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 580 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:00,181 INFO L231 Difference]: Finished difference. Result has 572 places, 578 transitions, 1199 flow [2025-02-08 05:39:00,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=572, PETRI_TRANSITIONS=578} [2025-02-08 05:39:00,183 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2025-02-08 05:39:00,183 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 578 transitions, 1199 flow [2025-02-08 05:39:00,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-02-08 05:39:00,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:00,185 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] [2025-02-08 05:39:00,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:39:00,185 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:00,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:00,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1834275018, now seen corresponding path program 1 times [2025-02-08 05:39:00,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:00,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432751613] [2025-02-08 05:39:00,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:00,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 05:39:00,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 05:39:00,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:00,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:00,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432751613] [2025-02-08 05:39:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432751613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:00,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:00,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:39:00,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446964630] [2025-02-08 05:39:00,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:00,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:00,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:00,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:00,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:00,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 652 [2025-02-08 05:39:00,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 578 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-02-08 05:39:00,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:00,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 652 [2025-02-08 05:39:00,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:00,598 INFO L124 PetriNetUnfolderBase]: 89/1589 cut-off events. [2025-02-08 05:39:00,598 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:39:00,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 1589 events. 89/1589 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 10213 event pairs, 12 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 1664. Up to 40 conditions per place. [2025-02-08 05:39:00,625 INFO L140 encePairwiseOnDemand]: 648/652 looper letters, 14 selfloop transitions, 3 changer transitions 0/581 dead transitions. [2025-02-08 05:39:00,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 581 transitions, 1241 flow [2025-02-08 05:39:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2025-02-08 05:39:00,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693251533742331 [2025-02-08 05:39:00,630 INFO L175 Difference]: Start difference. First operand has 572 places, 578 transitions, 1199 flow. Second operand 3 states and 1896 transitions. [2025-02-08 05:39:00,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 581 transitions, 1241 flow [2025-02-08 05:39:00,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 581 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:00,640 INFO L231 Difference]: Finished difference. Result has 574 places, 579 transitions, 1213 flow [2025-02-08 05:39:00,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=574, PETRI_TRANSITIONS=579} [2025-02-08 05:39:00,641 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -37 predicate places. [2025-02-08 05:39:00,641 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 579 transitions, 1213 flow [2025-02-08 05:39:00,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-02-08 05:39:00,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:00,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:00,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:39:00,642 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:00,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1625387465, now seen corresponding path program 1 times [2025-02-08 05:39:00,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781627793] [2025-02-08 05:39:00,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:00,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 05:39:00,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 05:39:00,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:00,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:00,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:00,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781627793] [2025-02-08 05:39:00,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781627793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:00,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:00,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626245793] [2025-02-08 05:39:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:00,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:00,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:00,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:00,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 652 [2025-02-08 05:39:00,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 579 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-02-08 05:39:00,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:00,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 652 [2025-02-08 05:39:00,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:01,296 INFO L124 PetriNetUnfolderBase]: 197/2613 cut-off events. [2025-02-08 05:39:01,297 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-02-08 05:39:01,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 2613 events. 197/2613 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 19786 event pairs, 24 based on Foata normal form. 0/2267 useless extension candidates. Maximal degree in co-relation 2827. Up to 168 conditions per place. [2025-02-08 05:39:01,339 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 20 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2025-02-08 05:39:01,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 582 transitions, 1268 flow [2025-02-08 05:39:01,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2025-02-08 05:39:01,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657464212678937 [2025-02-08 05:39:01,343 INFO L175 Difference]: Start difference. First operand has 574 places, 579 transitions, 1213 flow. Second operand 3 states and 1889 transitions. [2025-02-08 05:39:01,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 582 transitions, 1268 flow [2025-02-08 05:39:01,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 582 transitions, 1262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:01,354 INFO L231 Difference]: Finished difference. Result has 571 places, 577 transitions, 1213 flow [2025-02-08 05:39:01,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2025-02-08 05:39:01,355 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2025-02-08 05:39:01,355 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1213 flow [2025-02-08 05:39:01,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-02-08 05:39:01,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:01,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:01,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:39:01,356 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:01,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash -740153579, now seen corresponding path program 1 times [2025-02-08 05:39:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:01,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575039363] [2025-02-08 05:39:01,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:01,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:01,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 05:39:01,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 05:39:01,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:01,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:01,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575039363] [2025-02-08 05:39:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575039363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:01,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:01,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:01,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277493533] [2025-02-08 05:39:01,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:01,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:01,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:01,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:01,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:01,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 652 [2025-02-08 05:39:01,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-02-08 05:39:01,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:01,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 652 [2025-02-08 05:39:01,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:01,916 INFO L124 PetriNetUnfolderBase]: 169/2812 cut-off events. [2025-02-08 05:39:01,917 INFO L125 PetriNetUnfolderBase]: For 20/59 co-relation queries the response was YES. [2025-02-08 05:39:01,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 2812 events. 169/2812 cut-off events. For 20/59 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 20824 event pairs, 19 based on Foata normal form. 0/2415 useless extension candidates. Maximal degree in co-relation 2941. Up to 72 conditions per place. [2025-02-08 05:39:01,950 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 14 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2025-02-08 05:39:01,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 578 transitions, 1249 flow [2025-02-08 05:39:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2025-02-08 05:39:01,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967280163599182 [2025-02-08 05:39:01,954 INFO L175 Difference]: Start difference. First operand has 571 places, 577 transitions, 1213 flow. Second operand 3 states and 1892 transitions. [2025-02-08 05:39:01,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 578 transitions, 1249 flow [2025-02-08 05:39:01,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 578 transitions, 1249 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:01,963 INFO L231 Difference]: Finished difference. Result has 572 places, 576 transitions, 1215 flow [2025-02-08 05:39:01,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=572, PETRI_TRANSITIONS=576} [2025-02-08 05:39:01,964 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2025-02-08 05:39:01,965 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 576 transitions, 1215 flow [2025-02-08 05:39:01,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-02-08 05:39:01,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:01,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:01,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:39:01,965 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:01,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:01,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1571818071, now seen corresponding path program 1 times [2025-02-08 05:39:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533757169] [2025-02-08 05:39:01,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:01,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:01,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 05:39:01,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 05:39:01,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:01,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533757169] [2025-02-08 05:39:02,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533757169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:02,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:02,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366802776] [2025-02-08 05:39:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:02,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:02,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:02,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:02,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 652 [2025-02-08 05:39:02,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 576 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-02-08 05:39:02,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:02,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 652 [2025-02-08 05:39:02,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:02,511 INFO L124 PetriNetUnfolderBase]: 147/2543 cut-off events. [2025-02-08 05:39:02,511 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-02-08 05:39:02,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 2543 events. 147/2543 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18046 event pairs, 10 based on Foata normal form. 0/2202 useless extension candidates. Maximal degree in co-relation 2661. Up to 44 conditions per place. [2025-02-08 05:39:02,544 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2025-02-08 05:39:02,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 577 transitions, 1249 flow [2025-02-08 05:39:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2025-02-08 05:39:02,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683026584867076 [2025-02-08 05:39:02,547 INFO L175 Difference]: Start difference. First operand has 572 places, 576 transitions, 1215 flow. Second operand 3 states and 1894 transitions. [2025-02-08 05:39:02,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 577 transitions, 1249 flow [2025-02-08 05:39:02,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:02,554 INFO L231 Difference]: Finished difference. Result has 571 places, 575 transitions, 1213 flow [2025-02-08 05:39:02,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=575} [2025-02-08 05:39:02,555 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2025-02-08 05:39:02,555 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 575 transitions, 1213 flow [2025-02-08 05:39:02,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-02-08 05:39:02,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:02,555 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-02-08 05:39:02,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:39:02,556 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:02,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1233065393, now seen corresponding path program 1 times [2025-02-08 05:39:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:02,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426339948] [2025-02-08 05:39:02,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:02,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-08 05:39:02,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-08 05:39:02,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:02,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426339948] [2025-02-08 05:39:02,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426339948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:02,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:02,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:02,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541922864] [2025-02-08 05:39:02,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:02,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:02,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:02,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:03,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 652 [2025-02-08 05:39:03,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 575 transitions, 1213 flow. Second operand has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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-02-08 05:39:03,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:03,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 652 [2025-02-08 05:39:03,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:04,419 INFO L124 PetriNetUnfolderBase]: 235/3653 cut-off events. [2025-02-08 05:39:04,419 INFO L125 PetriNetUnfolderBase]: For 9/27 co-relation queries the response was YES. [2025-02-08 05:39:04,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 3653 events. 235/3653 cut-off events. For 9/27 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31326 event pairs, 43 based on Foata normal form. 5/3193 useless extension candidates. Maximal degree in co-relation 4072. Up to 155 conditions per place. [2025-02-08 05:39:04,464 INFO L140 encePairwiseOnDemand]: 637/652 looper letters, 70 selfloop transitions, 16 changer transitions 0/614 dead transitions. [2025-02-08 05:39:04,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 614 transitions, 1479 flow [2025-02-08 05:39:04,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:39:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:39:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2025-02-08 05:39:04,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230340211935304 [2025-02-08 05:39:04,472 INFO L175 Difference]: Start difference. First operand has 571 places, 575 transitions, 1213 flow. Second operand 11 states and 6620 transitions. [2025-02-08 05:39:04,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 614 transitions, 1479 flow [2025-02-08 05:39:04,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 614 transitions, 1475 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:04,480 INFO L231 Difference]: Finished difference. Result has 584 places, 584 transitions, 1293 flow [2025-02-08 05:39:04,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1293, PETRI_PLACES=584, PETRI_TRANSITIONS=584} [2025-02-08 05:39:04,481 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2025-02-08 05:39:04,481 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 584 transitions, 1293 flow [2025-02-08 05:39:04,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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-02-08 05:39:04,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:04,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:04,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:39:04,482 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash 698567915, now seen corresponding path program 1 times [2025-02-08 05:39:04,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:04,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942287556] [2025-02-08 05:39:04,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:04,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:04,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:39:04,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:39:04,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:04,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942287556] [2025-02-08 05:39:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942287556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:04,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:04,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751784671] [2025-02-08 05:39:04,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:04,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:04,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:04,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:04,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 652 [2025-02-08 05:39:04,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 584 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-02-08 05:39:04,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:04,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 652 [2025-02-08 05:39:04,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:05,001 INFO L124 PetriNetUnfolderBase]: 191/2428 cut-off events. [2025-02-08 05:39:05,001 INFO L125 PetriNetUnfolderBase]: For 79/144 co-relation queries the response was YES. [2025-02-08 05:39:05,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 2428 events. 191/2428 cut-off events. For 79/144 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 18743 event pairs, 44 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 2724. Up to 165 conditions per place. [2025-02-08 05:39:05,035 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 14 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2025-02-08 05:39:05,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 585 transitions, 1329 flow [2025-02-08 05:39:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2025-02-08 05:39:05,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967280163599182 [2025-02-08 05:39:05,038 INFO L175 Difference]: Start difference. First operand has 584 places, 584 transitions, 1293 flow. Second operand 3 states and 1892 transitions. [2025-02-08 05:39:05,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 585 transitions, 1329 flow [2025-02-08 05:39:05,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 585 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:05,046 INFO L231 Difference]: Finished difference. Result has 584 places, 583 transitions, 1291 flow [2025-02-08 05:39:05,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=584, PETRI_TRANSITIONS=583} [2025-02-08 05:39:05,047 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2025-02-08 05:39:05,047 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 583 transitions, 1291 flow [2025-02-08 05:39:05,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-02-08 05:39:05,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:05,047 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] [2025-02-08 05:39:05,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:39:05,048 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:05,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 242764032, now seen corresponding path program 1 times [2025-02-08 05:39:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376599884] [2025-02-08 05:39:05,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:05,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 05:39:05,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 05:39:05,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:05,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:05,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376599884] [2025-02-08 05:39:05,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376599884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:05,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:05,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:39:05,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303191357] [2025-02-08 05:39:05,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:05,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:05,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:05,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:05,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:05,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 652 [2025-02-08 05:39:05,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 583 transitions, 1291 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-02-08 05:39:05,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:05,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 652 [2025-02-08 05:39:05,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:05,734 INFO L124 PetriNetUnfolderBase]: 258/3178 cut-off events. [2025-02-08 05:39:05,734 INFO L125 PetriNetUnfolderBase]: For 114/211 co-relation queries the response was YES. [2025-02-08 05:39:05,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 3178 events. 258/3178 cut-off events. For 114/211 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 25022 event pairs, 66 based on Foata normal form. 0/2739 useless extension candidates. Maximal degree in co-relation 3589. Up to 240 conditions per place. [2025-02-08 05:39:05,782 INFO L140 encePairwiseOnDemand]: 648/652 looper letters, 14 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2025-02-08 05:39:05,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 586 transitions, 1333 flow [2025-02-08 05:39:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2025-02-08 05:39:05,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693251533742331 [2025-02-08 05:39:05,786 INFO L175 Difference]: Start difference. First operand has 584 places, 583 transitions, 1291 flow. Second operand 3 states and 1896 transitions. [2025-02-08 05:39:05,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 586 transitions, 1333 flow [2025-02-08 05:39:05,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 586 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:05,796 INFO L231 Difference]: Finished difference. Result has 586 places, 584 transitions, 1305 flow [2025-02-08 05:39:05,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=586, PETRI_TRANSITIONS=584} [2025-02-08 05:39:05,798 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -25 predicate places. [2025-02-08 05:39:05,798 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 584 transitions, 1305 flow [2025-02-08 05:39:05,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-02-08 05:39:05,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:05,799 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] [2025-02-08 05:39:05,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:39:05,799 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:05,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:05,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1100704139, now seen corresponding path program 1 times [2025-02-08 05:39:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:05,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362746993] [2025-02-08 05:39:05,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:05,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:05,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 05:39:05,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 05:39:05,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:05,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:05,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:05,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362746993] [2025-02-08 05:39:05,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362746993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:05,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:05,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:39:05,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189865486] [2025-02-08 05:39:05,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:05,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:05,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:05,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:05,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:05,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 652 [2025-02-08 05:39:05,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 584 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-02-08 05:39:05,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:05,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 652 [2025-02-08 05:39:05,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:06,717 INFO L124 PetriNetUnfolderBase]: 296/3768 cut-off events. [2025-02-08 05:39:06,717 INFO L125 PetriNetUnfolderBase]: For 92/125 co-relation queries the response was YES. [2025-02-08 05:39:06,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4472 conditions, 3768 events. 296/3768 cut-off events. For 92/125 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 33148 event pairs, 72 based on Foata normal form. 0/3315 useless extension candidates. Maximal degree in co-relation 4383. Up to 224 conditions per place. [2025-02-08 05:39:06,767 INFO L140 encePairwiseOnDemand]: 648/652 looper letters, 14 selfloop transitions, 3 changer transitions 0/587 dead transitions. [2025-02-08 05:39:06,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 587 transitions, 1347 flow [2025-02-08 05:39:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2025-02-08 05:39:06,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693251533742331 [2025-02-08 05:39:06,770 INFO L175 Difference]: Start difference. First operand has 586 places, 584 transitions, 1305 flow. Second operand 3 states and 1896 transitions. [2025-02-08 05:39:06,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 587 transitions, 1347 flow [2025-02-08 05:39:06,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 587 transitions, 1341 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:06,779 INFO L231 Difference]: Finished difference. Result has 588 places, 585 transitions, 1317 flow [2025-02-08 05:39:06,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=588, PETRI_TRANSITIONS=585} [2025-02-08 05:39:06,780 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -23 predicate places. [2025-02-08 05:39:06,780 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 585 transitions, 1317 flow [2025-02-08 05:39:06,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-02-08 05:39:06,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:06,781 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] [2025-02-08 05:39:06,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:39:06,781 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:06,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1455494478, now seen corresponding path program 1 times [2025-02-08 05:39:06,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:06,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095744417] [2025-02-08 05:39:06,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:06,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:06,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-08 05:39:06,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-08 05:39:06,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:06,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:06,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:06,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095744417] [2025-02-08 05:39:06,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095744417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:06,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:06,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:06,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214797810] [2025-02-08 05:39:06,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:06,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:06,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:06,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:06,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:06,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 652 [2025-02-08 05:39:06,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 585 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-02-08 05:39:06,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:06,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 652 [2025-02-08 05:39:06,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:07,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1644] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][402], [673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 687#(= |#race~count3~0| 0), 699#(= |#race~get1~0| 0), 251#L125true, 122#thread3ENTRYtrue, Black: 677#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), 740#true, Black: 681#true, 745#true, 683#(= |#race~count2~0| 0), Black: 685#true, 679#(= |#race~count1~0| 0), 667#(= |#race~n2~0| 0), Black: 712#(<= ~n1~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true]) [2025-02-08 05:39:07,432 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2025-02-08 05:39:07,432 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-02-08 05:39:07,432 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-02-08 05:39:07,432 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-02-08 05:39:07,516 INFO L124 PetriNetUnfolderBase]: 307/4941 cut-off events. [2025-02-08 05:39:07,517 INFO L125 PetriNetUnfolderBase]: For 60/125 co-relation queries the response was YES. [2025-02-08 05:39:07,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5630 conditions, 4941 events. 307/4941 cut-off events. For 60/125 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 44029 event pairs, 29 based on Foata normal form. 0/4343 useless extension candidates. Maximal degree in co-relation 5540. Up to 131 conditions per place. [2025-02-08 05:39:07,582 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 14 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2025-02-08 05:39:07,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 586 transitions, 1353 flow [2025-02-08 05:39:07,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2025-02-08 05:39:07,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967280163599182 [2025-02-08 05:39:07,585 INFO L175 Difference]: Start difference. First operand has 588 places, 585 transitions, 1317 flow. Second operand 3 states and 1892 transitions. [2025-02-08 05:39:07,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 586 transitions, 1353 flow [2025-02-08 05:39:07,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 586 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:07,594 INFO L231 Difference]: Finished difference. Result has 587 places, 584 transitions, 1313 flow [2025-02-08 05:39:07,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=587, PETRI_TRANSITIONS=584} [2025-02-08 05:39:07,595 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -24 predicate places. [2025-02-08 05:39:07,595 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 584 transitions, 1313 flow [2025-02-08 05:39:07,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-02-08 05:39:07,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:07,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:07,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:39:07,596 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:07,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1065808501, now seen corresponding path program 1 times [2025-02-08 05:39:07,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:07,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907366766] [2025-02-08 05:39:07,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:07,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-08 05:39:07,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-08 05:39:07,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:07,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907366766] [2025-02-08 05:39:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907366766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:07,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849224675] [2025-02-08 05:39:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:07,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:07,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:07,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:07,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:07,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 652 [2025-02-08 05:39:07,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 584 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-02-08 05:39:07,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:07,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 652 [2025-02-08 05:39:07,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:08,445 INFO L124 PetriNetUnfolderBase]: 366/4865 cut-off events. [2025-02-08 05:39:08,446 INFO L125 PetriNetUnfolderBase]: For 59/83 co-relation queries the response was YES. [2025-02-08 05:39:08,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 4865 events. 366/4865 cut-off events. For 59/83 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 42641 event pairs, 48 based on Foata normal form. 0/4336 useless extension candidates. Maximal degree in co-relation 5669. Up to 325 conditions per place. [2025-02-08 05:39:08,544 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 20 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2025-02-08 05:39:08,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 587 transitions, 1368 flow [2025-02-08 05:39:08,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2025-02-08 05:39:08,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657464212678937 [2025-02-08 05:39:08,547 INFO L175 Difference]: Start difference. First operand has 587 places, 584 transitions, 1313 flow. Second operand 3 states and 1889 transitions. [2025-02-08 05:39:08,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 587 transitions, 1368 flow [2025-02-08 05:39:08,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 587 transitions, 1364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:08,554 INFO L231 Difference]: Finished difference. Result has 584 places, 582 transitions, 1315 flow [2025-02-08 05:39:08,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1315, PETRI_PLACES=584, PETRI_TRANSITIONS=582} [2025-02-08 05:39:08,555 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2025-02-08 05:39:08,555 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 582 transitions, 1315 flow [2025-02-08 05:39:08,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-02-08 05:39:08,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:08,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:08,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:39:08,556 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:08,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash -590473787, now seen corresponding path program 1 times [2025-02-08 05:39:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:08,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770627787] [2025-02-08 05:39:08,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:08,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-08 05:39:08,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-08 05:39:08,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:08,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:08,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:08,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770627787] [2025-02-08 05:39:08,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770627787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:08,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:08,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:08,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638844882] [2025-02-08 05:39:08,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:08,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:08,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:08,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:08,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:09,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 652 [2025-02-08 05:39:09,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 582 transitions, 1315 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-02-08 05:39:09,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:09,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 652 [2025-02-08 05:39:09,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:10,098 INFO L124 PetriNetUnfolderBase]: 391/4915 cut-off events. [2025-02-08 05:39:10,099 INFO L125 PetriNetUnfolderBase]: For 95/203 co-relation queries the response was YES. [2025-02-08 05:39:10,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 4915 events. 391/4915 cut-off events. For 95/203 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 44493 event pairs, 108 based on Foata normal form. 6/4384 useless extension candidates. Maximal degree in co-relation 5906. Up to 338 conditions per place. [2025-02-08 05:39:10,168 INFO L140 encePairwiseOnDemand]: 637/652 looper letters, 70 selfloop transitions, 16 changer transitions 0/616 dead transitions. [2025-02-08 05:39:10,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 616 transitions, 1571 flow [2025-02-08 05:39:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:39:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:39:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2025-02-08 05:39:10,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230340211935304 [2025-02-08 05:39:10,175 INFO L175 Difference]: Start difference. First operand has 584 places, 582 transitions, 1315 flow. Second operand 11 states and 6620 transitions. [2025-02-08 05:39:10,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 616 transitions, 1571 flow [2025-02-08 05:39:10,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 616 transitions, 1571 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:10,184 INFO L231 Difference]: Finished difference. Result has 597 places, 586 transitions, 1378 flow [2025-02-08 05:39:10,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1378, PETRI_PLACES=597, PETRI_TRANSITIONS=586} [2025-02-08 05:39:10,185 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2025-02-08 05:39:10,185 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 586 transitions, 1378 flow [2025-02-08 05:39:10,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-02-08 05:39:10,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:10,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:10,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:39:10,186 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:10,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:10,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2094464397, now seen corresponding path program 1 times [2025-02-08 05:39:10,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:10,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394729183] [2025-02-08 05:39:10,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:10,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-08 05:39:10,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-08 05:39:10,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:10,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:10,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394729183] [2025-02-08 05:39:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394729183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:10,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:10,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:10,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867209553] [2025-02-08 05:39:10,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:10,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:10,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:10,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:10,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 652 [2025-02-08 05:39:10,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 586 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-02-08 05:39:10,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:10,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 652 [2025-02-08 05:39:10,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:10,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1643] thread3EXIT-->L127-6: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][532], [Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), 593#L127-6true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 752#true, Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 748#true, Black: 685#true, 775#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 750#(= |#race~get2~0| 0), Black: 697#true]) [2025-02-08 05:39:10,814 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-02-08 05:39:10,815 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2025-02-08 05:39:10,815 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2025-02-08 05:39:10,815 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-02-08 05:39:10,831 INFO L124 PetriNetUnfolderBase]: 244/2947 cut-off events. [2025-02-08 05:39:10,832 INFO L125 PetriNetUnfolderBase]: For 111/149 co-relation queries the response was YES. [2025-02-08 05:39:10,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3675 conditions, 2947 events. 244/2947 cut-off events. For 111/149 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 22614 event pairs, 43 based on Foata normal form. 2/2643 useless extension candidates. Maximal degree in co-relation 3578. Up to 209 conditions per place. [2025-02-08 05:39:10,872 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 14 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2025-02-08 05:39:10,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 587 transitions, 1414 flow [2025-02-08 05:39:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2025-02-08 05:39:10,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967280163599182 [2025-02-08 05:39:10,874 INFO L175 Difference]: Start difference. First operand has 597 places, 586 transitions, 1378 flow. Second operand 3 states and 1892 transitions. [2025-02-08 05:39:10,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 587 transitions, 1414 flow [2025-02-08 05:39:10,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 587 transitions, 1393 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:39:10,881 INFO L231 Difference]: Finished difference. Result has 591 places, 585 transitions, 1359 flow [2025-02-08 05:39:10,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1359, PETRI_PLACES=591, PETRI_TRANSITIONS=585} [2025-02-08 05:39:10,883 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -20 predicate places. [2025-02-08 05:39:10,883 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 585 transitions, 1359 flow [2025-02-08 05:39:10,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-02-08 05:39:10,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:10,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:10,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:39:10,883 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:10,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2084069051, now seen corresponding path program 1 times [2025-02-08 05:39:10,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:10,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807094111] [2025-02-08 05:39:10,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:10,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:10,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 05:39:10,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 05:39:10,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:10,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:11,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:11,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807094111] [2025-02-08 05:39:11,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807094111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:11,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:11,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:11,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931376732] [2025-02-08 05:39:11,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:11,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:11,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:11,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:11,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:11,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 652 [2025-02-08 05:39:11,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 585 transitions, 1359 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-02-08 05:39:11,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:11,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 652 [2025-02-08 05:39:11,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:12,434 INFO L124 PetriNetUnfolderBase]: 522/5089 cut-off events. [2025-02-08 05:39:12,434 INFO L125 PetriNetUnfolderBase]: For 317/485 co-relation queries the response was YES. [2025-02-08 05:39:12,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6830 conditions, 5089 events. 522/5089 cut-off events. For 317/485 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 46665 event pairs, 143 based on Foata normal form. 23/4600 useless extension candidates. Maximal degree in co-relation 6732. Up to 530 conditions per place. [2025-02-08 05:39:12,506 INFO L140 encePairwiseOnDemand]: 635/652 looper letters, 65 selfloop transitions, 19 changer transitions 0/617 dead transitions. [2025-02-08 05:39:12,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 617 transitions, 1609 flow [2025-02-08 05:39:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:39:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:39:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7208 transitions. [2025-02-08 05:39:12,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212678936605317 [2025-02-08 05:39:12,509 INFO L175 Difference]: Start difference. First operand has 591 places, 585 transitions, 1359 flow. Second operand 12 states and 7208 transitions. [2025-02-08 05:39:12,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 617 transitions, 1609 flow [2025-02-08 05:39:12,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 617 transitions, 1605 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:12,518 INFO L231 Difference]: Finished difference. Result has 606 places, 595 transitions, 1456 flow [2025-02-08 05:39:12,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1456, PETRI_PLACES=606, PETRI_TRANSITIONS=595} [2025-02-08 05:39:12,519 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -5 predicate places. [2025-02-08 05:39:12,519 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 595 transitions, 1456 flow [2025-02-08 05:39:12,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-02-08 05:39:12,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:12,520 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] [2025-02-08 05:39:12,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:39:12,520 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:12,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash -37331338, now seen corresponding path program 1 times [2025-02-08 05:39:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787706918] [2025-02-08 05:39:12,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:12,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-08 05:39:12,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 05:39:12,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:12,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:39:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787706918] [2025-02-08 05:39:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787706918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:12,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:12,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:12,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177218081] [2025-02-08 05:39:12,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:12,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:12,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:12,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:12,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:13,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 652 [2025-02-08 05:39:13,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 595 transitions, 1456 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-02-08 05:39:13,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:13,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 652 [2025-02-08 05:39:13,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:14,095 INFO L124 PetriNetUnfolderBase]: 412/5900 cut-off events. [2025-02-08 05:39:14,096 INFO L125 PetriNetUnfolderBase]: For 303/333 co-relation queries the response was YES. [2025-02-08 05:39:14,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7828 conditions, 5900 events. 412/5900 cut-off events. For 303/333 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 55361 event pairs, 66 based on Foata normal form. 2/5421 useless extension candidates. Maximal degree in co-relation 7721. Up to 267 conditions per place. [2025-02-08 05:39:14,164 INFO L140 encePairwiseOnDemand]: 636/652 looper letters, 73 selfloop transitions, 20 changer transitions 0/627 dead transitions. [2025-02-08 05:39:14,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 627 transitions, 1752 flow [2025-02-08 05:39:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:39:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:39:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6613 transitions. [2025-02-08 05:39:14,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9220580033463469 [2025-02-08 05:39:14,272 INFO L175 Difference]: Start difference. First operand has 606 places, 595 transitions, 1456 flow. Second operand 11 states and 6613 transitions. [2025-02-08 05:39:14,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 627 transitions, 1752 flow [2025-02-08 05:39:14,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 627 transitions, 1752 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:14,280 INFO L231 Difference]: Finished difference. Result has 619 places, 603 transitions, 1573 flow [2025-02-08 05:39:14,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1573, PETRI_PLACES=619, PETRI_TRANSITIONS=603} [2025-02-08 05:39:14,281 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 8 predicate places. [2025-02-08 05:39:14,281 INFO L471 AbstractCegarLoop]: Abstraction has has 619 places, 603 transitions, 1573 flow [2025-02-08 05:39:14,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-02-08 05:39:14,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:14,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:14,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:39:14,282 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1044353196, now seen corresponding path program 1 times [2025-02-08 05:39:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058248672] [2025-02-08 05:39:14,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:14,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-08 05:39:14,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-08 05:39:14,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:14,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:39:14,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058248672] [2025-02-08 05:39:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058248672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:14,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026690358] [2025-02-08 05:39:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:14,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:14,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:14,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:14,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:14,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 652 [2025-02-08 05:39:14,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 603 transitions, 1573 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-02-08 05:39:14,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:14,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 652 [2025-02-08 05:39:14,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:16,607 INFO L124 PetriNetUnfolderBase]: 927/11340 cut-off events. [2025-02-08 05:39:16,607 INFO L125 PetriNetUnfolderBase]: For 951/1118 co-relation queries the response was YES. [2025-02-08 05:39:16,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15509 conditions, 11340 events. 927/11340 cut-off events. For 951/1118 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 127647 event pairs, 171 based on Foata normal form. 6/10401 useless extension candidates. Maximal degree in co-relation 15395. Up to 506 conditions per place. [2025-02-08 05:39:16,779 INFO L140 encePairwiseOnDemand]: 635/652 looper letters, 67 selfloop transitions, 24 changer transitions 0/633 dead transitions. [2025-02-08 05:39:16,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 633 transitions, 1863 flow [2025-02-08 05:39:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:39:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:39:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7201 transitions. [2025-02-08 05:39:16,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9203732106339468 [2025-02-08 05:39:16,784 INFO L175 Difference]: Start difference. First operand has 619 places, 603 transitions, 1573 flow. Second operand 12 states and 7201 transitions. [2025-02-08 05:39:16,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 633 transitions, 1863 flow [2025-02-08 05:39:16,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 633 transitions, 1842 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:39:16,806 INFO L231 Difference]: Finished difference. Result has 629 places, 617 transitions, 1706 flow [2025-02-08 05:39:16,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1706, PETRI_PLACES=629, PETRI_TRANSITIONS=617} [2025-02-08 05:39:16,807 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 18 predicate places. [2025-02-08 05:39:16,807 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 617 transitions, 1706 flow [2025-02-08 05:39:16,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-02-08 05:39:16,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:16,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:16,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:39:16,807 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:16,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1157431437, now seen corresponding path program 1 times [2025-02-08 05:39:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298521216] [2025-02-08 05:39:16,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:16,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-08 05:39:16,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-08 05:39:16,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:16,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:39:16,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298521216] [2025-02-08 05:39:16,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298521216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:16,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:16,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:16,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782181522] [2025-02-08 05:39:16,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:16,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:17,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:17,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:17,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:17,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 652 [2025-02-08 05:39:17,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 617 transitions, 1706 flow. Second operand has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 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-02-08 05:39:17,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:17,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 652 [2025-02-08 05:39:17,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:18,604 INFO L124 PetriNetUnfolderBase]: 722/6931 cut-off events. [2025-02-08 05:39:18,604 INFO L125 PetriNetUnfolderBase]: For 1354/1543 co-relation queries the response was YES. [2025-02-08 05:39:18,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10460 conditions, 6931 events. 722/6931 cut-off events. For 1354/1543 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 68692 event pairs, 221 based on Foata normal form. 19/6393 useless extension candidates. Maximal degree in co-relation 10338. Up to 856 conditions per place. [2025-02-08 05:39:18,706 INFO L140 encePairwiseOnDemand]: 636/652 looper letters, 70 selfloop transitions, 21 changer transitions 0/641 dead transitions. [2025-02-08 05:39:18,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 641 transitions, 1993 flow [2025-02-08 05:39:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:39:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:39:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6604 transitions. [2025-02-08 05:39:18,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.920803123257111 [2025-02-08 05:39:18,711 INFO L175 Difference]: Start difference. First operand has 629 places, 617 transitions, 1706 flow. Second operand 11 states and 6604 transitions. [2025-02-08 05:39:18,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 641 transitions, 1993 flow [2025-02-08 05:39:18,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 641 transitions, 1993 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:18,732 INFO L231 Difference]: Finished difference. Result has 642 places, 626 transitions, 1839 flow [2025-02-08 05:39:18,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1839, PETRI_PLACES=642, PETRI_TRANSITIONS=626} [2025-02-08 05:39:18,734 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 31 predicate places. [2025-02-08 05:39:18,734 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 626 transitions, 1839 flow [2025-02-08 05:39:18,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 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-02-08 05:39:18,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:18,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:18,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:39:18,735 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:18,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash -29814758, now seen corresponding path program 1 times [2025-02-08 05:39:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17566939] [2025-02-08 05:39:18,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:18,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:18,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-08 05:39:18,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-08 05:39:18,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:18,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:39:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17566939] [2025-02-08 05:39:19,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17566939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:19,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:19,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701868391] [2025-02-08 05:39:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:19,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:19,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:19,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:19,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:19,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 652 [2025-02-08 05:39:19,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 626 transitions, 1839 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-02-08 05:39:19,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:19,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 652 [2025-02-08 05:39:19,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:21,218 INFO L124 PetriNetUnfolderBase]: 655/9738 cut-off events. [2025-02-08 05:39:21,218 INFO L125 PetriNetUnfolderBase]: For 2290/2358 co-relation queries the response was YES. [2025-02-08 05:39:21,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14096 conditions, 9738 events. 655/9738 cut-off events. For 2290/2358 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 101925 event pairs, 42 based on Foata normal form. 10/9045 useless extension candidates. Maximal degree in co-relation 13968. Up to 282 conditions per place. [2025-02-08 05:39:21,305 INFO L140 encePairwiseOnDemand]: 644/652 looper letters, 42 selfloop transitions, 6 changer transitions 0/633 dead transitions. [2025-02-08 05:39:21,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 633 transitions, 1961 flow [2025-02-08 05:39:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2025-02-08 05:39:21,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939161554192229 [2025-02-08 05:39:21,307 INFO L175 Difference]: Start difference. First operand has 642 places, 626 transitions, 1839 flow. Second operand 6 states and 3674 transitions. [2025-02-08 05:39:21,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 633 transitions, 1961 flow [2025-02-08 05:39:21,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 633 transitions, 1940 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:39:21,336 INFO L231 Difference]: Finished difference. Result has 639 places, 625 transitions, 1837 flow [2025-02-08 05:39:21,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1814, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1837, PETRI_PLACES=639, PETRI_TRANSITIONS=625} [2025-02-08 05:39:21,337 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 28 predicate places. [2025-02-08 05:39:21,337 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 625 transitions, 1837 flow [2025-02-08 05:39:21,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-02-08 05:39:21,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:21,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:21,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:39:21,338 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:21,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash -359771628, now seen corresponding path program 1 times [2025-02-08 05:39:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:21,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784040450] [2025-02-08 05:39:21,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:21,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:21,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-08 05:39:21,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-08 05:39:21,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:21,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:39:21,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:21,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784040450] [2025-02-08 05:39:21,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784040450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:21,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:21,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:21,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456822619] [2025-02-08 05:39:21,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:21,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:21,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:21,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:21,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:22,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 652 [2025-02-08 05:39:22,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 625 transitions, 1837 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-02-08 05:39:22,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:22,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 652 [2025-02-08 05:39:22,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:23,938 INFO L124 PetriNetUnfolderBase]: 744/10591 cut-off events. [2025-02-08 05:39:23,938 INFO L125 PetriNetUnfolderBase]: For 2638/2764 co-relation queries the response was YES. [2025-02-08 05:39:24,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15427 conditions, 10591 events. 744/10591 cut-off events. For 2638/2764 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 112843 event pairs, 70 based on Foata normal form. 15/9809 useless extension candidates. Maximal degree in co-relation 15299. Up to 378 conditions per place. [2025-02-08 05:39:24,105 INFO L140 encePairwiseOnDemand]: 644/652 looper letters, 42 selfloop transitions, 6 changer transitions 0/632 dead transitions. [2025-02-08 05:39:24,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 632 transitions, 1959 flow [2025-02-08 05:39:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2025-02-08 05:39:24,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939161554192229 [2025-02-08 05:39:24,107 INFO L175 Difference]: Start difference. First operand has 639 places, 625 transitions, 1837 flow. Second operand 6 states and 3674 transitions. [2025-02-08 05:39:24,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 632 transitions, 1959 flow [2025-02-08 05:39:24,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 632 transitions, 1946 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:24,138 INFO L231 Difference]: Finished difference. Result has 639 places, 624 transitions, 1843 flow [2025-02-08 05:39:24,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1843, PETRI_PLACES=639, PETRI_TRANSITIONS=624} [2025-02-08 05:39:24,139 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 28 predicate places. [2025-02-08 05:39:24,139 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 624 transitions, 1843 flow [2025-02-08 05:39:24,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-02-08 05:39:24,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:24,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:24,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 05:39:24,140 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:24,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash -836009730, now seen corresponding path program 1 times [2025-02-08 05:39:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:24,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222264788] [2025-02-08 05:39:24,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:24,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-08 05:39:24,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-08 05:39:24,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:24,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:39:24,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:24,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222264788] [2025-02-08 05:39:24,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222264788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:24,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:24,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124957058] [2025-02-08 05:39:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:24,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:24,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:24,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:24,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:25,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 652 [2025-02-08 05:39:25,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 624 transitions, 1843 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-02-08 05:39:25,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:25,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 652 [2025-02-08 05:39:25,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:26,750 INFO L124 PetriNetUnfolderBase]: 633/9637 cut-off events. [2025-02-08 05:39:26,750 INFO L125 PetriNetUnfolderBase]: For 2361/2429 co-relation queries the response was YES. [2025-02-08 05:39:26,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14030 conditions, 9637 events. 633/9637 cut-off events. For 2361/2429 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 100707 event pairs, 42 based on Foata normal form. 10/8985 useless extension candidates. Maximal degree in co-relation 13901. Up to 282 conditions per place. [2025-02-08 05:39:26,841 INFO L140 encePairwiseOnDemand]: 644/652 looper letters, 42 selfloop transitions, 6 changer transitions 0/630 dead transitions. [2025-02-08 05:39:26,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 630 transitions, 1959 flow [2025-02-08 05:39:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2025-02-08 05:39:26,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939161554192229 [2025-02-08 05:39:26,844 INFO L175 Difference]: Start difference. First operand has 639 places, 624 transitions, 1843 flow. Second operand 6 states and 3674 transitions. [2025-02-08 05:39:26,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 630 transitions, 1959 flow [2025-02-08 05:39:26,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 630 transitions, 1946 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:26,875 INFO L231 Difference]: Finished difference. Result has 638 places, 622 transitions, 1838 flow [2025-02-08 05:39:26,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1838, PETRI_PLACES=638, PETRI_TRANSITIONS=622} [2025-02-08 05:39:26,877 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 27 predicate places. [2025-02-08 05:39:26,877 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 622 transitions, 1838 flow [2025-02-08 05:39:26,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-02-08 05:39:26,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:26,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:26,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 05:39:26,878 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:26,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2143104555, now seen corresponding path program 1 times [2025-02-08 05:39:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629346963] [2025-02-08 05:39:26,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:26,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-08 05:39:26,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-08 05:39:26,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:26,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:39:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629346963] [2025-02-08 05:39:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629346963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:26,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:26,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:26,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054692706] [2025-02-08 05:39:26,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:26,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:26,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:26,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:26,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:26,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 652 [2025-02-08 05:39:26,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 622 transitions, 1838 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-02-08 05:39:26,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:26,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 652 [2025-02-08 05:39:26,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:28,479 INFO L124 PetriNetUnfolderBase]: 742/9682 cut-off events. [2025-02-08 05:39:28,479 INFO L125 PetriNetUnfolderBase]: For 1575/1595 co-relation queries the response was YES. [2025-02-08 05:39:28,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13320 conditions, 9682 events. 742/9682 cut-off events. For 1575/1595 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 97972 event pairs, 79 based on Foata normal form. 0/8959 useless extension candidates. Maximal degree in co-relation 13192. Up to 558 conditions per place. [2025-02-08 05:39:28,592 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 19 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2025-02-08 05:39:28,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 624 transitions, 1888 flow [2025-02-08 05:39:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1888 transitions. [2025-02-08 05:39:28,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652351738241309 [2025-02-08 05:39:28,593 INFO L175 Difference]: Start difference. First operand has 638 places, 622 transitions, 1838 flow. Second operand 3 states and 1888 transitions. [2025-02-08 05:39:28,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 624 transitions, 1888 flow [2025-02-08 05:39:28,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 624 transitions, 1876 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:28,610 INFO L231 Difference]: Finished difference. Result has 632 places, 620 transitions, 1832 flow [2025-02-08 05:39:28,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1832, PETRI_PLACES=632, PETRI_TRANSITIONS=620} [2025-02-08 05:39:28,611 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 21 predicate places. [2025-02-08 05:39:28,611 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 620 transitions, 1832 flow [2025-02-08 05:39:28,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-02-08 05:39:28,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:28,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:28,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 05:39:28,612 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1559562177, now seen corresponding path program 1 times [2025-02-08 05:39:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:28,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087094190] [2025-02-08 05:39:28,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:28,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-08 05:39:28,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-08 05:39:28,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:28,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:39:29,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087094190] [2025-02-08 05:39:29,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087094190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:29,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569545525] [2025-02-08 05:39:29,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:29,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:29,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:29,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 652 [2025-02-08 05:39:29,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 620 transitions, 1832 flow. Second operand has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-02-08 05:39:29,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 652 [2025-02-08 05:39:29,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:30,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1644] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][596], [778#true, Black: 896#true, 161#L90-16true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 251#L125true, Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 679#(= |#race~count1~0| 0), 902#(= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0)]) [2025-02-08 05:39:30,652 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-02-08 05:39:30,652 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2025-02-08 05:39:30,653 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-08 05:39:30,653 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-08 05:39:30,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1644] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][600], [778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 251#L125true, Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 679#(= |#race~count1~0| 0), 903#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 33#L90-15true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0)]) [2025-02-08 05:39:30,654 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-02-08 05:39:30,654 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:30,654 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:30,655 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-08 05:39:30,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1644] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][604], [778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 251#L125true, Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 679#(= |#race~count1~0| 0), 92#L90-14true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 904#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0)]) [2025-02-08 05:39:30,656 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-02-08 05:39:30,656 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:30,656 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:30,656 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2025-02-08 05:39:30,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1644] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][608], [778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 251#L125true, Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 498#L90-12true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0)]) [2025-02-08 05:39:30,658 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2025-02-08 05:39:30,658 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-02-08 05:39:30,658 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-02-08 05:39:30,658 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2025-02-08 05:39:30,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1644] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][608], [778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 251#L125true, Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 350#L90-13true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0)]) [2025-02-08 05:39:30,660 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2025-02-08 05:39:30,660 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:39:30,660 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2025-02-08 05:39:30,660 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:39:30,668 INFO L124 PetriNetUnfolderBase]: 644/6980 cut-off events. [2025-02-08 05:39:30,668 INFO L125 PetriNetUnfolderBase]: For 2234/2486 co-relation queries the response was YES. [2025-02-08 05:39:30,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10701 conditions, 6980 events. 644/6980 cut-off events. For 2234/2486 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 67711 event pairs, 87 based on Foata normal form. 39/6610 useless extension candidates. Maximal degree in co-relation 10572. Up to 444 conditions per place. [2025-02-08 05:39:30,779 INFO L140 encePairwiseOnDemand]: 644/652 looper letters, 42 selfloop transitions, 6 changer transitions 0/627 dead transitions. [2025-02-08 05:39:30,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 627 transitions, 1954 flow [2025-02-08 05:39:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2025-02-08 05:39:30,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939161554192229 [2025-02-08 05:39:30,782 INFO L175 Difference]: Start difference. First operand has 632 places, 620 transitions, 1832 flow. Second operand 6 states and 3674 transitions. [2025-02-08 05:39:30,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 627 transitions, 1954 flow [2025-02-08 05:39:30,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 627 transitions, 1954 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:30,804 INFO L231 Difference]: Finished difference. Result has 636 places, 619 transitions, 1851 flow [2025-02-08 05:39:30,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1828, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1851, PETRI_PLACES=636, PETRI_TRANSITIONS=619} [2025-02-08 05:39:30,805 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 25 predicate places. [2025-02-08 05:39:30,806 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 619 transitions, 1851 flow [2025-02-08 05:39:30,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-02-08 05:39:30,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:30,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 05:39:30,807 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:30,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1144376968, now seen corresponding path program 1 times [2025-02-08 05:39:30,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270244147] [2025-02-08 05:39:30,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-08 05:39:30,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-08 05:39:30,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:39:31,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270244147] [2025-02-08 05:39:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270244147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119225308] [2025-02-08 05:39:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:31,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:31,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 652 [2025-02-08 05:39:31,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 619 transitions, 1851 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-02-08 05:39:31,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 652 [2025-02-08 05:39:31,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:33,251 INFO L124 PetriNetUnfolderBase]: 785/11057 cut-off events. [2025-02-08 05:39:33,251 INFO L125 PetriNetUnfolderBase]: For 3035/3152 co-relation queries the response was YES. [2025-02-08 05:39:33,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16726 conditions, 11057 events. 785/11057 cut-off events. For 3035/3152 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 118842 event pairs, 72 based on Foata normal form. 17/10450 useless extension candidates. Maximal degree in co-relation 16595. Up to 417 conditions per place. [2025-02-08 05:39:33,423 INFO L140 encePairwiseOnDemand]: 644/652 looper letters, 42 selfloop transitions, 6 changer transitions 0/625 dead transitions. [2025-02-08 05:39:33,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 625 transitions, 1967 flow [2025-02-08 05:39:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2025-02-08 05:39:33,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939161554192229 [2025-02-08 05:39:33,425 INFO L175 Difference]: Start difference. First operand has 636 places, 619 transitions, 1851 flow. Second operand 6 states and 3674 transitions. [2025-02-08 05:39:33,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 625 transitions, 1967 flow [2025-02-08 05:39:33,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 625 transitions, 1954 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:33,454 INFO L231 Difference]: Finished difference. Result has 635 places, 617 transitions, 1846 flow [2025-02-08 05:39:33,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1846, PETRI_PLACES=635, PETRI_TRANSITIONS=617} [2025-02-08 05:39:33,455 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 24 predicate places. [2025-02-08 05:39:33,455 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 617 transitions, 1846 flow [2025-02-08 05:39:33,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-02-08 05:39:33,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:33,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:33,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 05:39:33,456 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:33,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:33,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1042276379, now seen corresponding path program 1 times [2025-02-08 05:39:33,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:33,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528543292] [2025-02-08 05:39:33,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:33,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-08 05:39:33,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-08 05:39:33,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:33,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:33,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:33,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528543292] [2025-02-08 05:39:33,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528543292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:33,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:33,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664349963] [2025-02-08 05:39:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:33,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:33,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:33,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:33,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:33,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 652 [2025-02-08 05:39:33,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 617 transitions, 1846 flow. Second operand has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 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-02-08 05:39:33,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:33,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 652 [2025-02-08 05:39:33,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:35,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1643] thread3EXIT-->L127-6: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][431], [778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 593#L127-6true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 913#true, Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), 898#(= |#race~get3~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 907#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0)]) [2025-02-08 05:39:35,174 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-08 05:39:35,174 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:35,174 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:35,174 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-08 05:39:35,188 INFO L124 PetriNetUnfolderBase]: 643/10323 cut-off events. [2025-02-08 05:39:35,188 INFO L125 PetriNetUnfolderBase]: For 2307/2341 co-relation queries the response was YES. [2025-02-08 05:39:35,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14949 conditions, 10323 events. 643/10323 cut-off events. For 2307/2341 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 106930 event pairs, 42 based on Foata normal form. 0/9769 useless extension candidates. Maximal degree in co-relation 14819. Up to 304 conditions per place. [2025-02-08 05:39:35,329 INFO L140 encePairwiseOnDemand]: 650/652 looper letters, 10 selfloop transitions, 1 changer transitions 0/616 dead transitions. [2025-02-08 05:39:35,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 616 transitions, 1866 flow [2025-02-08 05:39:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2025-02-08 05:39:35,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693251533742331 [2025-02-08 05:39:35,330 INFO L175 Difference]: Start difference. First operand has 635 places, 617 transitions, 1846 flow. Second operand 3 states and 1896 transitions. [2025-02-08 05:39:35,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 616 transitions, 1866 flow [2025-02-08 05:39:35,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 616 transitions, 1854 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:35,352 INFO L231 Difference]: Finished difference. Result has 631 places, 616 transitions, 1834 flow [2025-02-08 05:39:35,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1834, PETRI_PLACES=631, PETRI_TRANSITIONS=616} [2025-02-08 05:39:35,353 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 20 predicate places. [2025-02-08 05:39:35,353 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 616 transitions, 1834 flow [2025-02-08 05:39:35,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 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-02-08 05:39:35,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:35,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:35,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 05:39:35,353 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2063959331, now seen corresponding path program 1 times [2025-02-08 05:39:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603099526] [2025-02-08 05:39:35,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:35,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 05:39:35,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 05:39:35,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:35,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:39:35,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:35,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603099526] [2025-02-08 05:39:35,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603099526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:35,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:35,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:35,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258289473] [2025-02-08 05:39:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:35,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:35,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:35,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:35,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:36,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 652 [2025-02-08 05:39:36,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 616 transitions, 1834 flow. Second operand has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-02-08 05:39:36,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:36,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 652 [2025-02-08 05:39:36,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:37,434 INFO L124 PetriNetUnfolderBase]: 580/6752 cut-off events. [2025-02-08 05:39:37,434 INFO L125 PetriNetUnfolderBase]: For 2442/2660 co-relation queries the response was YES. [2025-02-08 05:39:37,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10390 conditions, 6752 events. 580/6752 cut-off events. For 2442/2660 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 64729 event pairs, 87 based on Foata normal form. 37/6466 useless extension candidates. Maximal degree in co-relation 10259. Up to 448 conditions per place. [2025-02-08 05:39:37,499 INFO L140 encePairwiseOnDemand]: 644/652 looper letters, 42 selfloop transitions, 6 changer transitions 0/622 dead transitions. [2025-02-08 05:39:37,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 622 transitions, 1950 flow [2025-02-08 05:39:37,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2025-02-08 05:39:37,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939161554192229 [2025-02-08 05:39:37,501 INFO L175 Difference]: Start difference. First operand has 631 places, 616 transitions, 1834 flow. Second operand 6 states and 3674 transitions. [2025-02-08 05:39:37,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 622 transitions, 1950 flow [2025-02-08 05:39:37,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 622 transitions, 1949 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:37,520 INFO L231 Difference]: Finished difference. Result has 633 places, 614 transitions, 1841 flow [2025-02-08 05:39:37,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1841, PETRI_PLACES=633, PETRI_TRANSITIONS=614} [2025-02-08 05:39:37,521 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 22 predicate places. [2025-02-08 05:39:37,521 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 614 transitions, 1841 flow [2025-02-08 05:39:37,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-02-08 05:39:37,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:37,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:37,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 05:39:37,522 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1969186289, now seen corresponding path program 1 times [2025-02-08 05:39:37,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:37,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710538656] [2025-02-08 05:39:37,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:37,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:37,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-08 05:39:37,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-08 05:39:37,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:37,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:37,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:37,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710538656] [2025-02-08 05:39:37,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710538656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:37,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:37,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:37,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323331165] [2025-02-08 05:39:37,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:37,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:37,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:37,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:37,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 652 [2025-02-08 05:39:37,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 614 transitions, 1841 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-02-08 05:39:37,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:37,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 652 [2025-02-08 05:39:37,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:39,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1643] thread3EXIT-->L127-6: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][431], [778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 593#L127-6true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, 916#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2025-02-08 05:39:39,219 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-08 05:39:39,219 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:39,220 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:39,220 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-08 05:39:39,238 INFO L124 PetriNetUnfolderBase]: 687/10501 cut-off events. [2025-02-08 05:39:39,238 INFO L125 PetriNetUnfolderBase]: For 2455/2521 co-relation queries the response was YES. [2025-02-08 05:39:39,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15536 conditions, 10501 events. 687/10501 cut-off events. For 2455/2521 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 109736 event pairs, 72 based on Foata normal form. 0/10015 useless extension candidates. Maximal degree in co-relation 15406. Up to 388 conditions per place. [2025-02-08 05:39:39,419 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 12 selfloop transitions, 1 changer transitions 0/612 dead transitions. [2025-02-08 05:39:39,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 612 transitions, 1863 flow [2025-02-08 05:39:39,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1890 transitions. [2025-02-08 05:39:39,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662576687116564 [2025-02-08 05:39:39,421 INFO L175 Difference]: Start difference. First operand has 633 places, 614 transitions, 1841 flow. Second operand 3 states and 1890 transitions. [2025-02-08 05:39:39,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 612 transitions, 1863 flow [2025-02-08 05:39:39,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 612 transitions, 1851 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:39,450 INFO L231 Difference]: Finished difference. Result has 628 places, 612 transitions, 1827 flow [2025-02-08 05:39:39,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1827, PETRI_PLACES=628, PETRI_TRANSITIONS=612} [2025-02-08 05:39:39,451 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 17 predicate places. [2025-02-08 05:39:39,451 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 612 transitions, 1827 flow [2025-02-08 05:39:39,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-02-08 05:39:39,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:39,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 05:39:39,451 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1967797534, now seen corresponding path program 1 times [2025-02-08 05:39:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428024778] [2025-02-08 05:39:39,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:39,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-08 05:39:39,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-08 05:39:39,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:39,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:39,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:39,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428024778] [2025-02-08 05:39:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428024778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:39,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:39,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099526046] [2025-02-08 05:39:39,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:39,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:39,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:39,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:39,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 652 [2025-02-08 05:39:39,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 612 transitions, 1827 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-02-08 05:39:39,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:39,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 652 [2025-02-08 05:39:39,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:40,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1580] L97-2-->L97: Formula: (= |v_#race~res3~0_6| |v_thread3Thread1of1ForFork0_#t~nondet26_3|) InVars {thread3Thread1of1ForFork0_#t~nondet26=|v_thread3Thread1of1ForFork0_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork0_#t~nondet26=|v_thread3Thread1of1ForFork0_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][392], [778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 251#L125true, Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 473#L97true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, 827#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2025-02-08 05:39:40,594 INFO L294 olderBase$Statistics]: this new event has 390 ancestors and is cut-off event [2025-02-08 05:39:40,594 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:40,594 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:40,594 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:40,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1643] thread3EXIT-->L127-6: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][476], [778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 593#L127-6true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2025-02-08 05:39:40,602 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-08 05:39:40,602 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-08 05:39:40,602 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:40,602 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:40,604 INFO L124 PetriNetUnfolderBase]: 438/5952 cut-off events. [2025-02-08 05:39:40,604 INFO L125 PetriNetUnfolderBase]: For 1267/1327 co-relation queries the response was YES. [2025-02-08 05:39:40,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8742 conditions, 5952 events. 438/5952 cut-off events. For 1267/1327 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 54897 event pairs, 87 based on Foata normal form. 15/5678 useless extension candidates. Maximal degree in co-relation 8612. Up to 364 conditions per place. [2025-02-08 05:39:40,690 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 8 selfloop transitions, 0 changer transitions 28/610 dead transitions. [2025-02-08 05:39:40,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 610 transitions, 1847 flow [2025-02-08 05:39:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2025-02-08 05:39:40,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657464212678937 [2025-02-08 05:39:40,692 INFO L175 Difference]: Start difference. First operand has 628 places, 612 transitions, 1827 flow. Second operand 3 states and 1889 transitions. [2025-02-08 05:39:40,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 610 transitions, 1847 flow [2025-02-08 05:39:40,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 610 transitions, 1846 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:40,709 INFO L231 Difference]: Finished difference. Result has 627 places, 582 transitions, 1677 flow [2025-02-08 05:39:40,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=627, PETRI_TRANSITIONS=582} [2025-02-08 05:39:40,710 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, 16 predicate places. [2025-02-08 05:39:40,710 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 582 transitions, 1677 flow [2025-02-08 05:39:40,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-02-08 05:39:40,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:40,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:40,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 05:39:40,711 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:40,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:40,713 INFO L85 PathProgramCache]: Analyzing trace with hash 423327855, now seen corresponding path program 1 times [2025-02-08 05:39:40,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:40,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215966755] [2025-02-08 05:39:40,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:40,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:40,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-08 05:39:40,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-08 05:39:40,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:40,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 05:39:40,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:40,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215966755] [2025-02-08 05:39:40,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215966755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:40,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:40,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:40,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532353089] [2025-02-08 05:39:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:40,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:40,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:40,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:40,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:40,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 652 [2025-02-08 05:39:40,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 582 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-02-08 05:39:40,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:40,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 652 [2025-02-08 05:39:40,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,319 INFO L124 PetriNetUnfolderBase]: 590/9291 cut-off events. [2025-02-08 05:39:42,319 INFO L125 PetriNetUnfolderBase]: For 1717/1743 co-relation queries the response was YES. [2025-02-08 05:39:42,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13185 conditions, 9291 events. 590/9291 cut-off events. For 1717/1743 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 93149 event pairs, 42 based on Foata normal form. 0/8884 useless extension candidates. Maximal degree in co-relation 13144. Up to 261 conditions per place. [2025-02-08 05:39:42,456 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 11 selfloop transitions, 2 changer transitions 15/583 dead transitions. [2025-02-08 05:39:42,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 583 transitions, 1707 flow [2025-02-08 05:39:42,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2025-02-08 05:39:42,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967280163599182 [2025-02-08 05:39:42,458 INFO L175 Difference]: Start difference. First operand has 627 places, 582 transitions, 1677 flow. Second operand 3 states and 1892 transitions. [2025-02-08 05:39:42,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 583 transitions, 1707 flow [2025-02-08 05:39:42,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 583 transitions, 1693 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:42,479 INFO L231 Difference]: Finished difference. Result has 607 places, 566 transitions, 1555 flow [2025-02-08 05:39:42,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1555, PETRI_PLACES=607, PETRI_TRANSITIONS=566} [2025-02-08 05:39:42,480 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -4 predicate places. [2025-02-08 05:39:42,480 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 566 transitions, 1555 flow [2025-02-08 05:39:42,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-02-08 05:39:42,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:42,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 05:39:42,480 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:42,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1853528122, now seen corresponding path program 1 times [2025-02-08 05:39:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138919903] [2025-02-08 05:39:42,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-08 05:39:42,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:39:42,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:39:42,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138919903] [2025-02-08 05:39:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138919903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200622683] [2025-02-08 05:39:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 652 [2025-02-08 05:39:42,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 566 transitions, 1555 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-02-08 05:39:42,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 652 [2025-02-08 05:39:42,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:43,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1363] L50-13-->L50-11: Formula: (= |v_#race~get2~0_6| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_6|} AuxVars[] AssignedVars[#race~get2~0][492], [931#true, 778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 147#L90-19true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 442#L70-19true, 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 529#L50-11true, 362#L122-1true, 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), 928#true, Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0)]) [2025-02-08 05:39:43,759 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-02-08 05:39:43,759 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-08 05:39:43,759 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-08 05:39:43,759 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:43,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1644] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][371], [931#true, 778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 251#L125true, Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 147#L90-19true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), 928#true, Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0)]) [2025-02-08 05:39:43,777 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2025-02-08 05:39:43,777 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-02-08 05:39:43,777 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-02-08 05:39:43,778 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2025-02-08 05:39:43,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1467] L77-2-->L77: Formula: (= |v_#race~res2~0_3| |v_thread2Thread1of1ForFork1_#t~nondet17_3|) InVars {thread2Thread1of1ForFork1_#t~nondet17=|v_thread2Thread1of1ForFork1_#t~nondet17_3|} OutVars{#race~res2~0=|v_#race~res2~0_3|, thread2Thread1of1ForFork1_#t~nondet17=|v_thread2Thread1of1ForFork1_#t~nondet17_3|} AuxVars[] AssignedVars[#race~res2~0][349], [931#true, 778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 81#L77true, 679#(= |#race~count1~0| 0), 147#L90-19true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 568#L124true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), 928#true, Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0)]) [2025-02-08 05:39:43,779 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2025-02-08 05:39:43,779 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:43,779 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-02-08 05:39:43,779 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:43,779 INFO L124 PetriNetUnfolderBase]: 527/7901 cut-off events. [2025-02-08 05:39:43,779 INFO L125 PetriNetUnfolderBase]: For 1210/1269 co-relation queries the response was YES. [2025-02-08 05:39:43,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11066 conditions, 7901 events. 527/7901 cut-off events. For 1210/1269 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 76567 event pairs, 61 based on Foata normal form. 0/7573 useless extension candidates. Maximal degree in co-relation 11024. Up to 233 conditions per place. [2025-02-08 05:39:43,892 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 11 selfloop transitions, 2 changer transitions 14/567 dead transitions. [2025-02-08 05:39:43,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 567 transitions, 1585 flow [2025-02-08 05:39:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2025-02-08 05:39:43,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657464212678937 [2025-02-08 05:39:43,893 INFO L175 Difference]: Start difference. First operand has 607 places, 566 transitions, 1555 flow. Second operand 3 states and 1889 transitions. [2025-02-08 05:39:43,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 567 transitions, 1585 flow [2025-02-08 05:39:43,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 567 transitions, 1525 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-02-08 05:39:43,917 INFO L231 Difference]: Finished difference. Result has 586 places, 551 transitions, 1405 flow [2025-02-08 05:39:43,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1405, PETRI_PLACES=586, PETRI_TRANSITIONS=551} [2025-02-08 05:39:43,918 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -25 predicate places. [2025-02-08 05:39:43,918 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 551 transitions, 1405 flow [2025-02-08 05:39:43,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-02-08 05:39:43,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:43,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:43,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-08 05:39:43,919 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2025-02-08 05:39:43,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:43,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1660398796, now seen corresponding path program 1 times [2025-02-08 05:39:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:43,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402786305] [2025-02-08 05:39:43,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:43,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:43,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-08 05:39:43,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-08 05:39:43,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:43,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:39:43,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402786305] [2025-02-08 05:39:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402786305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:43,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:43,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501090042] [2025-02-08 05:39:43,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:43,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:43,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:43,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:43,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 652 [2025-02-08 05:39:44,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 551 transitions, 1405 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-02-08 05:39:44,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 652 [2025-02-08 05:39:44,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1644] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][386], [931#true, 778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 251#L125true, Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 683#(= |#race~count2~0| 0), 473#L97true, 679#(= |#race~count1~0| 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 934#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 750#(= |#race~get2~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true]) [2025-02-08 05:39:44,543 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is not cut-off event [2025-02-08 05:39:44,543 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is not cut-off event [2025-02-08 05:39:44,543 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2025-02-08 05:39:44,543 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2025-02-08 05:39:44,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1580] L97-2-->L97: Formula: (= |v_#race~res3~0_6| |v_thread3Thread1of1ForFork0_#t~nondet26_3|) InVars {thread3Thread1of1ForFork0_#t~nondet26=|v_thread3Thread1of1ForFork0_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork0_#t~nondet26=|v_thread3Thread1of1ForFork0_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][391], [931#true, 778#true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 251#L125true, Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 473#L97true, 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 737#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 797#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 934#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(<= ~n2~0 0), 898#(= |#race~get3~0| 0), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 823#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 750#(= |#race~get2~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true]) [2025-02-08 05:39:44,545 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2025-02-08 05:39:44,545 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:44,545 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:44,545 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:44,545 INFO L124 PetriNetUnfolderBase]: 276/3453 cut-off events. [2025-02-08 05:39:44,546 INFO L125 PetriNetUnfolderBase]: For 251/305 co-relation queries the response was YES. [2025-02-08 05:39:44,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 3453 events. 276/3453 cut-off events. For 251/305 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 26936 event pairs, 54 based on Foata normal form. 2/3304 useless extension candidates. Maximal degree in co-relation 4607. Up to 190 conditions per place. [2025-02-08 05:39:44,584 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 0 selfloop transitions, 0 changer transitions 552/552 dead transitions. [2025-02-08 05:39:44,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 552 transitions, 1435 flow [2025-02-08 05:39:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2025-02-08 05:39:44,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657464212678937 [2025-02-08 05:39:44,586 INFO L175 Difference]: Start difference. First operand has 586 places, 551 transitions, 1405 flow. Second operand 3 states and 1889 transitions. [2025-02-08 05:39:44,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 552 transitions, 1435 flow [2025-02-08 05:39:44,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 552 transitions, 1381 flow, removed 12 selfloop flow, removed 15 redundant places. [2025-02-08 05:39:44,594 INFO L231 Difference]: Finished difference. Result has 565 places, 0 transitions, 0 flow [2025-02-08 05:39:44,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=565, PETRI_TRANSITIONS=0} [2025-02-08 05:39:44,595 INFO L279 CegarLoopForPetriNet]: 611 programPoint places, -46 predicate places. [2025-02-08 05:39:44,595 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 0 transitions, 0 flow [2025-02-08 05:39:44,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-02-08 05:39:44,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (136 of 137 remaining) [2025-02-08 05:39:44,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (135 of 137 remaining) [2025-02-08 05:39:44,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (134 of 137 remaining) [2025-02-08 05:39:44,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (133 of 137 remaining) [2025-02-08 05:39:44,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (132 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (131 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (130 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (129 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (128 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (127 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (126 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (125 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (124 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (123 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (122 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (121 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (120 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (119 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (118 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (117 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (116 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (115 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (114 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (112 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (111 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (110 of 137 remaining) [2025-02-08 05:39:44,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (109 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (108 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (107 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (106 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (105 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (104 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (103 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (102 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (101 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (100 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (99 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (98 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (97 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (96 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (95 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (94 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (93 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (92 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (90 of 137 remaining) [2025-02-08 05:39:44,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (89 of 137 remaining) [2025-02-08 05:39:44,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (88 of 137 remaining) [2025-02-08 05:39:44,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (87 of 137 remaining) [2025-02-08 05:39:44,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (86 of 137 remaining) [2025-02-08 05:39:44,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (85 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (84 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (83 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (82 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (81 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (80 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (79 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (78 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (77 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (75 of 137 remaining) [2025-02-08 05:39:44,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (73 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (72 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (71 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (70 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (69 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (68 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (66 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 137 remaining) [2025-02-08 05:39:44,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (64 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (63 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (62 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (61 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (60 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (56 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (55 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (53 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (52 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (50 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (48 of 137 remaining) [2025-02-08 05:39:44,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (47 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (46 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (45 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (44 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (43 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (40 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (37 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (36 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (34 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (32 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (28 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (26 of 137 remaining) [2025-02-08 05:39:44,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 137 remaining) [2025-02-08 05:39:44,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 137 remaining) [2025-02-08 05:39:44,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 137 remaining) [2025-02-08 05:39:44,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 137 remaining) [2025-02-08 05:39:44,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 137 remaining) [2025-02-08 05:39:44,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 137 remaining) [2025-02-08 05:39:44,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 137 remaining) [2025-02-08 05:39:44,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 137 remaining) [2025-02-08 05:39:44,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 137 remaining) [2025-02-08 05:39:44,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (15 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (14 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (10 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (9 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 137 remaining) [2025-02-08 05:39:44,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 137 remaining) [2025-02-08 05:39:44,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 137 remaining) [2025-02-08 05:39:44,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 137 remaining) [2025-02-08 05:39:44,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 137 remaining) [2025-02-08 05:39:44,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 137 remaining) [2025-02-08 05:39:44,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-08 05:39:44,609 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:44,615 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:44,615 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:44,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:44 BasicIcfg [2025-02-08 05:39:44,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:44,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:44,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:44,621 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:44,625 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:43" (3/4) ... [2025-02-08 05:39:44,626 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:44,630 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:44,631 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:44,631 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:39:44,637 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-08 05:39:44,637 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:44,638 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:44,638 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:44,731 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:44,731 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:44,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:44,732 INFO L158 Benchmark]: Toolchain (without parser) took 62839.38ms. Allocated memory was 167.8MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 100.4MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-02-08 05:39:44,733 INFO L158 Benchmark]: CDTParser took 1.15ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:44,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.56ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 85.9MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:44,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.69ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 83.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:44,734 INFO L158 Benchmark]: Boogie Preprocessor took 56.65ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 80.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:44,735 INFO L158 Benchmark]: IcfgBuilder took 1080.77ms. Allocated memory is still 167.8MB. Free memory was 80.9MB in the beginning and 119.8MB in the end (delta: -38.9MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2025-02-08 05:39:44,735 INFO L158 Benchmark]: TraceAbstraction took 61196.33ms. Allocated memory was 167.8MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 119.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-02-08 05:39:44,735 INFO L158 Benchmark]: Witness Printer took 110.97ms. Allocated memory is still 4.6GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:44,736 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.56ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 85.9MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.69ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 83.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.65ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 80.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1080.77ms. Allocated memory is still 167.8MB. Free memory was 80.9MB in the beginning and 119.8MB in the end (delta: -38.9MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * TraceAbstraction took 61196.33ms. Allocated memory was 167.8MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 119.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 110.97ms. Allocated memory is still 4.6GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 950 locations, 137 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 60.9s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 53.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7053 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4437 mSDsluCounter, 6763 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6336 mSDsCounter, 1363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10355 IncrementalHoareTripleChecker+Invalid, 11718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1363 mSolverCounterUnsat, 427 mSDtfsCounter, 10355 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1851occurred in iteration=38, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 8464 NumberOfCodeBlocks, 8464 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 8418 ConstructedInterpolants, 0 QuantifiedInterpolants, 10508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 77 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:44,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE