./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.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-trans.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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:39,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:39,903 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:39,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:39,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:39,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:39,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:39,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:39,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:39,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:39,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:39,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:39,929 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:39,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:39,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:39,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:39,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:39,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:39,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:39,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:39,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:39,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:39,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:39,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:39,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:39,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:39,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:39,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:39,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:39,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:39,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:39,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:39,932 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-02-08 05:38:40,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:40,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:40,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:40,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:40,171 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:40,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-02-08 05:38:41,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ac0e2ea5/27d3c9e824834514843b79e54d4fc0d1/FLAG4984d870a [2025-02-08 05:38:41,514 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:41,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-02-08 05:38:41,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ac0e2ea5/27d3c9e824834514843b79e54d4fc0d1/FLAG4984d870a [2025-02-08 05:38:41,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ac0e2ea5/27d3c9e824834514843b79e54d4fc0d1 [2025-02-08 05:38:41,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:41,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:41,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:41,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:41,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:41,543 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,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7432cf5e 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,544 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,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:41,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:41,735 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:41,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:41,792 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:41,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:41 WrapperNode [2025-02-08 05:38:41,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:41,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:41,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:41,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:41,797 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:41" (1/1) ... [2025-02-08 05:38:41,808 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:41" (1/1) ... [2025-02-08 05:38:41,824 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 235 [2025-02-08 05:38:41,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:41,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:41,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:41,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:41,830 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:41" (1/1) ... [2025-02-08 05:38:41,830 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:41" (1/1) ... [2025-02-08 05:38:41,837 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:41" (1/1) ... [2025-02-08 05:38:41,838 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:41" (1/1) ... [2025-02-08 05:38:41,858 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:41" (1/1) ... [2025-02-08 05:38:41,860 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:41" (1/1) ... [2025-02-08 05:38:41,863 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:41" (1/1) ... [2025-02-08 05:38:41,864 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:41" (1/1) ... [2025-02-08 05:38:41,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:41,867 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:41,867 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:41,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:41,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:41" (1/1) ... [2025-02-08 05:38:41,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:41,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:41,900 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:41,902 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:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:41,921 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:41,921 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:38:41,921 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:38:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:38:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:38:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:41,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:38:41,923 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,023 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:42,025 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:42,736 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:42,736 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:42,766 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:42,766 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:42,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:42 BoogieIcfgContainer [2025-02-08 05:38:42,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:42,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:42,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:42,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:42,772 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:42,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcdff9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:42, skipping insertion in model container [2025-02-08 05:38:42,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:41" (2/3) ... [2025-02-08 05:38:42,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcdff9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:42, skipping insertion in model container [2025-02-08 05:38:42,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:42" (3/3) ... [2025-02-08 05:38:42,775 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-02-08 05:38:42,785 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:42,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 614 locations, 1 initial locations, 6 loop locations, and 75 error locations. [2025-02-08 05:38:42,787 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:42,939 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:38:42,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 623 places, 643 transitions, 1307 flow [2025-02-08 05:38:43,179 INFO L124 PetriNetUnfolderBase]: 30/640 cut-off events. [2025-02-08 05:38:43,181 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:43,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 640 events. 30/640 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1784 event pairs, 0 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 490. Up to 3 conditions per place. [2025-02-08 05:38:43,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 623 places, 643 transitions, 1307 flow [2025-02-08 05:38:43,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 601 places, 619 transitions, 1256 flow [2025-02-08 05:38:43,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:43,226 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;@62d206e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:43,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2025-02-08 05:38:43,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:43,230 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-02-08 05:38:43,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:43,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:43,231 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:43,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2039645589, now seen corresponding path program 1 times [2025-02-08 05:38:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179122025] [2025-02-08 05:38:43,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:43,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:38:43,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:38:43,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:43,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:43,387 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:43,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:43,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179122025] [2025-02-08 05:38:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179122025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:43,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:43,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420083953] [2025-02-08 05:38:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:43,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:43,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:43,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:43,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-08 05:38:43,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 619 transitions, 1256 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:43,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:43,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-08 05:38:43,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:43,699 INFO L124 PetriNetUnfolderBase]: 51/1065 cut-off events. [2025-02-08 05:38:43,699 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:38:43,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 1065 events. 51/1065 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5320 event pairs, 12 based on Foata normal form. 27/895 useless extension candidates. Maximal degree in co-relation 832. Up to 38 conditions per place. [2025-02-08 05:38:43,720 INFO L140 encePairwiseOnDemand]: 631/643 looper letters, 13 selfloop transitions, 2 changer transitions 6/609 dead transitions. [2025-02-08 05:38:43,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 609 transitions, 1266 flow [2025-02-08 05:38:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-08 05:38:43,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-08 05:38:43,743 INFO L175 Difference]: Start difference. First operand has 601 places, 619 transitions, 1256 flow. Second operand 3 states and 1870 transitions. [2025-02-08 05:38:43,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 609 transitions, 1266 flow [2025-02-08 05:38:43,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:38:43,767 INFO L231 Difference]: Finished difference. Result has 596 places, 603 transitions, 1216 flow [2025-02-08 05:38:43,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=594, 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=1216, PETRI_PLACES=596, PETRI_TRANSITIONS=603} [2025-02-08 05:38:43,772 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -5 predicate places. [2025-02-08 05:38:43,773 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 603 transitions, 1216 flow [2025-02-08 05:38:43,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:43,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:43,776 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:43,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:43,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1505245196, now seen corresponding path program 1 times [2025-02-08 05:38:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086204854] [2025-02-08 05:38:43,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:43,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:43,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:38:43,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:38:43,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:43,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:43,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086204854] [2025-02-08 05:38:43,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086204854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:43,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648385421] [2025-02-08 05:38:43,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:43,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:43,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:43,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:43,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-08 05:38:43,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 603 transitions, 1216 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:43,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:43,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-08 05:38:43,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:44,157 INFO L124 PetriNetUnfolderBase]: 79/1490 cut-off events. [2025-02-08 05:38:44,157 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:38:44,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1490 events. 79/1490 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9172 event pairs, 20 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 1522. Up to 50 conditions per place. [2025-02-08 05:38:44,180 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2025-02-08 05:38:44,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 602 transitions, 1244 flow [2025-02-08 05:38:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-08 05:38:44,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-08 05:38:44,184 INFO L175 Difference]: Start difference. First operand has 596 places, 603 transitions, 1216 flow. Second operand 3 states and 1861 transitions. [2025-02-08 05:38:44,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 602 transitions, 1244 flow [2025-02-08 05:38:44,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 602 transitions, 1240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:44,193 INFO L231 Difference]: Finished difference. Result has 589 places, 602 transitions, 1214 flow [2025-02-08 05:38:44,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1214, PETRI_PLACES=589, PETRI_TRANSITIONS=602} [2025-02-08 05:38:44,195 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -12 predicate places. [2025-02-08 05:38:44,195 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 602 transitions, 1214 flow [2025-02-08 05:38:44,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,196 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:44,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:44,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:44,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,197 INFO L85 PathProgramCache]: Analyzing trace with hash 636226929, now seen corresponding path program 1 times [2025-02-08 05:38:44,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672975078] [2025-02-08 05:38:44,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:38:44,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:38:44,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,246 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,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672975078] [2025-02-08 05:38:44,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672975078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482323894] [2025-02-08 05:38:44,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-08 05:38:44,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 602 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-08 05:38:44,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:44,473 INFO L124 PetriNetUnfolderBase]: 79/1477 cut-off events. [2025-02-08 05:38:44,473 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-02-08 05:38:44,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1477 events. 79/1477 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8401 event pairs, 20 based on Foata normal form. 0/1199 useless extension candidates. Maximal degree in co-relation 1493. Up to 50 conditions per place. [2025-02-08 05:38:44,492 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2025-02-08 05:38:44,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 601 transitions, 1242 flow [2025-02-08 05:38:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-08 05:38:44,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-08 05:38:44,495 INFO L175 Difference]: Start difference. First operand has 589 places, 602 transitions, 1214 flow. Second operand 3 states and 1861 transitions. [2025-02-08 05:38:44,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 601 transitions, 1242 flow [2025-02-08 05:38:44,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 601 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:44,501 INFO L231 Difference]: Finished difference. Result has 588 places, 601 transitions, 1212 flow [2025-02-08 05:38:44,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1212, PETRI_PLACES=588, PETRI_TRANSITIONS=601} [2025-02-08 05:38:44,503 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -13 predicate places. [2025-02-08 05:38:44,503 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 601 transitions, 1212 flow [2025-02-08 05:38:44,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,504 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:44,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:44,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:44,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash 568443167, now seen corresponding path program 1 times [2025-02-08 05:38:44,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524307961] [2025-02-08 05:38:44,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:38:44,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:38:44,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,558 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,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524307961] [2025-02-08 05:38:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524307961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398474020] [2025-02-08 05:38:44,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-02-08 05:38:44,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 601 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-02-08 05:38:44,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:44,721 INFO L124 PetriNetUnfolderBase]: 51/1082 cut-off events. [2025-02-08 05:38:44,721 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-02-08 05:38:44,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 1082 events. 51/1082 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5471 event pairs, 12 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1081. Up to 39 conditions per place. [2025-02-08 05:38:44,735 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 14 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2025-02-08 05:38:44,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 600 transitions, 1242 flow [2025-02-08 05:38:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2025-02-08 05:38:44,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637117677553136 [2025-02-08 05:38:44,738 INFO L175 Difference]: Start difference. First operand has 588 places, 601 transitions, 1212 flow. Second operand 3 states and 1859 transitions. [2025-02-08 05:38:44,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 600 transitions, 1242 flow [2025-02-08 05:38:44,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 600 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:44,745 INFO L231 Difference]: Finished difference. Result has 587 places, 600 transitions, 1210 flow [2025-02-08 05:38:44,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=585, 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=1210, PETRI_PLACES=587, PETRI_TRANSITIONS=600} [2025-02-08 05:38:44,746 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -14 predicate places. [2025-02-08 05:38:44,746 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 600 transitions, 1210 flow [2025-02-08 05:38:44,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,747 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:44,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:44,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:44,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash 951196896, now seen corresponding path program 1 times [2025-02-08 05:38:44,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112335569] [2025-02-08 05:38:44,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:38:44,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:38:44,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,796 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,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112335569] [2025-02-08 05:38:44,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112335569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233687861] [2025-02-08 05:38:44,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-02-08 05:38:44,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 600 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-02-08 05:38:44,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,039 INFO L124 PetriNetUnfolderBase]: 89/1777 cut-off events. [2025-02-08 05:38:45,040 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-02-08 05:38:45,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 1777 events. 89/1777 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11617 event pairs, 20 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1786. Up to 51 conditions per place. [2025-02-08 05:38:45,060 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 14 selfloop transitions, 2 changer transitions 0/599 dead transitions. [2025-02-08 05:38:45,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 599 transitions, 1240 flow [2025-02-08 05:38:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2025-02-08 05:38:45,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637117677553136 [2025-02-08 05:38:45,063 INFO L175 Difference]: Start difference. First operand has 587 places, 600 transitions, 1210 flow. Second operand 3 states and 1859 transitions. [2025-02-08 05:38:45,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 599 transitions, 1240 flow [2025-02-08 05:38:45,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 599 transitions, 1236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,071 INFO L231 Difference]: Finished difference. Result has 586 places, 599 transitions, 1208 flow [2025-02-08 05:38:45,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1208, PETRI_PLACES=586, PETRI_TRANSITIONS=599} [2025-02-08 05:38:45,074 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -15 predicate places. [2025-02-08 05:38:45,074 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 599 transitions, 1208 flow [2025-02-08 05:38:45,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,075 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:45,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:45,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:45,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash -94911294, now seen corresponding path program 1 times [2025-02-08 05:38:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813890299] [2025-02-08 05:38:45,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:38:45,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:38:45,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,136 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,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813890299] [2025-02-08 05:38:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813890299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263164719] [2025-02-08 05:38:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-02-08 05:38:45,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 599 transitions, 1208 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-02-08 05:38:45,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,265 INFO L124 PetriNetUnfolderBase]: 49/858 cut-off events. [2025-02-08 05:38:45,265 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-08 05:38:45,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 858 events. 49/858 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3819 event pairs, 20 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 851. Up to 51 conditions per place. [2025-02-08 05:38:45,276 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 14 selfloop transitions, 2 changer transitions 0/598 dead transitions. [2025-02-08 05:38:45,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 598 transitions, 1238 flow [2025-02-08 05:38:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2025-02-08 05:38:45,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637117677553136 [2025-02-08 05:38:45,279 INFO L175 Difference]: Start difference. First operand has 586 places, 599 transitions, 1208 flow. Second operand 3 states and 1859 transitions. [2025-02-08 05:38:45,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 598 transitions, 1238 flow [2025-02-08 05:38:45,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 598 transitions, 1234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,285 INFO L231 Difference]: Finished difference. Result has 585 places, 598 transitions, 1206 flow [2025-02-08 05:38:45,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1206, PETRI_PLACES=585, PETRI_TRANSITIONS=598} [2025-02-08 05:38:45,286 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -16 predicate places. [2025-02-08 05:38:45,286 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 598 transitions, 1206 flow [2025-02-08 05:38:45,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,287 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:45,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:45,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:45,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash -850512051, now seen corresponding path program 1 times [2025-02-08 05:38:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618352585] [2025-02-08 05:38:45,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:38:45,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:38:45,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,314 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,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618352585] [2025-02-08 05:38:45,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618352585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378222342] [2025-02-08 05:38:45,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 643 [2025-02-08 05:38:45,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 598 transitions, 1206 flow. Second operand has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 643 [2025-02-08 05:38:45,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,504 INFO L124 PetriNetUnfolderBase]: 93/1474 cut-off events. [2025-02-08 05:38:45,504 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2025-02-08 05:38:45,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 1474 events. 93/1474 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8965 event pairs, 32 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 1505. Up to 91 conditions per place. [2025-02-08 05:38:45,526 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 16 selfloop transitions, 1 changer transitions 0/593 dead transitions. [2025-02-08 05:38:45,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 593 transitions, 1230 flow [2025-02-08 05:38:45,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-02-08 05:38:45,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.960082944530845 [2025-02-08 05:38:45,529 INFO L175 Difference]: Start difference. First operand has 585 places, 598 transitions, 1206 flow. Second operand 3 states and 1852 transitions. [2025-02-08 05:38:45,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 593 transitions, 1230 flow [2025-02-08 05:38:45,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 593 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,535 INFO L231 Difference]: Finished difference. Result has 580 places, 593 transitions, 1194 flow [2025-02-08 05:38:45,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=580, PETRI_TRANSITIONS=593} [2025-02-08 05:38:45,537 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2025-02-08 05:38:45,537 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 593 transitions, 1194 flow [2025-02-08 05:38:45,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,538 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:45,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:45,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:45,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash 345843218, now seen corresponding path program 1 times [2025-02-08 05:38:45,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739469553] [2025-02-08 05:38:45,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:38:45,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:38:45,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:45,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739469553] [2025-02-08 05:38:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739469553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700851809] [2025-02-08 05:38:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-08 05:38:45,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 593 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-08 05:38:45,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,760 INFO L124 PetriNetUnfolderBase]: 51/1070 cut-off events. [2025-02-08 05:38:45,760 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:38:45,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 1070 events. 51/1070 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5123 event pairs, 12 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 1043. Up to 38 conditions per place. [2025-02-08 05:38:45,772 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2025-02-08 05:38:45,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 592 transitions, 1222 flow [2025-02-08 05:38:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-08 05:38:45,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-08 05:38:45,775 INFO L175 Difference]: Start difference. First operand has 580 places, 593 transitions, 1194 flow. Second operand 3 states and 1861 transitions. [2025-02-08 05:38:45,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 592 transitions, 1222 flow [2025-02-08 05:38:45,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 592 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:45,782 INFO L231 Difference]: Finished difference. Result has 580 places, 592 transitions, 1195 flow [2025-02-08 05:38:45,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1195, PETRI_PLACES=580, PETRI_TRANSITIONS=592} [2025-02-08 05:38:45,785 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2025-02-08 05:38:45,785 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 592 transitions, 1195 flow [2025-02-08 05:38:45,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,786 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:45,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:45,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:45,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 363359929, now seen corresponding path program 1 times [2025-02-08 05:38:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143477983] [2025-02-08 05:38:45,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:38:45,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:38:45,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,274 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,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143477983] [2025-02-08 05:38:46,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143477983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608344368] [2025-02-08 05:38:46,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:46,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:46,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 643 [2025-02-08 05:38:46,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 592 transitions, 1195 flow. Second operand has 6 states, 6 states have (on average 537.5) internal successors, (3225), 6 states have internal predecessors, (3225), 0 states have call successors, (0), 0 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,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 643 [2025-02-08 05:38:46,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:52,455 INFO L124 PetriNetUnfolderBase]: 12846/49114 cut-off events. [2025-02-08 05:38:52,455 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2025-02-08 05:38:52,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66597 conditions, 49114 events. 12846/49114 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 645444 event pairs, 10080 based on Foata normal form. 0/40933 useless extension candidates. Maximal degree in co-relation 66521. Up to 17156 conditions per place. [2025-02-08 05:38:52,783 INFO L140 encePairwiseOnDemand]: 625/643 looper letters, 78 selfloop transitions, 15 changer transitions 0/589 dead transitions. [2025-02-08 05:38:52,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 589 transitions, 1375 flow [2025-02-08 05:38:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3312 transitions. [2025-02-08 05:38:52,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8584758942457231 [2025-02-08 05:38:52,789 INFO L175 Difference]: Start difference. First operand has 580 places, 592 transitions, 1195 flow. Second operand 6 states and 3312 transitions. [2025-02-08 05:38:52,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 589 transitions, 1375 flow [2025-02-08 05:38:52,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 589 transitions, 1371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:52,795 INFO L231 Difference]: Finished difference. Result has 580 places, 589 transitions, 1215 flow [2025-02-08 05:38:52,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1215, PETRI_PLACES=580, PETRI_TRANSITIONS=589} [2025-02-08 05:38:52,796 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2025-02-08 05:38:52,797 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 589 transitions, 1215 flow [2025-02-08 05:38:52,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 537.5) internal successors, (3225), 6 states have internal predecessors, (3225), 0 states have call successors, (0), 0 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:52,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:52,798 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:52,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:52,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:52,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1733748921, now seen corresponding path program 1 times [2025-02-08 05:38:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993972933] [2025-02-08 05:38:52,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:52,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:38:52,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:38:52,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:52,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:52,844 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:52,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993972933] [2025-02-08 05:38:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993972933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:52,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:52,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945691705] [2025-02-08 05:38:52,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:52,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:52,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:52,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:52,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 643 [2025-02-08 05:38:52,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 589 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:52,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:52,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 643 [2025-02-08 05:38:52,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:53,142 INFO L124 PetriNetUnfolderBase]: 184/2390 cut-off events. [2025-02-08 05:38:53,142 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2025-02-08 05:38:53,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 2390 events. 184/2390 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18745 event pairs, 64 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 2557. Up to 164 conditions per place. [2025-02-08 05:38:53,177 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 16 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2025-02-08 05:38:53,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 584 transitions, 1239 flow [2025-02-08 05:38:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-02-08 05:38:53,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.960082944530845 [2025-02-08 05:38:53,181 INFO L175 Difference]: Start difference. First operand has 580 places, 589 transitions, 1215 flow. Second operand 3 states and 1852 transitions. [2025-02-08 05:38:53,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 584 transitions, 1239 flow [2025-02-08 05:38:53,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 584 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:53,187 INFO L231 Difference]: Finished difference. Result has 572 places, 584 transitions, 1177 flow [2025-02-08 05:38:53,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1177, PETRI_PLACES=572, PETRI_TRANSITIONS=584} [2025-02-08 05:38:53,189 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2025-02-08 05:38:53,189 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 584 transitions, 1177 flow [2025-02-08 05:38:53,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:53,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:53,190 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:53,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:53,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:53,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:53,191 INFO L85 PathProgramCache]: Analyzing trace with hash -620761709, now seen corresponding path program 1 times [2025-02-08 05:38:53,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:53,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704606711] [2025-02-08 05:38:53,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:53,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:38:53,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:38:53,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:53,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:53,232 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:53,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704606711] [2025-02-08 05:38:53,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704606711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:53,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:53,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:53,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533421506] [2025-02-08 05:38:53,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:53,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:53,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:53,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:53,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:53,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-08 05:38:53,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 584 transitions, 1177 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:53,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:53,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-08 05:38:53,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:53,466 INFO L124 PetriNetUnfolderBase]: 89/1741 cut-off events. [2025-02-08 05:38:53,467 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:38:53,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 1741 events. 89/1741 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 10023 event pairs, 20 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1733. Up to 50 conditions per place. [2025-02-08 05:38:53,484 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2025-02-08 05:38:53,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 583 transitions, 1205 flow [2025-02-08 05:38:53,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-08 05:38:53,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-08 05:38:53,487 INFO L175 Difference]: Start difference. First operand has 572 places, 584 transitions, 1177 flow. Second operand 3 states and 1861 transitions. [2025-02-08 05:38:53,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 583 transitions, 1205 flow [2025-02-08 05:38:53,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 583 transitions, 1204 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:53,493 INFO L231 Difference]: Finished difference. Result has 572 places, 583 transitions, 1178 flow [2025-02-08 05:38:53,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1174, PETRI_DIFFERENCE_MINUEND_PLACES=570, 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=1178, PETRI_PLACES=572, PETRI_TRANSITIONS=583} [2025-02-08 05:38:53,494 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2025-02-08 05:38:53,495 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 583 transitions, 1178 flow [2025-02-08 05:38:53,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:53,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:53,496 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:53,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:53,496 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:53,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1493675232, now seen corresponding path program 1 times [2025-02-08 05:38:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760405843] [2025-02-08 05:38:53,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:53,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:53,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-08 05:38:53,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-08 05:38:53,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:53,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:53,534 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:53,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760405843] [2025-02-08 05:38:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760405843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:53,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:53,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:53,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876990073] [2025-02-08 05:38:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:53,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:53,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:53,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:53,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 643 [2025-02-08 05:38:53,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 583 transitions, 1178 flow. Second operand has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:53,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:53,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 643 [2025-02-08 05:38:53,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:53,745 INFO L124 PetriNetUnfolderBase]: 167/1866 cut-off events. [2025-02-08 05:38:53,745 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2025-02-08 05:38:53,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 1866 events. 167/1866 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12352 event pairs, 64 based on Foata normal form. 0/1580 useless extension candidates. Maximal degree in co-relation 1973. Up to 169 conditions per place. [2025-02-08 05:38:53,771 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 16 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2025-02-08 05:38:53,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 578 transitions, 1202 flow [2025-02-08 05:38:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-02-08 05:38:53,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.960082944530845 [2025-02-08 05:38:53,774 INFO L175 Difference]: Start difference. First operand has 572 places, 583 transitions, 1178 flow. Second operand 3 states and 1852 transitions. [2025-02-08 05:38:53,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 578 transitions, 1202 flow [2025-02-08 05:38:53,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 578 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:53,780 INFO L231 Difference]: Finished difference. Result has 567 places, 578 transitions, 1166 flow [2025-02-08 05:38:53,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=567, PETRI_TRANSITIONS=578} [2025-02-08 05:38:53,781 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2025-02-08 05:38:53,782 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 578 transitions, 1166 flow [2025-02-08 05:38:53,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:53,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:53,783 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:53,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:53,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:53,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash -887810836, now seen corresponding path program 1 times [2025-02-08 05:38:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:53,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185098101] [2025-02-08 05:38:53,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:53,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:38:53,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:38:53,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:53,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:53,829 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:53,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185098101] [2025-02-08 05:38:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185098101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:53,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:53,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098880642] [2025-02-08 05:38:53,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:53,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:53,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:53,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:53,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-08 05:38:53,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 578 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:53,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:53,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-08 05:38:53,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:53,929 INFO L124 PetriNetUnfolderBase]: 49/829 cut-off events. [2025-02-08 05:38:53,929 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-08 05:38:53,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 829 events. 49/829 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3200 event pairs, 20 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 814. Up to 50 conditions per place. [2025-02-08 05:38:53,937 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2025-02-08 05:38:53,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 577 transitions, 1194 flow [2025-02-08 05:38:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-08 05:38:53,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-08 05:38:53,940 INFO L175 Difference]: Start difference. First operand has 567 places, 578 transitions, 1166 flow. Second operand 3 states and 1861 transitions. [2025-02-08 05:38:53,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 577 transitions, 1194 flow [2025-02-08 05:38:53,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 577 transitions, 1193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:53,946 INFO L231 Difference]: Finished difference. Result has 567 places, 577 transitions, 1167 flow [2025-02-08 05:38:53,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1167, PETRI_PLACES=567, PETRI_TRANSITIONS=577} [2025-02-08 05:38:53,947 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2025-02-08 05:38:53,947 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 577 transitions, 1167 flow [2025-02-08 05:38:53,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:53,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:53,949 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:53,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:38:53,949 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:53,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1709996402, now seen corresponding path program 1 times [2025-02-08 05:38:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:53,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307825409] [2025-02-08 05:38:53,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:53,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-08 05:38:53,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-08 05:38:53,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:53,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:53,987 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:53,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:53,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307825409] [2025-02-08 05:38:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307825409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:53,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668956094] [2025-02-08 05:38:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:53,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:53,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:53,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:54,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-08 05:38:54,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 577 transitions, 1167 flow. Second operand has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 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:54,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:54,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-08 05:38:54,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:54,153 INFO L124 PetriNetUnfolderBase]: 96/1554 cut-off events. [2025-02-08 05:38:54,153 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:38:54,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 1554 events. 96/1554 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9903 event pairs, 26 based on Foata normal form. 0/1320 useless extension candidates. Maximal degree in co-relation 1575. Up to 75 conditions per place. [2025-02-08 05:38:54,173 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 17 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2025-02-08 05:38:54,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 577 transitions, 1207 flow [2025-02-08 05:38:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2025-02-08 05:38:54,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652669777086573 [2025-02-08 05:38:54,176 INFO L175 Difference]: Start difference. First operand has 567 places, 577 transitions, 1167 flow. Second operand 3 states and 1862 transitions. [2025-02-08 05:38:54,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 577 transitions, 1207 flow [2025-02-08 05:38:54,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 577 transitions, 1203 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:54,185 INFO L231 Difference]: Finished difference. Result has 564 places, 575 transitions, 1169 flow [2025-02-08 05:38:54,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1169, PETRI_PLACES=564, PETRI_TRANSITIONS=575} [2025-02-08 05:38:54,186 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2025-02-08 05:38:54,186 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 575 transitions, 1169 flow [2025-02-08 05:38:54,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 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:54,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:54,188 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:54,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:38:54,188 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:54,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1665891885, now seen corresponding path program 1 times [2025-02-08 05:38:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:54,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576128607] [2025-02-08 05:38:54,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:54,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:54,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 05:38:54,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 05:38:54,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:54,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:54,232 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:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576128607] [2025-02-08 05:38:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576128607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:54,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:54,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11654213] [2025-02-08 05:38:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:54,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:54,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:54,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:54,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-08 05:38:54,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 575 transitions, 1169 flow. Second operand has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 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:54,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:54,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-08 05:38:54,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:54,497 INFO L124 PetriNetUnfolderBase]: 165/2322 cut-off events. [2025-02-08 05:38:54,497 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:54,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 2322 events. 165/2322 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 18235 event pairs, 50 based on Foata normal form. 0/1971 useless extension candidates. Maximal degree in co-relation 2420. Up to 123 conditions per place. [2025-02-08 05:38:54,515 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 17 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-02-08 05:38:54,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 575 transitions, 1209 flow [2025-02-08 05:38:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2025-02-08 05:38:54,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652669777086573 [2025-02-08 05:38:54,518 INFO L175 Difference]: Start difference. First operand has 564 places, 575 transitions, 1169 flow. Second operand 3 states and 1862 transitions. [2025-02-08 05:38:54,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 575 transitions, 1209 flow [2025-02-08 05:38:54,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 575 transitions, 1209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:54,526 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1175 flow [2025-02-08 05:38:54,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=563, PETRI_TRANSITIONS=573} [2025-02-08 05:38:54,528 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2025-02-08 05:38:54,528 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1175 flow [2025-02-08 05:38:54,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 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:54,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:54,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:38:54,529 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:54,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1459008567, now seen corresponding path program 1 times [2025-02-08 05:38:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923883083] [2025-02-08 05:38:54,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:54,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 05:38:54,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 05:38:54,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:54,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:54,576 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:54,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:54,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923883083] [2025-02-08 05:38:54,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923883083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:54,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:54,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:54,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332325583] [2025-02-08 05:38:54,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:54,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:54,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:54,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:54,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:54,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-08 05:38:54,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 573 transitions, 1175 flow. Second operand has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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:54,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:54,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-08 05:38:54,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:54,909 INFO L124 PetriNetUnfolderBase]: 251/3259 cut-off events. [2025-02-08 05:38:54,910 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2025-02-08 05:38:54,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 3259 events. 251/3259 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 28561 event pairs, 52 based on Foata normal form. 1/2777 useless extension candidates. Maximal degree in co-relation 3418. Up to 202 conditions per place. [2025-02-08 05:38:54,941 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 17 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2025-02-08 05:38:54,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 573 transitions, 1215 flow [2025-02-08 05:38:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2025-02-08 05:38:54,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652669777086573 [2025-02-08 05:38:54,945 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1175 flow. Second operand 3 states and 1862 transitions. [2025-02-08 05:38:54,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 573 transitions, 1215 flow [2025-02-08 05:38:54,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 573 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:54,951 INFO L231 Difference]: Finished difference. Result has 562 places, 571 transitions, 1181 flow [2025-02-08 05:38:54,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=562, PETRI_TRANSITIONS=571} [2025-02-08 05:38:54,952 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2025-02-08 05:38:54,952 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 571 transitions, 1181 flow [2025-02-08 05:38:54,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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:54,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:54,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:38:54,958 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:54,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:54,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1816990421, now seen corresponding path program 1 times [2025-02-08 05:38:54,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:54,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398102571] [2025-02-08 05:38:54,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:54,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 05:38:54,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 05:38:54,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:54,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,011 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:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398102571] [2025-02-08 05:38:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398102571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523435702] [2025-02-08 05:38:55,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:38:55,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 571 transitions, 1181 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 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:55,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:38:55,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,230 INFO L124 PetriNetUnfolderBase]: 109/2049 cut-off events. [2025-02-08 05:38:55,230 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-02-08 05:38:55,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 2049 events. 109/2049 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13376 event pairs, 8 based on Foata normal form. 1/1763 useless extension candidates. Maximal degree in co-relation 2081. Up to 33 conditions per place. [2025-02-08 05:38:55,252 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2025-02-08 05:38:55,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 572 transitions, 1215 flow [2025-02-08 05:38:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-08 05:38:55,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-08 05:38:55,256 INFO L175 Difference]: Start difference. First operand has 562 places, 571 transitions, 1181 flow. Second operand 3 states and 1870 transitions. [2025-02-08 05:38:55,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 572 transitions, 1215 flow [2025-02-08 05:38:55,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 572 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:55,262 INFO L231 Difference]: Finished difference. Result has 563 places, 570 transitions, 1183 flow [2025-02-08 05:38:55,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=563, PETRI_TRANSITIONS=570} [2025-02-08 05:38:55,263 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2025-02-08 05:38:55,263 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 570 transitions, 1183 flow [2025-02-08 05:38:55,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 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:55,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,264 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:38:55,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:38:55,264 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:55,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash -430133300, now seen corresponding path program 1 times [2025-02-08 05:38:55,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100711669] [2025-02-08 05:38:55,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 05:38:55,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 05:38:55,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,307 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:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100711669] [2025-02-08 05:38:55,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100711669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:55,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190437070] [2025-02-08 05:38:55,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:38:55,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 570 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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:55,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:38:55,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,477 INFO L124 PetriNetUnfolderBase]: 90/1581 cut-off events. [2025-02-08 05:38:55,477 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:55,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 1581 events. 90/1581 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10276 event pairs, 12 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 1664. Up to 40 conditions per place. [2025-02-08 05:38:55,494 INFO L140 encePairwiseOnDemand]: 639/643 looper letters, 14 selfloop transitions, 3 changer transitions 0/573 dead transitions. [2025-02-08 05:38:55,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1225 flow [2025-02-08 05:38:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-08 05:38:55,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-08 05:38:55,497 INFO L175 Difference]: Start difference. First operand has 563 places, 570 transitions, 1183 flow. Second operand 3 states and 1872 transitions. [2025-02-08 05:38:55,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1225 flow [2025-02-08 05:38:55,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1221 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:55,505 INFO L231 Difference]: Finished difference. Result has 565 places, 571 transitions, 1197 flow [2025-02-08 05:38:55,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=565, PETRI_TRANSITIONS=571} [2025-02-08 05:38:55,506 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2025-02-08 05:38:55,506 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 571 transitions, 1197 flow [2025-02-08 05:38:55,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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:55,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,507 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:38:55,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:38:55,507 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:55,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash -606480971, now seen corresponding path program 1 times [2025-02-08 05:38:55,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553145039] [2025-02-08 05:38:55,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 05:38:55,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 05:38:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,555 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:55,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553145039] [2025-02-08 05:38:55,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553145039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516670652] [2025-02-08 05:38:55,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-08 05:38:55,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 571 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 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:55,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-08 05:38:55,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,875 INFO L124 PetriNetUnfolderBase]: 198/2668 cut-off events. [2025-02-08 05:38:55,875 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2025-02-08 05:38:55,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 2668 events. 198/2668 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20182 event pairs, 24 based on Foata normal form. 0/2311 useless extension candidates. Maximal degree in co-relation 2866. Up to 176 conditions per place. [2025-02-08 05:38:55,898 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 20 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2025-02-08 05:38:55,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 574 transitions, 1252 flow [2025-02-08 05:38:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2025-02-08 05:38:55,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966822187662001 [2025-02-08 05:38:55,900 INFO L175 Difference]: Start difference. First operand has 565 places, 571 transitions, 1197 flow. Second operand 3 states and 1865 transitions. [2025-02-08 05:38:55,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 574 transitions, 1252 flow [2025-02-08 05:38:55,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 574 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:55,906 INFO L231 Difference]: Finished difference. Result has 562 places, 569 transitions, 1197 flow [2025-02-08 05:38:55,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=562, PETRI_TRANSITIONS=569} [2025-02-08 05:38:55,907 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2025-02-08 05:38:55,907 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 569 transitions, 1197 flow [2025-02-08 05:38:55,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 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:55,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,908 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:38:55,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:38:55,908 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1978938168, now seen corresponding path program 1 times [2025-02-08 05:38:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033362101] [2025-02-08 05:38:55,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 05:38:55,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 05:38:55,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:55,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033362101] [2025-02-08 05:38:55,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033362101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623198927] [2025-02-08 05:38:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:38:55,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 569 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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:55,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:38:55,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,248 INFO L124 PetriNetUnfolderBase]: 184/2913 cut-off events. [2025-02-08 05:38:56,248 INFO L125 PetriNetUnfolderBase]: For 18/69 co-relation queries the response was YES. [2025-02-08 05:38:56,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 2913 events. 184/2913 cut-off events. For 18/69 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 22149 event pairs, 16 based on Foata normal form. 2/2533 useless extension candidates. Maximal degree in co-relation 3056. Up to 80 conditions per place. [2025-02-08 05:38:56,281 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-02-08 05:38:56,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 570 transitions, 1231 flow [2025-02-08 05:38:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-08 05:38:56,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-08 05:38:56,284 INFO L175 Difference]: Start difference. First operand has 562 places, 569 transitions, 1197 flow. Second operand 3 states and 1870 transitions. [2025-02-08 05:38:56,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 570 transitions, 1231 flow [2025-02-08 05:38:56,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 570 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:56,289 INFO L231 Difference]: Finished difference. Result has 563 places, 568 transitions, 1199 flow [2025-02-08 05:38:56,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=563, PETRI_TRANSITIONS=568} [2025-02-08 05:38:56,290 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2025-02-08 05:38:56,290 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 568 transitions, 1199 flow [2025-02-08 05:38:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:38:56,291 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:56,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1279536080, now seen corresponding path program 1 times [2025-02-08 05:38:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367362072] [2025-02-08 05:38:56,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:38:56,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:38:56,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,327 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,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367362072] [2025-02-08 05:38:56,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367362072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740977907] [2025-02-08 05:38:56,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:38:56,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 568 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:38:56,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,571 INFO L124 PetriNetUnfolderBase]: 154/2283 cut-off events. [2025-02-08 05:38:56,571 INFO L125 PetriNetUnfolderBase]: For 21/54 co-relation queries the response was YES. [2025-02-08 05:38:56,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 2283 events. 154/2283 cut-off events. For 21/54 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17246 event pairs, 24 based on Foata normal form. 0/1979 useless extension candidates. Maximal degree in co-relation 2441. Up to 78 conditions per place. [2025-02-08 05:38:56,598 INFO L140 encePairwiseOnDemand]: 639/643 looper letters, 14 selfloop transitions, 3 changer transitions 0/571 dead transitions. [2025-02-08 05:38:56,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 571 transitions, 1241 flow [2025-02-08 05:38:56,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-08 05:38:56,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-08 05:38:56,600 INFO L175 Difference]: Start difference. First operand has 563 places, 568 transitions, 1199 flow. Second operand 3 states and 1872 transitions. [2025-02-08 05:38:56,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 571 transitions, 1241 flow [2025-02-08 05:38:56,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 571 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,606 INFO L231 Difference]: Finished difference. Result has 565 places, 569 transitions, 1213 flow [2025-02-08 05:38:56,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=565, PETRI_TRANSITIONS=569} [2025-02-08 05:38:56,607 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2025-02-08 05:38:56,607 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 569 transitions, 1213 flow [2025-02-08 05:38:56,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:38:56,608 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:56,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2133794393, now seen corresponding path program 1 times [2025-02-08 05:38:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4200126] [2025-02-08 05:38:56,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 05:38:56,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 05:38:56,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,648 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,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4200126] [2025-02-08 05:38:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4200126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764298933] [2025-02-08 05:38:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:38:56,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 569 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 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,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:38:56,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,931 INFO L124 PetriNetUnfolderBase]: 162/2662 cut-off events. [2025-02-08 05:38:56,931 INFO L125 PetriNetUnfolderBase]: For 18/24 co-relation queries the response was YES. [2025-02-08 05:38:56,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2914 conditions, 2662 events. 162/2662 cut-off events. For 18/24 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19666 event pairs, 10 based on Foata normal form. 0/2328 useless extension candidates. Maximal degree in co-relation 2832. Up to 57 conditions per place. [2025-02-08 05:38:56,962 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-02-08 05:38:56,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 570 transitions, 1247 flow [2025-02-08 05:38:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-08 05:38:56,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-08 05:38:56,965 INFO L175 Difference]: Start difference. First operand has 565 places, 569 transitions, 1213 flow. Second operand 3 states and 1870 transitions. [2025-02-08 05:38:56,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 570 transitions, 1247 flow [2025-02-08 05:38:56,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 570 transitions, 1241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,971 INFO L231 Difference]: Finished difference. Result has 564 places, 568 transitions, 1209 flow [2025-02-08 05:38:56,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1209, PETRI_PLACES=564, PETRI_TRANSITIONS=568} [2025-02-08 05:38:56,972 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2025-02-08 05:38:56,972 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 568 transitions, 1209 flow [2025-02-08 05:38:56,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 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,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,973 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:38:56,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:38:56,973 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:56,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1863032446, now seen corresponding path program 1 times [2025-02-08 05:38:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13705227] [2025-02-08 05:38:56,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-08 05:38:56,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-08 05:38:56,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,016 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,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13705227] [2025-02-08 05:38:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13705227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129162238] [2025-02-08 05:38:57,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-08 05:38:57,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 568 transitions, 1209 flow. Second operand has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-08 05:38:57,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,404 INFO L124 PetriNetUnfolderBase]: 248/3369 cut-off events. [2025-02-08 05:38:57,404 INFO L125 PetriNetUnfolderBase]: For 15/29 co-relation queries the response was YES. [2025-02-08 05:38:57,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 3369 events. 248/3369 cut-off events. For 15/29 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 26578 event pairs, 32 based on Foata normal form. 1/2956 useless extension candidates. Maximal degree in co-relation 3722. Up to 175 conditions per place. [2025-02-08 05:38:57,449 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 20 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2025-02-08 05:38:57,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 571 transitions, 1264 flow [2025-02-08 05:38:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2025-02-08 05:38:57,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966822187662001 [2025-02-08 05:38:57,451 INFO L175 Difference]: Start difference. First operand has 564 places, 568 transitions, 1209 flow. Second operand 3 states and 1865 transitions. [2025-02-08 05:38:57,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 571 transitions, 1264 flow [2025-02-08 05:38:57,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 571 transitions, 1260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:57,460 INFO L231 Difference]: Finished difference. Result has 561 places, 566 transitions, 1211 flow [2025-02-08 05:38:57,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=561, PETRI_TRANSITIONS=566} [2025-02-08 05:38:57,461 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -40 predicate places. [2025-02-08 05:38:57,461 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 566 transitions, 1211 flow [2025-02-08 05:38:57,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:57,462 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:38:57,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:38:57,462 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:57,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash -991668613, now seen corresponding path program 1 times [2025-02-08 05:38:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777953798] [2025-02-08 05:38:57,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-08 05:38:57,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-08 05:38:57,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,615 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,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777953798] [2025-02-08 05:38:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777953798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:38:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177749491] [2025-02-08 05:38:57,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:38:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:38:57,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:38:58,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-08 05:38:58,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 566 transitions, 1211 flow. Second operand has 8 states, 8 states have (on average 590.125) internal successors, (4721), 8 states have internal predecessors, (4721), 0 states have call successors, (0), 0 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,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:58,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-08 05:38:58,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:58,689 INFO L124 PetriNetUnfolderBase]: 311/4433 cut-off events. [2025-02-08 05:38:58,689 INFO L125 PetriNetUnfolderBase]: For 14/41 co-relation queries the response was YES. [2025-02-08 05:38:58,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 4433 events. 311/4433 cut-off events. For 14/41 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39994 event pairs, 52 based on Foata normal form. 7/3926 useless extension candidates. Maximal degree in co-relation 5048. Up to 214 conditions per place. [2025-02-08 05:38:58,747 INFO L140 encePairwiseOnDemand]: 628/643 looper letters, 70 selfloop transitions, 16 changer transitions 0/605 dead transitions. [2025-02-08 05:38:58,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 605 transitions, 1477 flow [2025-02-08 05:38:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:38:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:38:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6532 transitions. [2025-02-08 05:38:58,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235119468400962 [2025-02-08 05:38:58,754 INFO L175 Difference]: Start difference. First operand has 561 places, 566 transitions, 1211 flow. Second operand 11 states and 6532 transitions. [2025-02-08 05:38:58,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 605 transitions, 1477 flow [2025-02-08 05:38:58,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 605 transitions, 1477 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:58,761 INFO L231 Difference]: Finished difference. Result has 576 places, 575 transitions, 1295 flow [2025-02-08 05:38:58,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1295, PETRI_PLACES=576, PETRI_TRANSITIONS=575} [2025-02-08 05:38:58,762 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2025-02-08 05:38:58,762 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 575 transitions, 1295 flow [2025-02-08 05:38:58,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.125) internal successors, (4721), 8 states have internal predecessors, (4721), 0 states have call successors, (0), 0 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,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:58,764 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:38:58,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:38:58,764 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:58,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -191439917, now seen corresponding path program 1 times [2025-02-08 05:38:58,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161093069] [2025-02-08 05:38:58,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:58,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:38:58,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:38:58,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:58,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:58,796 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,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:58,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161093069] [2025-02-08 05:38:58,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161093069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:58,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:58,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:58,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516871226] [2025-02-08 05:38:58,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:58,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:58,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:58,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:58,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:58,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:38:58,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 575 transitions, 1295 flow. Second operand has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:58,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:38:58,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:59,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1625] thread3EXIT-->L127-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][497], [Black: 703#true, Black: 672#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 688#true, 674#(= |#race~count2~0| 0), 705#(= |#race~get2~0| 0), 732#true, 670#(= |#race~count1~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)), 707#true, 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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 589#L127-17true, Black: 668#true]) [2025-02-08 05:38:59,249 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2025-02-08 05:38:59,249 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2025-02-08 05:38:59,249 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2025-02-08 05:38:59,249 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2025-02-08 05:38:59,263 INFO L124 PetriNetUnfolderBase]: 261/3042 cut-off events. [2025-02-08 05:38:59,263 INFO L125 PetriNetUnfolderBase]: For 84/129 co-relation queries the response was YES. [2025-02-08 05:38:59,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 3042 events. 261/3042 cut-off events. For 84/129 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 24660 event pairs, 47 based on Foata normal form. 0/2672 useless extension candidates. Maximal degree in co-relation 3512. Up to 211 conditions per place. [2025-02-08 05:38:59,304 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2025-02-08 05:38:59,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 576 transitions, 1329 flow [2025-02-08 05:38:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-08 05:38:59,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-08 05:38:59,309 INFO L175 Difference]: Start difference. First operand has 576 places, 575 transitions, 1295 flow. Second operand 3 states and 1870 transitions. [2025-02-08 05:38:59,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 576 transitions, 1329 flow [2025-02-08 05:38:59,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 576 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:59,316 INFO L231 Difference]: Finished difference. Result has 576 places, 574 transitions, 1293 flow [2025-02-08 05:38:59,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=576, PETRI_TRANSITIONS=574} [2025-02-08 05:38:59,317 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2025-02-08 05:38:59,317 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 574 transitions, 1293 flow [2025-02-08 05:38:59,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:59,318 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:38:59,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:38:59,319 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:38:59,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:59,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2144182563, now seen corresponding path program 1 times [2025-02-08 05:38:59,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:59,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153527033] [2025-02-08 05:38:59,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:59,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-08 05:38:59,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-08 05:38:59,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:59,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:59,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:59,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153527033] [2025-02-08 05:38:59,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153527033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:59,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:59,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149471393] [2025-02-08 05:38:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:59,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:59,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:59,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:59,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:59,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:38:59,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 574 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:59,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:38:59,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:00,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1550] L90-20-->L90-19: Formula: (= |v_#race~get1~0_12| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_12|} AuxVars[] AssignedVars[#race~get1~0][456], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), 410#L77-2true, 735#true, 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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 668#true, 358#L122-1true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), 297#L90-19true, Black: 688#true, 674#(= |#race~count2~0| 0), 732#true, 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), 590#L50-19true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|)]) [2025-02-08 05:39:00,422 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2025-02-08 05:39:00,422 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-02-08 05:39:00,422 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-02-08 05:39:00,422 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-08 05:39:00,517 INFO L124 PetriNetUnfolderBase]: 442/6407 cut-off events. [2025-02-08 05:39:00,517 INFO L125 PetriNetUnfolderBase]: For 57/115 co-relation queries the response was YES. [2025-02-08 05:39:00,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7203 conditions, 6407 events. 442/6407 cut-off events. For 57/115 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 62421 event pairs, 36 based on Foata normal form. 0/5628 useless extension candidates. Maximal degree in co-relation 7113. Up to 170 conditions per place. [2025-02-08 05:39:00,589 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-02-08 05:39:00,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 575 transitions, 1327 flow [2025-02-08 05:39:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-08 05:39:00,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-08 05:39:00,591 INFO L175 Difference]: Start difference. First operand has 576 places, 574 transitions, 1293 flow. Second operand 3 states and 1870 transitions. [2025-02-08 05:39:00,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 575 transitions, 1327 flow [2025-02-08 05:39:00,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 575 transitions, 1323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:00,598 INFO L231 Difference]: Finished difference. Result has 575 places, 573 transitions, 1291 flow [2025-02-08 05:39:00,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=575, PETRI_TRANSITIONS=573} [2025-02-08 05:39:00,599 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -26 predicate places. [2025-02-08 05:39:00,599 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 573 transitions, 1291 flow [2025-02-08 05:39:00,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:00,600 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:00,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:39:00,600 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:00,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash -464967960, now seen corresponding path program 1 times [2025-02-08 05:39:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540696263] [2025-02-08 05:39:00,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:00,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-08 05:39:00,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-08 05:39:00,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:00,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:00,731 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,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540696263] [2025-02-08 05:39:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540696263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469436073] [2025-02-08 05:39:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:00,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:00,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:00,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:01,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-08 05:39:01,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 573 transitions, 1291 flow. Second operand has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 0 states have call successors, (0), 0 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,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:01,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-08 05:39:01,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:02,240 INFO L124 PetriNetUnfolderBase]: 701/8589 cut-off events. [2025-02-08 05:39:02,240 INFO L125 PetriNetUnfolderBase]: For 148/265 co-relation queries the response was YES. [2025-02-08 05:39:02,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10140 conditions, 8589 events. 701/8589 cut-off events. For 148/265 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 94646 event pairs, 150 based on Foata normal form. 16/7588 useless extension candidates. Maximal degree in co-relation 10048. Up to 473 conditions per place. [2025-02-08 05:39:02,347 INFO L140 encePairwiseOnDemand]: 628/643 looper letters, 66 selfloop transitions, 16 changer transitions 0/603 dead transitions. [2025-02-08 05:39:02,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 603 transitions, 1531 flow [2025-02-08 05:39:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:39:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:39:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6523 transitions. [2025-02-08 05:39:02,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9222395023328149 [2025-02-08 05:39:02,355 INFO L175 Difference]: Start difference. First operand has 575 places, 573 transitions, 1291 flow. Second operand 11 states and 6523 transitions. [2025-02-08 05:39:02,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 603 transitions, 1531 flow [2025-02-08 05:39:02,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 603 transitions, 1527 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:02,365 INFO L231 Difference]: Finished difference. Result has 588 places, 582 transitions, 1371 flow [2025-02-08 05:39:02,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1371, PETRI_PLACES=588, PETRI_TRANSITIONS=582} [2025-02-08 05:39:02,366 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -13 predicate places. [2025-02-08 05:39:02,366 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 582 transitions, 1371 flow [2025-02-08 05:39:02,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 0 states have call successors, (0), 0 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,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:02,367 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] [2025-02-08 05:39:02,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:39:02,368 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:02,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1678195660, now seen corresponding path program 1 times [2025-02-08 05:39:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:02,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681505612] [2025-02-08 05:39:02,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:02,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-08 05:39:02,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-08 05:39:02,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:02,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:02,401 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,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:02,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681505612] [2025-02-08 05:39:02,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681505612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:02,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:02,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:39:02,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58278261] [2025-02-08 05:39:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:02,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:02,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:02,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:02,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:39:02,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 582 transitions, 1371 flow. Second operand has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:02,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:39:02,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:03,347 INFO L124 PetriNetUnfolderBase]: 700/6568 cut-off events. [2025-02-08 05:39:03,348 INFO L125 PetriNetUnfolderBase]: For 363/434 co-relation queries the response was YES. [2025-02-08 05:39:03,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8213 conditions, 6568 events. 700/6568 cut-off events. For 363/434 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 67410 event pairs, 204 based on Foata normal form. 0/5722 useless extension candidates. Maximal degree in co-relation 8115. Up to 747 conditions per place. [2025-02-08 05:39:03,407 INFO L140 encePairwiseOnDemand]: 639/643 looper letters, 14 selfloop transitions, 3 changer transitions 0/585 dead transitions. [2025-02-08 05:39:03,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 585 transitions, 1413 flow [2025-02-08 05:39:03,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-08 05:39:03,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-08 05:39:03,412 INFO L175 Difference]: Start difference. First operand has 588 places, 582 transitions, 1371 flow. Second operand 3 states and 1872 transitions. [2025-02-08 05:39:03,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 585 transitions, 1413 flow [2025-02-08 05:39:03,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 585 transitions, 1409 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:03,419 INFO L231 Difference]: Finished difference. Result has 591 places, 583 transitions, 1385 flow [2025-02-08 05:39:03,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1385, PETRI_PLACES=591, PETRI_TRANSITIONS=583} [2025-02-08 05:39:03,420 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -10 predicate places. [2025-02-08 05:39:03,420 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 583 transitions, 1385 flow [2025-02-08 05:39:03,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:03,420 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:03,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:39:03,421 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:03,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash -536920941, now seen corresponding path program 1 times [2025-02-08 05:39:03,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:03,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520318217] [2025-02-08 05:39:03,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:03,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:03,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-08 05:39:03,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-08 05:39:03,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:03,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:03,464 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:03,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:03,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520318217] [2025-02-08 05:39:03,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520318217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:03,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:03,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125289157] [2025-02-08 05:39:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:03,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:03,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:03,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:03,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:39:03,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 583 transitions, 1385 flow. Second operand has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:03,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:39:03,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:04,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1625] thread3EXIT-->L127-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][476], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 589#L127-17true, Black: 668#true, 768#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 763#true, Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 743#(<= ~n2~0 0), Black: 749#(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: 751#(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: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:04,426 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-02-08 05:39:04,426 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-02-08 05:39:04,426 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2025-02-08 05:39:04,426 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-02-08 05:39:04,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1625] thread3EXIT-->L127-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][476], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 589#L127-17true, 768#true, Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 763#true, Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:04,439 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is not cut-off event [2025-02-08 05:39:04,439 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2025-02-08 05:39:04,439 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is not cut-off event [2025-02-08 05:39:04,439 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2025-02-08 05:39:04,454 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1625] thread3EXIT-->L127-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][476], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 589#L127-17true, Black: 668#true, 768#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 763#true, Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:04,454 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2025-02-08 05:39:04,454 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-02-08 05:39:04,454 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-02-08 05:39:04,454 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-02-08 05:39:04,454 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-02-08 05:39:04,459 INFO L124 PetriNetUnfolderBase]: 493/5346 cut-off events. [2025-02-08 05:39:04,459 INFO L125 PetriNetUnfolderBase]: For 288/357 co-relation queries the response was YES. [2025-02-08 05:39:04,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6870 conditions, 5346 events. 493/5346 cut-off events. For 288/357 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 51433 event pairs, 86 based on Foata normal form. 2/4834 useless extension candidates. Maximal degree in co-relation 6772. Up to 416 conditions per place. [2025-02-08 05:39:04,524 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/584 dead transitions. [2025-02-08 05:39:04,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 584 transitions, 1419 flow [2025-02-08 05:39:04,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-08 05:39:04,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-08 05:39:04,526 INFO L175 Difference]: Start difference. First operand has 591 places, 583 transitions, 1385 flow. Second operand 3 states and 1870 transitions. [2025-02-08 05:39:04,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 584 transitions, 1419 flow [2025-02-08 05:39:04,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 584 transitions, 1413 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:04,536 INFO L231 Difference]: Finished difference. Result has 590 places, 582 transitions, 1381 flow [2025-02-08 05:39:04,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1381, PETRI_PLACES=590, PETRI_TRANSITIONS=582} [2025-02-08 05:39:04,537 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -11 predicate places. [2025-02-08 05:39:04,537 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 582 transitions, 1381 flow [2025-02-08 05:39:04,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:04,537 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:04,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:39:04,538 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:04,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2115502179, now seen corresponding path program 1 times [2025-02-08 05:39:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:04,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048468511] [2025-02-08 05:39:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:04,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 05:39:04,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 05:39:04,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:04,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:04,695 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,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:04,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048468511] [2025-02-08 05:39:04,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048468511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:04,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:04,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:04,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221818969] [2025-02-08 05:39:04,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:04,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:04,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:04,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:04,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:05,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-08 05:39:05,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 582 transitions, 1381 flow. Second operand has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 0 states have call successors, (0), 0 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,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:05,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-08 05:39:05,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:06,052 INFO L124 PetriNetUnfolderBase]: 603/5602 cut-off events. [2025-02-08 05:39:06,052 INFO L125 PetriNetUnfolderBase]: For 380/477 co-relation queries the response was YES. [2025-02-08 05:39:06,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7573 conditions, 5602 events. 603/5602 cut-off events. For 380/477 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 52415 event pairs, 179 based on Foata normal form. 17/5035 useless extension candidates. Maximal degree in co-relation 7473. Up to 678 conditions per place. [2025-02-08 05:39:06,124 INFO L140 encePairwiseOnDemand]: 626/643 looper letters, 79 selfloop transitions, 19 changer transitions 0/623 dead transitions. [2025-02-08 05:39:06,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 623 transitions, 1707 flow [2025-02-08 05:39:06,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:39:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:39:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7121 transitions. [2025-02-08 05:39:06,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228875064800415 [2025-02-08 05:39:06,130 INFO L175 Difference]: Start difference. First operand has 590 places, 582 transitions, 1381 flow. Second operand 12 states and 7121 transitions. [2025-02-08 05:39:06,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 623 transitions, 1707 flow [2025-02-08 05:39:06,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 623 transitions, 1703 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:06,140 INFO L231 Difference]: Finished difference. Result has 603 places, 587 transitions, 1457 flow [2025-02-08 05:39:06,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1457, PETRI_PLACES=603, PETRI_TRANSITIONS=587} [2025-02-08 05:39:06,141 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 2 predicate places. [2025-02-08 05:39:06,141 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 587 transitions, 1457 flow [2025-02-08 05:39:06,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 0 states have call successors, (0), 0 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,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:06,142 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:06,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:39:06,142 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:06,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash -951033318, now seen corresponding path program 1 times [2025-02-08 05:39:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:06,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079007057] [2025-02-08 05:39:06,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:06,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:06,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-08 05:39:06,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 05:39:06,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:06,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:06,316 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:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:06,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079007057] [2025-02-08 05:39:06,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079007057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:06,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:06,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315143327] [2025-02-08 05:39:06,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:06,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:06,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:06,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:06,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-08 05:39:06,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 587 transitions, 1457 flow. Second operand has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 0 states have call successors, (0), 0 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,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:06,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-08 05:39:06,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:07,607 INFO L124 PetriNetUnfolderBase]: 416/5737 cut-off events. [2025-02-08 05:39:07,607 INFO L125 PetriNetUnfolderBase]: For 305/328 co-relation queries the response was YES. [2025-02-08 05:39:07,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7646 conditions, 5737 events. 416/5737 cut-off events. For 305/328 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 53374 event pairs, 52 based on Foata normal form. 2/5278 useless extension candidates. Maximal degree in co-relation 7539. Up to 215 conditions per place. [2025-02-08 05:39:07,663 INFO L140 encePairwiseOnDemand]: 626/643 looper letters, 71 selfloop transitions, 24 changer transitions 0/621 dead transitions. [2025-02-08 05:39:07,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 621 transitions, 1763 flow [2025-02-08 05:39:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:39:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:39:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7114 transitions. [2025-02-08 05:39:07,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219803006739243 [2025-02-08 05:39:07,670 INFO L175 Difference]: Start difference. First operand has 603 places, 587 transitions, 1457 flow. Second operand 12 states and 7114 transitions. [2025-02-08 05:39:07,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 621 transitions, 1763 flow [2025-02-08 05:39:07,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 621 transitions, 1746 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:39:07,679 INFO L231 Difference]: Finished difference. Result has 612 places, 596 transitions, 1573 flow [2025-02-08 05:39:07,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1573, PETRI_PLACES=612, PETRI_TRANSITIONS=596} [2025-02-08 05:39:07,680 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 11 predicate places. [2025-02-08 05:39:07,683 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 596 transitions, 1573 flow [2025-02-08 05:39:07,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 0 states have call successors, (0), 0 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,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:07,684 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:07,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:39:07,685 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:07,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:07,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1294508283, now seen corresponding path program 1 times [2025-02-08 05:39:07,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940756210] [2025-02-08 05:39:07,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:07,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:07,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-08 05:39:07,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-08 05:39:07,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:07,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:07,819 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:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:07,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940756210] [2025-02-08 05:39:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940756210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:07,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:07,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466850405] [2025-02-08 05:39:07,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:07,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:07,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:07,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:08,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-08 05:39:08,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 596 transitions, 1573 flow. Second operand has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 0 states have call successors, (0), 0 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,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:08,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-08 05:39:08,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:09,965 INFO L124 PetriNetUnfolderBase]: 940/11014 cut-off events. [2025-02-08 05:39:09,965 INFO L125 PetriNetUnfolderBase]: For 1008/1143 co-relation queries the response was YES. [2025-02-08 05:39:10,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15176 conditions, 11014 events. 940/11014 cut-off events. For 1008/1143 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 125708 event pairs, 192 based on Foata normal form. 4/10107 useless extension candidates. Maximal degree in co-relation 15061. Up to 594 conditions per place. [2025-02-08 05:39:10,123 INFO L140 encePairwiseOnDemand]: 627/643 looper letters, 69 selfloop transitions, 20 changer transitions 0/624 dead transitions. [2025-02-08 05:39:10,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 624 transitions, 1853 flow [2025-02-08 05:39:10,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:39:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:39:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2025-02-08 05:39:10,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212498232715962 [2025-02-08 05:39:10,126 INFO L175 Difference]: Start difference. First operand has 612 places, 596 transitions, 1573 flow. Second operand 11 states and 6516 transitions. [2025-02-08 05:39:10,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 624 transitions, 1853 flow [2025-02-08 05:39:10,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 624 transitions, 1836 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:39:10,144 INFO L231 Difference]: Finished difference. Result has 621 places, 609 transitions, 1694 flow [2025-02-08 05:39:10,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1694, PETRI_PLACES=621, PETRI_TRANSITIONS=609} [2025-02-08 05:39:10,145 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 20 predicate places. [2025-02-08 05:39:10,145 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 609 transitions, 1694 flow [2025-02-08 05:39:10,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 0 states have call successors, (0), 0 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,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:10,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:39:10,146 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:10,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:10,147 INFO L85 PathProgramCache]: Analyzing trace with hash 53253506, now seen corresponding path program 1 times [2025-02-08 05:39:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:10,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950435576] [2025-02-08 05:39:10,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:10,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-08 05:39:10,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-08 05:39:10,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:10,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:10,264 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:10,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:10,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950435576] [2025-02-08 05:39:10,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950435576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:10,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:10,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:39:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026627544] [2025-02-08 05:39:10,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:10,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:39:10,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:10,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:39:10,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:39:10,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-08 05:39:10,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 609 transitions, 1694 flow. Second operand has 8 states, 8 states have (on average 590.5) internal successors, (4724), 8 states have internal predecessors, (4724), 0 states have call successors, (0), 0 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,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:10,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-08 05:39:10,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:11,772 INFO L124 PetriNetUnfolderBase]: 761/7083 cut-off events. [2025-02-08 05:39:11,772 INFO L125 PetriNetUnfolderBase]: For 1367/1487 co-relation queries the response was YES. [2025-02-08 05:39:11,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10697 conditions, 7083 events. 761/7083 cut-off events. For 1367/1487 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 69808 event pairs, 234 based on Foata normal form. 19/6523 useless extension candidates. Maximal degree in co-relation 10573. Up to 915 conditions per place. [2025-02-08 05:39:11,840 INFO L140 encePairwiseOnDemand]: 627/643 looper letters, 70 selfloop transitions, 21 changer transitions 0/633 dead transitions. [2025-02-08 05:39:11,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 633 transitions, 1981 flow [2025-02-08 05:39:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:39:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:39:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2025-02-08 05:39:11,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212498232715962 [2025-02-08 05:39:11,843 INFO L175 Difference]: Start difference. First operand has 621 places, 609 transitions, 1694 flow. Second operand 11 states and 6516 transitions. [2025-02-08 05:39:11,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 633 transitions, 1981 flow [2025-02-08 05:39:11,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 633 transitions, 1977 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:11,856 INFO L231 Difference]: Finished difference. Result has 633 places, 618 transitions, 1823 flow [2025-02-08 05:39:11,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1823, PETRI_PLACES=633, PETRI_TRANSITIONS=618} [2025-02-08 05:39:11,857 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 32 predicate places. [2025-02-08 05:39:11,857 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 618 transitions, 1823 flow [2025-02-08 05:39:11,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.5) internal successors, (4724), 8 states have internal predecessors, (4724), 0 states have call successors, (0), 0 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,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:11,858 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:11,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:39:11,859 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:11,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:11,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2118617817, now seen corresponding path program 1 times [2025-02-08 05:39:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:11,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872611110] [2025-02-08 05:39:11,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:11,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:11,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-08 05:39:11,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-08 05:39:11,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:11,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:12,164 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:12,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:12,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872611110] [2025-02-08 05:39:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872611110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:12,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:12,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145358612] [2025-02-08 05:39:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:12,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:12,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:12,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:12,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-08 05:39:12,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 618 transitions, 1823 flow. Second operand has 6 states, 6 states have (on average 599.8333333333334) internal successors, (3599), 6 states have internal predecessors, (3599), 0 states have call successors, (0), 0 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,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:12,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-08 05:39:12,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:13,963 INFO L124 PetriNetUnfolderBase]: 682/9716 cut-off events. [2025-02-08 05:39:13,963 INFO L125 PetriNetUnfolderBase]: For 2250/2312 co-relation queries the response was YES. [2025-02-08 05:39:14,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14082 conditions, 9716 events. 682/9716 cut-off events. For 2250/2312 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 101688 event pairs, 45 based on Foata normal form. 10/9035 useless extension candidates. Maximal degree in co-relation 13954. Up to 286 conditions per place. [2025-02-08 05:39:14,096 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/625 dead transitions. [2025-02-08 05:39:14,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 625 transitions, 1945 flow [2025-02-08 05:39:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-08 05:39:14,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-08 05:39:14,098 INFO L175 Difference]: Start difference. First operand has 633 places, 618 transitions, 1823 flow. Second operand 6 states and 3626 transitions. [2025-02-08 05:39:14,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 625 transitions, 1945 flow [2025-02-08 05:39:14,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 625 transitions, 1924 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:39:14,125 INFO L231 Difference]: Finished difference. Result has 630 places, 617 transitions, 1821 flow [2025-02-08 05:39:14,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1798, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1821, PETRI_PLACES=630, PETRI_TRANSITIONS=617} [2025-02-08 05:39:14,126 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 29 predicate places. [2025-02-08 05:39:14,126 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 617 transitions, 1821 flow [2025-02-08 05:39:14,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 599.8333333333334) internal successors, (3599), 6 states have internal predecessors, (3599), 0 states have call successors, (0), 0 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,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:14,126 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:14,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:39:14,127 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:14,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1224608689, now seen corresponding path program 1 times [2025-02-08 05:39:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:14,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631773841] [2025-02-08 05:39:14,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:14,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-08 05:39:14,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-08 05:39:14,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:14,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:14,401 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:14,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:14,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631773841] [2025-02-08 05:39:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631773841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:14,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:14,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027661432] [2025-02-08 05:39:14,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:14,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:14,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:14,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:14,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-08 05:39:14,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 617 transitions, 1821 flow. Second operand has 6 states, 6 states have (on average 600.0) internal successors, (3600), 6 states have internal predecessors, (3600), 0 states have call successors, (0), 0 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,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:14,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-08 05:39:14,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:16,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1550] L90-20-->L90-19: Formula: (= |v_#race~get1~0_12| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_12|} AuxVars[] AssignedVars[#race~get1~0][550], [658#(= |#race~n2~0| 0), 124#L76true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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)), 874#true, 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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 358#L122-1true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 297#L90-19true, 867#true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), 590#L50-19true, Black: 751#(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: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:16,204 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-02-08 05:39:16,204 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-02-08 05:39:16,204 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-02-08 05:39:16,204 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-02-08 05:39:16,216 INFO L124 PetriNetUnfolderBase]: 734/10389 cut-off events. [2025-02-08 05:39:16,216 INFO L125 PetriNetUnfolderBase]: For 2660/2856 co-relation queries the response was YES. [2025-02-08 05:39:16,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15077 conditions, 10389 events. 734/10389 cut-off events. For 2660/2856 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 110225 event pairs, 70 based on Foata normal form. 11/9607 useless extension candidates. Maximal degree in co-relation 14949. Up to 376 conditions per place. [2025-02-08 05:39:16,366 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/624 dead transitions. [2025-02-08 05:39:16,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 624 transitions, 1943 flow [2025-02-08 05:39:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-08 05:39:16,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-08 05:39:16,368 INFO L175 Difference]: Start difference. First operand has 630 places, 617 transitions, 1821 flow. Second operand 6 states and 3626 transitions. [2025-02-08 05:39:16,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 624 transitions, 1943 flow [2025-02-08 05:39:16,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 624 transitions, 1930 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:16,397 INFO L231 Difference]: Finished difference. Result has 630 places, 616 transitions, 1827 flow [2025-02-08 05:39:16,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1804, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1827, PETRI_PLACES=630, PETRI_TRANSITIONS=616} [2025-02-08 05:39:16,398 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 29 predicate places. [2025-02-08 05:39:16,398 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 616 transitions, 1827 flow [2025-02-08 05:39:16,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.0) internal successors, (3600), 6 states have internal predecessors, (3600), 0 states have call successors, (0), 0 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,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:16,399 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:16,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 05:39:16,399 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:16,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1986798525, now seen corresponding path program 1 times [2025-02-08 05:39:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:16,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236116187] [2025-02-08 05:39:16,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:16,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-08 05:39:16,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-08 05:39:16,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:16,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:16,708 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:16,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:16,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236116187] [2025-02-08 05:39:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236116187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:16,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:16,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:16,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28101204] [2025-02-08 05:39:16,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:16,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:16,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:16,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:16,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:17,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-08 05:39:17,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 616 transitions, 1827 flow. Second operand has 6 states, 6 states have (on average 599.8333333333334) internal successors, (3599), 6 states have internal predecessors, (3599), 0 states have call successors, (0), 0 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,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:17,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-08 05:39:17,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:18,569 INFO L124 PetriNetUnfolderBase]: 655/9599 cut-off events. [2025-02-08 05:39:18,569 INFO L125 PetriNetUnfolderBase]: For 2319/2381 co-relation queries the response was YES. [2025-02-08 05:39:18,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13966 conditions, 9599 events. 655/9599 cut-off events. For 2319/2381 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 100113 event pairs, 45 based on Foata normal form. 10/8961 useless extension candidates. Maximal degree in co-relation 13837. Up to 286 conditions per place. [2025-02-08 05:39:18,663 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/622 dead transitions. [2025-02-08 05:39:18,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 622 transitions, 1943 flow [2025-02-08 05:39:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-08 05:39:18,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-08 05:39:18,665 INFO L175 Difference]: Start difference. First operand has 630 places, 616 transitions, 1827 flow. Second operand 6 states and 3626 transitions. [2025-02-08 05:39:18,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 622 transitions, 1943 flow [2025-02-08 05:39:18,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 622 transitions, 1930 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:18,688 INFO L231 Difference]: Finished difference. Result has 629 places, 614 transitions, 1822 flow [2025-02-08 05:39:18,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=624, 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=1822, PETRI_PLACES=629, PETRI_TRANSITIONS=614} [2025-02-08 05:39:18,689 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 28 predicate places. [2025-02-08 05:39:18,689 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 614 transitions, 1822 flow [2025-02-08 05:39:18,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 599.8333333333334) internal successors, (3599), 6 states have internal predecessors, (3599), 0 states have call successors, (0), 0 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,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:18,689 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:18,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 05:39:18,690 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash -27865328, now seen corresponding path program 1 times [2025-02-08 05:39:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690489931] [2025-02-08 05:39:18,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:18,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-08 05:39:18,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-08 05:39:18,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:18,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:18,724 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:18,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:18,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690489931] [2025-02-08 05:39:18,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690489931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:18,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763366152] [2025-02-08 05:39:18,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:18,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:18,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:18,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:18,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:18,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-08 05:39:18,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 614 transitions, 1822 flow. Second operand has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:18,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-08 05:39:18,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:20,182 INFO L124 PetriNetUnfolderBase]: 774/9766 cut-off events. [2025-02-08 05:39:20,182 INFO L125 PetriNetUnfolderBase]: For 1563/1588 co-relation queries the response was YES. [2025-02-08 05:39:20,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13400 conditions, 9766 events. 774/9766 cut-off events. For 1563/1588 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 96197 event pairs, 86 based on Foata normal form. 0/9037 useless extension candidates. Maximal degree in co-relation 13272. Up to 557 conditions per place. [2025-02-08 05:39:20,316 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 19 selfloop transitions, 2 changer transitions 0/616 dead transitions. [2025-02-08 05:39:20,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 616 transitions, 1872 flow [2025-02-08 05:39:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1864 transitions. [2025-02-08 05:39:20,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663037843442198 [2025-02-08 05:39:20,318 INFO L175 Difference]: Start difference. First operand has 629 places, 614 transitions, 1822 flow. Second operand 3 states and 1864 transitions. [2025-02-08 05:39:20,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 616 transitions, 1872 flow [2025-02-08 05:39:20,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 616 transitions, 1860 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:20,333 INFO L231 Difference]: Finished difference. Result has 623 places, 612 transitions, 1816 flow [2025-02-08 05:39:20,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1816, PETRI_PLACES=623, PETRI_TRANSITIONS=612} [2025-02-08 05:39:20,334 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 22 predicate places. [2025-02-08 05:39:20,334 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 612 transitions, 1816 flow [2025-02-08 05:39:20,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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:20,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:20,335 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:20,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 05:39:20,335 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:20,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2146607496, now seen corresponding path program 1 times [2025-02-08 05:39:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:20,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60253274] [2025-02-08 05:39:20,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:20,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-08 05:39:20,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-08 05:39:20,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:20,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:20,597 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:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60253274] [2025-02-08 05:39:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60253274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:20,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:20,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:20,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784514682] [2025-02-08 05:39:20,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:20,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:20,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:20,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:21,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-08 05:39:21,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 612 transitions, 1816 flow. Second operand has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 0 states have call successors, (0), 0 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,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:21,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-08 05:39:21,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:22,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1626] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][588], [658#(= |#race~n2~0| 0), 260#L125true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 893#(= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0), Black: 668#true, 248#L90-16true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 889#(= |#race~get3~0| 0), 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 887#true, Black: 751#(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: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:22,038 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-02-08 05:39:22,038 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-08 05:39:22,038 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-08 05:39:22,038 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2025-02-08 05:39:22,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1626] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][592], [658#(= |#race~n2~0| 0), 260#L125true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 889#(= |#race~get3~0| 0), 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 894#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 268#L90-15true, 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 887#true, Black: 751#(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: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:22,041 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-02-08 05:39:22,041 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:22,041 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:22,041 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-08 05:39:22,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1626] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][596], [658#(= |#race~n2~0| 0), 260#L125true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 889#(= |#race~get3~0| 0), 674#(= |#race~count2~0| 0), 31#L90-14true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 887#true, Black: 751#(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: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:22,044 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-02-08 05:39:22,044 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:22,044 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2025-02-08 05:39:22,044 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:22,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1626] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][600], [658#(= |#race~n2~0| 0), 260#L125true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 889#(= |#race~get3~0| 0), 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, Black: 703#true, 678#(= |#race~count3~0| 0), 114#L90-12true, 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 887#true, Black: 751#(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: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:22,046 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2025-02-08 05:39:22,046 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-02-08 05:39:22,046 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2025-02-08 05:39:22,046 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-02-08 05:39:22,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1626] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][600], [658#(= |#race~n2~0| 0), 260#L125true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 889#(= |#race~get3~0| 0), 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), 50#L90-13true, Black: 824#(<= ~n3~0 0), 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 887#true, Black: 751#(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: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:22,049 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2025-02-08 05:39:22,049 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:39:22,049 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:39:22,049 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2025-02-08 05:39:22,066 INFO L124 PetriNetUnfolderBase]: 711/7183 cut-off events. [2025-02-08 05:39:22,066 INFO L125 PetriNetUnfolderBase]: For 2288/2512 co-relation queries the response was YES. [2025-02-08 05:39:22,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11074 conditions, 7183 events. 711/7183 cut-off events. For 2288/2512 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 69788 event pairs, 97 based on Foata normal form. 33/6784 useless extension candidates. Maximal degree in co-relation 10945. Up to 461 conditions per place. [2025-02-08 05:39:22,153 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/619 dead transitions. [2025-02-08 05:39:22,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 619 transitions, 1938 flow [2025-02-08 05:39:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-08 05:39:22,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-08 05:39:22,155 INFO L175 Difference]: Start difference. First operand has 623 places, 612 transitions, 1816 flow. Second operand 6 states and 3626 transitions. [2025-02-08 05:39:22,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 619 transitions, 1938 flow [2025-02-08 05:39:22,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 619 transitions, 1938 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:22,169 INFO L231 Difference]: Finished difference. Result has 627 places, 611 transitions, 1835 flow [2025-02-08 05:39:22,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1835, PETRI_PLACES=627, PETRI_TRANSITIONS=611} [2025-02-08 05:39:22,170 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 26 predicate places. [2025-02-08 05:39:22,170 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 611 transitions, 1835 flow [2025-02-08 05:39:22,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 0 states have call successors, (0), 0 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,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:22,171 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:22,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 05:39:22,171 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:22,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1182875725, now seen corresponding path program 1 times [2025-02-08 05:39:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462644566] [2025-02-08 05:39:22,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:22,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-08 05:39:22,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-08 05:39:22,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:22,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:22,450 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:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462644566] [2025-02-08 05:39:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462644566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:22,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:22,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:22,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541563797] [2025-02-08 05:39:22,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:22,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:22,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:22,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:22,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:22,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-08 05:39:22,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 611 transitions, 1835 flow. Second operand has 6 states, 6 states have (on average 600.0) internal successors, (3600), 6 states have internal predecessors, (3600), 0 states have call successors, (0), 0 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,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:22,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-08 05:39:22,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:24,700 INFO L124 PetriNetUnfolderBase]: 778/10893 cut-off events. [2025-02-08 05:39:24,701 INFO L125 PetriNetUnfolderBase]: For 3018/3219 co-relation queries the response was YES. [2025-02-08 05:39:24,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16450 conditions, 10893 events. 778/10893 cut-off events. For 3018/3219 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 116877 event pairs, 76 based on Foata normal form. 15/10289 useless extension candidates. Maximal degree in co-relation 16319. Up to 419 conditions per place. [2025-02-08 05:39:24,780 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/617 dead transitions. [2025-02-08 05:39:24,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 617 transitions, 1951 flow [2025-02-08 05:39:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-08 05:39:24,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-08 05:39:24,782 INFO L175 Difference]: Start difference. First operand has 627 places, 611 transitions, 1835 flow. Second operand 6 states and 3626 transitions. [2025-02-08 05:39:24,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 617 transitions, 1951 flow [2025-02-08 05:39:24,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 617 transitions, 1938 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:24,812 INFO L231 Difference]: Finished difference. Result has 626 places, 609 transitions, 1830 flow [2025-02-08 05:39:24,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1830, PETRI_PLACES=626, PETRI_TRANSITIONS=609} [2025-02-08 05:39:24,812 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 25 predicate places. [2025-02-08 05:39:24,813 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 609 transitions, 1830 flow [2025-02-08 05:39:24,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.0) internal successors, (3600), 6 states have internal predecessors, (3600), 0 states have call successors, (0), 0 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,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:24,813 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:24,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 05:39:24,813 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:24,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1709592845, now seen corresponding path program 1 times [2025-02-08 05:39:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957808513] [2025-02-08 05:39:24,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:24,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-08 05:39:24,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-08 05:39:24,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:24,848 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:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957808513] [2025-02-08 05:39:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957808513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:24,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957969094] [2025-02-08 05:39:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:24,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:24,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:24,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:24,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 643 [2025-02-08 05:39:24,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 609 transitions, 1830 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:24,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:24,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 643 [2025-02-08 05:39:24,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:26,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1625] thread3EXIT-->L127-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][432], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, 904#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 889#(= |#race~get3~0| 0), 898#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 589#L127-17true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:26,354 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-08 05:39:26,355 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-08 05:39:26,355 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:26,355 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:26,377 INFO L124 PetriNetUnfolderBase]: 683/10524 cut-off events. [2025-02-08 05:39:26,378 INFO L125 PetriNetUnfolderBase]: For 2284/2319 co-relation queries the response was YES. [2025-02-08 05:39:26,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15194 conditions, 10524 events. 683/10524 cut-off events. For 2284/2319 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 108759 event pairs, 51 based on Foata normal form. 0/9956 useless extension candidates. Maximal degree in co-relation 15064. Up to 320 conditions per place. [2025-02-08 05:39:26,535 INFO L140 encePairwiseOnDemand]: 641/643 looper letters, 10 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2025-02-08 05:39:26,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 608 transitions, 1850 flow [2025-02-08 05:39:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-08 05:39:26,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-08 05:39:26,536 INFO L175 Difference]: Start difference. First operand has 626 places, 609 transitions, 1830 flow. Second operand 3 states and 1872 transitions. [2025-02-08 05:39:26,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 608 transitions, 1850 flow [2025-02-08 05:39:26,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 608 transitions, 1838 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:26,566 INFO L231 Difference]: Finished difference. Result has 622 places, 608 transitions, 1818 flow [2025-02-08 05:39:26,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1818, PETRI_PLACES=622, PETRI_TRANSITIONS=608} [2025-02-08 05:39:26,567 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 21 predicate places. [2025-02-08 05:39:26,567 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 608 transitions, 1818 flow [2025-02-08 05:39:26,568 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:26,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:26,568 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:26,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 05:39:26,568 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:26,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash -806015892, now seen corresponding path program 1 times [2025-02-08 05:39:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:26,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326457037] [2025-02-08 05:39:26,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:26,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 05:39:26,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 05:39:26,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:26,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:26,837 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:26,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:26,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326457037] [2025-02-08 05:39:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326457037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:26,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:26,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:26,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199592377] [2025-02-08 05:39:26,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:26,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:26,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:26,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:27,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-08 05:39:27,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 608 transitions, 1818 flow. Second operand has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 0 states have call successors, (0), 0 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:27,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:27,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-08 05:39:27,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:28,170 INFO L124 PetriNetUnfolderBase]: 636/6942 cut-off events. [2025-02-08 05:39:28,170 INFO L125 PetriNetUnfolderBase]: For 2361/2561 co-relation queries the response was YES. [2025-02-08 05:39:28,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 6942 events. 636/6942 cut-off events. For 2361/2561 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 66391 event pairs, 97 based on Foata normal form. 41/6642 useless extension candidates. Maximal degree in co-relation 10603. Up to 467 conditions per place. [2025-02-08 05:39:28,244 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/614 dead transitions. [2025-02-08 05:39:28,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 614 transitions, 1934 flow [2025-02-08 05:39:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-08 05:39:28,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-08 05:39:28,246 INFO L175 Difference]: Start difference. First operand has 622 places, 608 transitions, 1818 flow. Second operand 6 states and 3626 transitions. [2025-02-08 05:39:28,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 614 transitions, 1934 flow [2025-02-08 05:39:28,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 614 transitions, 1933 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:28,261 INFO L231 Difference]: Finished difference. Result has 624 places, 606 transitions, 1825 flow [2025-02-08 05:39:28,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1825, PETRI_PLACES=624, PETRI_TRANSITIONS=606} [2025-02-08 05:39:28,262 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 23 predicate places. [2025-02-08 05:39:28,262 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 606 transitions, 1825 flow [2025-02-08 05:39:28,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 0 states have call successors, (0), 0 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,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:28,263 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] [2025-02-08 05:39:28,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 05:39:28,263 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:28,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1290695230, now seen corresponding path program 1 times [2025-02-08 05:39:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:28,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706055831] [2025-02-08 05:39:28,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:28,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-08 05:39:28,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-08 05:39:28,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:28,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:28,296 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:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706055831] [2025-02-08 05:39:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706055831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379884296] [2025-02-08 05:39:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:28,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:28,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:28,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:28,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 643 [2025-02-08 05:39:28,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 606 transitions, 1825 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:28,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:28,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 643 [2025-02-08 05:39:28,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:29,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1625] thread3EXIT-->L127-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][432], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, 913#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 889#(= |#race~get3~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 907#true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 589#L127-17true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:29,817 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-08 05:39:29,817 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:29,817 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:29,817 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-08 05:39:29,828 INFO L124 PetriNetUnfolderBase]: 688/10505 cut-off events. [2025-02-08 05:39:29,828 INFO L125 PetriNetUnfolderBase]: For 2436/2506 co-relation queries the response was YES. [2025-02-08 05:39:29,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15478 conditions, 10505 events. 688/10505 cut-off events. For 2436/2506 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 109874 event pairs, 76 based on Foata normal form. 0/10006 useless extension candidates. Maximal degree in co-relation 15348. Up to 384 conditions per place. [2025-02-08 05:39:29,965 INFO L140 encePairwiseOnDemand]: 641/643 looper letters, 10 selfloop transitions, 1 changer transitions 0/605 dead transitions. [2025-02-08 05:39:29,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 605 transitions, 1845 flow [2025-02-08 05:39:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-08 05:39:29,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-08 05:39:29,966 INFO L175 Difference]: Start difference. First operand has 624 places, 606 transitions, 1825 flow. Second operand 3 states and 1872 transitions. [2025-02-08 05:39:29,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 605 transitions, 1845 flow [2025-02-08 05:39:29,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 605 transitions, 1833 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:29,996 INFO L231 Difference]: Finished difference. Result has 620 places, 605 transitions, 1813 flow [2025-02-08 05:39:29,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1813, PETRI_PLACES=620, PETRI_TRANSITIONS=605} [2025-02-08 05:39:29,997 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 19 predicate places. [2025-02-08 05:39:29,997 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 605 transitions, 1813 flow [2025-02-08 05:39:29,997 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:29,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:29,997 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] [2025-02-08 05:39:29,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 05:39:29,997 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:29,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1163167044, now seen corresponding path program 1 times [2025-02-08 05:39:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:29,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563596064] [2025-02-08 05:39:29,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:29,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-08 05:39:30,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-08 05:39:30,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:30,043 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:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:30,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563596064] [2025-02-08 05:39:30,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563596064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:30,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:39:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550651886] [2025-02-08 05:39:30,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:30,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:39:30,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:30,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:39:30,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:39:30,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-02-08 05:39:30,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 605 transitions, 1813 flow. Second operand has 4 states, 4 states have (on average 616.75) internal successors, (2467), 4 states have internal predecessors, (2467), 0 states have call successors, (0), 0 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,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:30,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-02-08 05:39:30,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:30,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1625] thread3EXIT-->L127-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][432], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, 913#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 889#(= |#race~get3~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 589#L127-17true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:30,908 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-08 05:39:30,908 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:30,908 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:30,908 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-08 05:39:30,911 INFO L124 PetriNetUnfolderBase]: 345/5842 cut-off events. [2025-02-08 05:39:30,911 INFO L125 PetriNetUnfolderBase]: For 1203/1238 co-relation queries the response was YES. [2025-02-08 05:39:30,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8429 conditions, 5842 events. 345/5842 cut-off events. For 1203/1238 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 51515 event pairs, 7 based on Foata normal form. 15/5609 useless extension candidates. Maximal degree in co-relation 8298. Up to 158 conditions per place. [2025-02-08 05:39:30,971 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 12 selfloop transitions, 0 changer transitions 2/606 dead transitions. [2025-02-08 05:39:30,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 606 transitions, 1843 flow [2025-02-08 05:39:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:39:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:39:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2471 transitions. [2025-02-08 05:39:30,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607309486780715 [2025-02-08 05:39:30,972 INFO L175 Difference]: Start difference. First operand has 620 places, 605 transitions, 1813 flow. Second operand 4 states and 2471 transitions. [2025-02-08 05:39:30,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 606 transitions, 1843 flow [2025-02-08 05:39:30,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 606 transitions, 1842 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:30,986 INFO L231 Difference]: Finished difference. Result has 624 places, 604 transitions, 1814 flow [2025-02-08 05:39:30,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1814, PETRI_PLACES=624, PETRI_TRANSITIONS=604} [2025-02-08 05:39:30,986 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 23 predicate places. [2025-02-08 05:39:30,986 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 604 transitions, 1814 flow [2025-02-08 05:39:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 616.75) internal successors, (2467), 4 states have internal predecessors, (2467), 0 states have call successors, (0), 0 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,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,987 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] [2025-02-08 05:39:30,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 05:39:30,987 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:30,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash 399032884, now seen corresponding path program 1 times [2025-02-08 05:39:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770651772] [2025-02-08 05:39:30,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-08 05:39:30,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-08 05:39:30,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,018 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:31,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770651772] [2025-02-08 05:39:31,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770651772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847535404] [2025-02-08 05:39:31,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 643 [2025-02-08 05:39:31,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 604 transitions, 1814 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:31,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 643 [2025-02-08 05:39:31,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1562] L97-2-->L97: Formula: (= |v_thread3Thread1of1ForFork2_#t~nondet26_3| |v_#race~res3~0_6|) InVars {thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][390], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), 260#L125true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 918#(not |ULTIMATE.start_main_#t~short52#1|), Black: 921#(and (not |ULTIMATE.start_main_#t~short53#1|) (not |ULTIMATE.start_main_#t~short52#1|)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 924#true, 916#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 889#(= |#race~get3~0| 0), 674#(= |#race~count2~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, 216#L97true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:31,869 INFO L294 olderBase$Statistics]: this new event has 390 ancestors and is cut-off event [2025-02-08 05:39:31,869 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:31,869 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:31,869 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:31,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1625] thread3EXIT-->L127-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][432], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 918#(not |ULTIMATE.start_main_#t~short52#1|), Black: 921#(and (not |ULTIMATE.start_main_#t~short53#1|) (not |ULTIMATE.start_main_#t~short52#1|)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 889#(= |#race~get3~0| 0), 674#(= |#race~count2~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 589#L127-17true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:31,888 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-02-08 05:39:31,888 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-02-08 05:39:31,888 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is cut-off event [2025-02-08 05:39:31,888 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-02-08 05:39:31,889 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1625] thread3EXIT-->L127-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][432], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 918#(not |ULTIMATE.start_main_#t~short52#1|), Black: 921#(and (not |ULTIMATE.start_main_#t~short53#1|) (not |ULTIMATE.start_main_#t~short52#1|)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 889#(= |#race~get3~0| 0), 674#(= |#race~count2~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 589#L127-17true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:31,889 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-08 05:39:31,889 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:31,889 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:31,889 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-08 05:39:31,889 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-08 05:39:31,892 INFO L124 PetriNetUnfolderBase]: 464/6048 cut-off events. [2025-02-08 05:39:31,892 INFO L125 PetriNetUnfolderBase]: For 1278/1329 co-relation queries the response was YES. [2025-02-08 05:39:31,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8897 conditions, 6048 events. 464/6048 cut-off events. For 1278/1329 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56074 event pairs, 98 based on Foata normal form. 15/5754 useless extension candidates. Maximal degree in co-relation 8854. Up to 389 conditions per place. [2025-02-08 05:39:31,963 INFO L140 encePairwiseOnDemand]: 641/643 looper letters, 8 selfloop transitions, 0 changer transitions 21/603 dead transitions. [2025-02-08 05:39:31,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 603 transitions, 1832 flow [2025-02-08 05:39:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2025-02-08 05:39:31,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9699326075686885 [2025-02-08 05:39:31,964 INFO L175 Difference]: Start difference. First operand has 624 places, 604 transitions, 1814 flow. Second operand 3 states and 1871 transitions. [2025-02-08 05:39:31,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 603 transitions, 1832 flow [2025-02-08 05:39:31,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 603 transitions, 1828 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:31,977 INFO L231 Difference]: Finished difference. Result has 621 places, 582 transitions, 1677 flow [2025-02-08 05:39:31,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=621, PETRI_TRANSITIONS=582} [2025-02-08 05:39:31,978 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 20 predicate places. [2025-02-08 05:39:31,978 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 582 transitions, 1677 flow [2025-02-08 05:39:31,978 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:31,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,978 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:31,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 05:39:31,978 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:31,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash -963821698, now seen corresponding path program 1 times [2025-02-08 05:39:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128939907] [2025-02-08 05:39:31,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-08 05:39:31,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-08 05:39:31,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,018 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:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128939907] [2025-02-08 05:39:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128939907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599651236] [2025-02-08 05:39:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:39:32,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 582 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 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:32,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:39:32,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:33,376 INFO L124 PetriNetUnfolderBase]: 625/9646 cut-off events. [2025-02-08 05:39:33,377 INFO L125 PetriNetUnfolderBase]: For 1707/1733 co-relation queries the response was YES. [2025-02-08 05:39:33,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13639 conditions, 9646 events. 625/9646 cut-off events. For 1707/1733 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 96693 event pairs, 53 based on Foata normal form. 0/9218 useless extension candidates. Maximal degree in co-relation 13597. Up to 279 conditions per place. [2025-02-08 05:39:33,498 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 11 selfloop transitions, 2 changer transitions 14/583 dead transitions. [2025-02-08 05:39:33,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 583 transitions, 1707 flow [2025-02-08 05:39:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2025-02-08 05:39:33,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683773976153447 [2025-02-08 05:39:33,499 INFO L175 Difference]: Start difference. First operand has 621 places, 582 transitions, 1677 flow. Second operand 3 states and 1868 transitions. [2025-02-08 05:39:33,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 583 transitions, 1707 flow [2025-02-08 05:39:33,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 583 transitions, 1693 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:33,522 INFO L231 Difference]: Finished difference. Result has 608 places, 567 transitions, 1561 flow [2025-02-08 05:39:33,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=606, 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=1561, PETRI_PLACES=608, PETRI_TRANSITIONS=567} [2025-02-08 05:39:33,523 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 7 predicate places. [2025-02-08 05:39:33,523 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 567 transitions, 1561 flow [2025-02-08 05:39:33,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 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,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:33,523 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:33,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-08 05:39:33,523 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:33,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash -152299559, now seen corresponding path program 1 times [2025-02-08 05:39:33,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:33,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198909711] [2025-02-08 05:39:33,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:33,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:33,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-08 05:39:33,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:39:33,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:33,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:39:33,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:33,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198909711] [2025-02-08 05:39:33,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198909711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:33,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:33,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:33,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854693086] [2025-02-08 05:39:33,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:33,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:33,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:33,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:33,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:33,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:39:33,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 567 transitions, 1561 flow. Second operand has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:33,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:39:33,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:34,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1550] L90-20-->L90-19: Formula: (= |v_#race~get1~0_12| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_12|} AuxVars[] AssignedVars[#race~get1~0][478], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 18#L77true, 658#(= |#race~n2~0| 0), 927#true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 889#(= |#race~get3~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 930#true, 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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 358#L122-1true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 297#L90-19true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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|)), 590#L50-19true, Black: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:34,615 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-02-08 05:39:34,616 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2025-02-08 05:39:34,616 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-02-08 05:39:34,616 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-02-08 05:39:34,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1345] 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][464], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), 927#true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 889#(= |#race~get3~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 930#true, 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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 82#L70-19true, 358#L122-1true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), 405#L50-11true, Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 297#L90-19true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:34,680 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-02-08 05:39:34,680 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-08 05:39:34,680 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:34,680 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-08 05:39:34,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1626] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][422], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), 260#L125true, 927#true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 889#(= |#race~get3~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 930#true, 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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 297#L90-19true, 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:34,694 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2025-02-08 05:39:34,694 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2025-02-08 05:39:34,694 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-02-08 05:39:34,694 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-02-08 05:39:34,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1449] L77-2-->L77: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_3|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_3|} AuxVars[] AssignedVars[#race~res2~0][350], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 18#L77true, 658#(= |#race~n2~0| 0), 927#true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 889#(= |#race~get3~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 563#L124true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(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: 832#(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: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 930#true, 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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 297#L90-19true, 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:34,695 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2025-02-08 05:39:34,695 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:34,695 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-02-08 05:39:34,695 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:34,695 INFO L124 PetriNetUnfolderBase]: 536/7958 cut-off events. [2025-02-08 05:39:34,695 INFO L125 PetriNetUnfolderBase]: For 1220/1260 co-relation queries the response was YES. [2025-02-08 05:39:34,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11146 conditions, 7958 events. 536/7958 cut-off events. For 1220/1260 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 77435 event pairs, 63 based on Foata normal form. 1/7620 useless extension candidates. Maximal degree in co-relation 11103. Up to 233 conditions per place. [2025-02-08 05:39:34,797 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 11 selfloop transitions, 2 changer transitions 13/568 dead transitions. [2025-02-08 05:39:34,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 568 transitions, 1591 flow [2025-02-08 05:39:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2025-02-08 05:39:34,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683773976153447 [2025-02-08 05:39:34,799 INFO L175 Difference]: Start difference. First operand has 608 places, 567 transitions, 1561 flow. Second operand 3 states and 1868 transitions. [2025-02-08 05:39:34,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 568 transitions, 1591 flow [2025-02-08 05:39:34,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 568 transitions, 1539 flow, removed 16 selfloop flow, removed 13 redundant places. [2025-02-08 05:39:34,818 INFO L231 Difference]: Finished difference. Result has 589 places, 553 transitions, 1426 flow [2025-02-08 05:39:34,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1426, PETRI_PLACES=589, PETRI_TRANSITIONS=553} [2025-02-08 05:39:34,819 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -12 predicate places. [2025-02-08 05:39:34,819 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 553 transitions, 1426 flow [2025-02-08 05:39:34,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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:34,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:34,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-08 05:39:34,819 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:39:34,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:34,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1842148369, now seen corresponding path program 1 times [2025-02-08 05:39:34,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:34,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781165275] [2025-02-08 05:39:34,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:34,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:34,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-08 05:39:34,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-08 05:39:34,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:34,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:34,859 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:34,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:34,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781165275] [2025-02-08 05:39:34,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781165275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:34,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:34,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870182333] [2025-02-08 05:39:34,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:34,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:34,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:34,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:34,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-08 05:39:34,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 553 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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:34,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:34,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-08 05:39:34,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:35,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1345] 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][431], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 830#(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)), 930#true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 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: 776#(<= ~n1~0 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: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 82#L70-19true, Black: 668#true, 358#L122-1true, Black: 672#true, 795#true, Black: 676#true, 405#L50-11true, 916#true, 924#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 297#L90-19true, Black: 688#true, 674#(= |#race~count2~0| 0), 889#(= |#race~get3~0| 0), 933#true, 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:35,353 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-02-08 05:39:35,353 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:35,353 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-08 05:39:35,353 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-08 05:39:35,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1562] L97-2-->L97: Formula: (= |v_thread3Thread1of1ForFork2_#t~nondet26_3| |v_#race~res3~0_6|) InVars {thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][393], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 830#(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)), 930#true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 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: 776#(<= ~n1~0 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: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 82#L70-19true, Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 889#(= |#race~get3~0| 0), 933#true, 674#(= |#race~count2~0| 0), 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 216#L97true, 563#L124true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:35,370 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2025-02-08 05:39:35,370 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-02-08 05:39:35,370 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:35,370 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:39:35,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1562] L97-2-->L97: Formula: (= |v_thread3Thread1of1ForFork2_#t~nondet26_3| |v_#race~res3~0_6|) InVars {thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][393], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 830#(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)), 930#true, 260#L125true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 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: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 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 (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 933#true, 889#(= |#race~get3~0| 0), 674#(= |#race~count2~0| 0), 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(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: 743#(<= ~n2~0 0), Black: 751#(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: 887#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 216#L97true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-02-08 05:39:35,370 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2025-02-08 05:39:35,370 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:35,370 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:35,370 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:39:35,370 INFO L124 PetriNetUnfolderBase]: 300/3535 cut-off events. [2025-02-08 05:39:35,370 INFO L125 PetriNetUnfolderBase]: For 310/352 co-relation queries the response was YES. [2025-02-08 05:39:35,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4806 conditions, 3535 events. 300/3535 cut-off events. For 310/352 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 27813 event pairs, 62 based on Foata normal form. 1/3371 useless extension candidates. Maximal degree in co-relation 4770. Up to 213 conditions per place. [2025-02-08 05:39:35,409 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 0 selfloop transitions, 0 changer transitions 554/554 dead transitions. [2025-02-08 05:39:35,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 554 transitions, 1456 flow [2025-02-08 05:39:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2025-02-08 05:39:35,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683773976153447 [2025-02-08 05:39:35,410 INFO L175 Difference]: Start difference. First operand has 589 places, 553 transitions, 1426 flow. Second operand 3 states and 1868 transitions. [2025-02-08 05:39:35,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 554 transitions, 1456 flow [2025-02-08 05:39:35,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 554 transitions, 1402 flow, removed 12 selfloop flow, removed 15 redundant places. [2025-02-08 05:39:35,418 INFO L231 Difference]: Finished difference. Result has 568 places, 0 transitions, 0 flow [2025-02-08 05:39:35,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=568, PETRI_TRANSITIONS=0} [2025-02-08 05:39:35,418 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -33 predicate places. [2025-02-08 05:39:35,418 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 0 transitions, 0 flow [2025-02-08 05:39:35,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (134 of 135 remaining) [2025-02-08 05:39:35,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (132 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (131 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (130 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (128 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (127 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (126 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (125 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (124 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (123 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (122 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (121 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (120 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (119 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (118 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (117 of 135 remaining) [2025-02-08 05:39:35,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (116 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (115 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (113 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (112 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (111 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (110 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (109 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (108 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (107 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (106 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (105 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (104 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (103 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (101 of 135 remaining) [2025-02-08 05:39:35,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (98 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (97 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (96 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (95 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (93 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (92 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (91 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (90 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (89 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (88 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (87 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (85 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (84 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (83 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (82 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (81 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (80 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (79 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (77 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (75 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (73 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (72 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (71 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (70 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (69 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (68 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (66 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (64 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (63 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (62 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (61 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (60 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 135 remaining) [2025-02-08 05:39:35,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (56 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (55 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (53 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (52 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (50 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (48 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (47 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (46 of 135 remaining) [2025-02-08 05:39:35,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (45 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (44 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (43 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (40 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (37 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (36 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (34 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (32 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 135 remaining) [2025-02-08 05:39:35,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (28 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (26 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (15 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (14 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (10 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (9 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 135 remaining) [2025-02-08 05:39:35,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 135 remaining) [2025-02-08 05:39:35,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-08 05:39:35,428 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, 1] [2025-02-08 05:39:35,432 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:35,432 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:35,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:35 BasicIcfg [2025-02-08 05:39:35,436 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:35,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:35,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:35,437 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:35,438 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:42" (3/4) ... [2025-02-08 05:39:35,439 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:35,441 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:35,441 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:35,441 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:39:35,446 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-08 05:39:35,446 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:35,447 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:35,447 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:35,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:35,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:35,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:35,515 INFO L158 Benchmark]: Toolchain (without parser) took 53976.89ms. Allocated memory was 142.6MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 113.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-02-08 05:39:35,515 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:35,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.97ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:35,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.97ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:35,516 INFO L158 Benchmark]: Boogie Preprocessor took 41.35ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:35,516 INFO L158 Benchmark]: IcfgBuilder took 899.84ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 48.1MB in the end (delta: 45.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 05:39:35,517 INFO L158 Benchmark]: TraceAbstraction took 52668.33ms. Allocated memory was 142.6MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 47.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-02-08 05:39:35,518 INFO L158 Benchmark]: Witness Printer took 77.55ms. Allocated memory is still 3.3GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:35,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.97ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.97ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.35ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 899.84ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 48.1MB in the end (delta: 45.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 52668.33ms. Allocated memory was 142.6MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 47.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 77.55ms. Allocated memory is still 3.3GB. Free memory was 1.4GB in the beginning and 1.4GB 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: 139]: 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: 139]: 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: 139]: 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: 127]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 941 locations, 135 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: 52.5s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 47.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6990 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4398 mSDsluCounter, 6915 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6440 mSDsCounter, 1347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11108 IncrementalHoareTripleChecker+Invalid, 12455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1347 mSolverCounterUnsat, 475 mSDtfsCounter, 11108 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1835occurred in iteration=38, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 8709 NumberOfCodeBlocks, 8709 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 8662 ConstructedInterpolants, 0 QuantifiedInterpolants, 10754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 41/41 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 75 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:35,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE