./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:31:44,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:31:44,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:31:44,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:31:44,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:31:44,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:31:44,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:31:44,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:31:44,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:31:44,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:31:44,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:31:44,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:31:44,804 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:31:44,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:31:44,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:31:44,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:31:44,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:31:44,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:31:44,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:31:44,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:31:44,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:31:44,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:31:44,814 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:31:44,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:31:44,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:31:44,815 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:31:44,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:31:44,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:31:44,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:31:44,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:31:44,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:31:44,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:31:44,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:31:44,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:31:44,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:31:44,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:31:44,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:31:44,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:31:44,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:31:44,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:31:44,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:31:44,821 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2024-10-24 15:31:45,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:31:45,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:31:45,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:31:45,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:31:45,103 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:31:45,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2024-10-24 15:31:46,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:31:46,598 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:31:46,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2024-10-24 15:31:46,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2e8636d/6bb10f177c0f44fd9b5c4fddce5f844f/FLAGc99dc718e [2024-10-24 15:31:46,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2e8636d/6bb10f177c0f44fd9b5c4fddce5f844f [2024-10-24 15:31:46,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:31:46,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:31:46,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:31:46,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:31:46,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:31:46,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:46,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bbffcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46, skipping insertion in model container [2024-10-24 15:31:46,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:46,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:31:46,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:31:46,892 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:31:46,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:31:46,946 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:31:46,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46 WrapperNode [2024-10-24 15:31:46,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:31:46,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:31:46,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:31:46,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:31:46,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:46,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:46,987 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 244 [2024-10-24 15:31:46,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:31:46,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:31:46,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:31:46,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:31:47,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:47,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:47,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:47,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:47,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:47,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:47,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:47,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:47,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:31:47,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:31:47,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:31:47,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:31:47,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (1/1) ... [2024-10-24 15:31:47,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:31:47,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:31:47,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:31:47,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:31:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:31:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 15:31:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 15:31:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 15:31:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 15:31:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-24 15:31:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-24 15:31:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:31:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-24 15:31:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:31:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:31:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:31:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-24 15:31:47,132 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:31:47,243 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:31:47,245 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:31:47,967 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:31:47,967 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:31:48,004 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:31:48,004 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-24 15:31:48,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:31:48 BoogieIcfgContainer [2024-10-24 15:31:48,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:31:48,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:31:48,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:31:48,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:31:48,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:31:46" (1/3) ... [2024-10-24 15:31:48,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cfba30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:31:48, skipping insertion in model container [2024-10-24 15:31:48,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:46" (2/3) ... [2024-10-24 15:31:48,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cfba30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:31:48, skipping insertion in model container [2024-10-24 15:31:48,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:31:48" (3/3) ... [2024-10-24 15:31:48,012 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2024-10-24 15:31:48,026 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:31:48,027 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2024-10-24 15:31:48,027 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:31:48,147 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-24 15:31:48,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 623 places, 646 transitions, 1313 flow [2024-10-24 15:31:48,369 INFO L124 PetriNetUnfolderBase]: 33/643 cut-off events. [2024-10-24 15:31:48,370 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 15:31:48,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 643 events. 33/643 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1738 event pairs, 0 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 493. Up to 3 conditions per place. [2024-10-24 15:31:48,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 623 places, 646 transitions, 1313 flow [2024-10-24 15:31:48,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 601 places, 622 transitions, 1262 flow [2024-10-24 15:31:48,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:31:48,423 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;@c2718bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:31:48,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2024-10-24 15:31:48,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:31:48,428 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-24 15:31:48,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:31:48,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:48,429 INFO L204 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] [2024-10-24 15:31:48,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:48,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2016546986, now seen corresponding path program 1 times [2024-10-24 15:31:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840319266] [2024-10-24 15:31:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:48,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840319266] [2024-10-24 15:31:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840319266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:48,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:48,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359095853] [2024-10-24 15:31:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:48,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:48,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:48,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-24 15:31:48,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 622 transitions, 1262 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) [2024-10-24 15:31:48,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:48,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-24 15:31:48,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:48,915 INFO L124 PetriNetUnfolderBase]: 51/1065 cut-off events. [2024-10-24 15:31:48,916 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-24 15:31:48,928 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 26. Compared 5296 event pairs, 12 based on Foata normal form. 30/898 useless extension candidates. Maximal degree in co-relation 832. Up to 38 conditions per place. [2024-10-24 15:31:48,969 INFO L140 encePairwiseOnDemand]: 631/646 looper letters, 13 selfloop transitions, 2 changer transitions 6/609 dead transitions. [2024-10-24 15:31:48,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 609 transitions, 1266 flow [2024-10-24 15:31:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1873 transitions. [2024-10-24 15:31:48,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9664602683178535 [2024-10-24 15:31:48,985 INFO L175 Difference]: Start difference. First operand has 601 places, 622 transitions, 1262 flow. Second operand 3 states and 1873 transitions. [2024-10-24 15:31:48,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 609 transitions, 1266 flow [2024-10-24 15:31:48,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 15:31:48,999 INFO L231 Difference]: Finished difference. Result has 596 places, 603 transitions, 1216 flow [2024-10-24 15:31:49,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:49,006 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -5 predicate places. [2024-10-24 15:31:49,007 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 603 transitions, 1216 flow [2024-10-24 15:31:49,008 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) [2024-10-24 15:31:49,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:49,009 INFO L204 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] [2024-10-24 15:31:49,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:31:49,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:49,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2142014687, now seen corresponding path program 1 times [2024-10-24 15:31:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015480019] [2024-10-24 15:31:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:49,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015480019] [2024-10-24 15:31:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015480019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417823960] [2024-10-24 15:31:49,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:49,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:49,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:49,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:49,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:49,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-24 15:31:49,103 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) [2024-10-24 15:31:49,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:49,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-24 15:31:49,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:49,378 INFO L124 PetriNetUnfolderBase]: 79/1490 cut-off events. [2024-10-24 15:31:49,378 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 15:31:49,390 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 9114 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. [2024-10-24 15:31:49,405 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2024-10-24 15:31:49,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 602 transitions, 1244 flow [2024-10-24 15:31:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-24 15:31:49,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-24 15:31:49,409 INFO L175 Difference]: Start difference. First operand has 596 places, 603 transitions, 1216 flow. Second operand 3 states and 1861 transitions. [2024-10-24 15:31:49,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 602 transitions, 1244 flow [2024-10-24 15:31:49,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 602 transitions, 1240 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:49,419 INFO L231 Difference]: Finished difference. Result has 589 places, 602 transitions, 1214 flow [2024-10-24 15:31:49,420 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:49,421 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -12 predicate places. [2024-10-24 15:31:49,421 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 602 transitions, 1214 flow [2024-10-24 15:31:49,422 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) [2024-10-24 15:31:49,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:49,423 INFO L204 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] [2024-10-24 15:31:49,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:31:49,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:49,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:49,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1394337867, now seen corresponding path program 1 times [2024-10-24 15:31:49,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:49,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911253797] [2024-10-24 15:31:49,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911253797] [2024-10-24 15:31:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911253797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771241186] [2024-10-24 15:31:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:49,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:49,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:49,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-24 15:31:49,513 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) [2024-10-24 15:31:49,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:49,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-24 15:31:49,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:49,724 INFO L124 PetriNetUnfolderBase]: 79/1477 cut-off events. [2024-10-24 15:31:49,725 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-24 15:31:49,737 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 8372 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. [2024-10-24 15:31:49,745 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2024-10-24 15:31:49,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 601 transitions, 1242 flow [2024-10-24 15:31:49,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-24 15:31:49,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-24 15:31:49,750 INFO L175 Difference]: Start difference. First operand has 589 places, 602 transitions, 1214 flow. Second operand 3 states and 1861 transitions. [2024-10-24 15:31:49,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 601 transitions, 1242 flow [2024-10-24 15:31:49,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 601 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:49,759 INFO L231 Difference]: Finished difference. Result has 588 places, 601 transitions, 1212 flow [2024-10-24 15:31:49,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:49,761 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -13 predicate places. [2024-10-24 15:31:49,761 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 601 transitions, 1212 flow [2024-10-24 15:31:49,762 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) [2024-10-24 15:31:49,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:49,762 INFO L204 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] [2024-10-24 15:31:49,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:31:49,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:49,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:49,763 INFO L85 PathProgramCache]: Analyzing trace with hash -221744102, now seen corresponding path program 1 times [2024-10-24 15:31:49,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:49,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80762261] [2024-10-24 15:31:49,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:49,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80762261] [2024-10-24 15:31:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80762261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:49,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:49,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432007646] [2024-10-24 15:31:49,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:49,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:49,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:49,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:49,851 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 646 [2024-10-24 15:31:49,853 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) [2024-10-24 15:31:49,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:49,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 646 [2024-10-24 15:31:49,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,009 INFO L124 PetriNetUnfolderBase]: 51/1082 cut-off events. [2024-10-24 15:31:50,011 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-10-24 15:31:50,018 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 5477 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. [2024-10-24 15:31:50,024 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 14 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2024-10-24 15:31:50,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 600 transitions, 1242 flow [2024-10-24 15:31:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2024-10-24 15:31:50,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592363261093911 [2024-10-24 15:31:50,027 INFO L175 Difference]: Start difference. First operand has 588 places, 601 transitions, 1212 flow. Second operand 3 states and 1859 transitions. [2024-10-24 15:31:50,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 600 transitions, 1242 flow [2024-10-24 15:31:50,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 600 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,034 INFO L231 Difference]: Finished difference. Result has 587 places, 600 transitions, 1210 flow [2024-10-24 15:31:50,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:50,036 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -14 predicate places. [2024-10-24 15:31:50,036 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 600 transitions, 1210 flow [2024-10-24 15:31:50,037 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) [2024-10-24 15:31:50,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,038 INFO L204 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] [2024-10-24 15:31:50,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:31:50,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:50,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1688950506, now seen corresponding path program 1 times [2024-10-24 15:31:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234988711] [2024-10-24 15:31:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234988711] [2024-10-24 15:31:50,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234988711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280564525] [2024-10-24 15:31:50,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 646 [2024-10-24 15:31:50,115 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) [2024-10-24 15:31:50,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 646 [2024-10-24 15:31:50,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,406 INFO L124 PetriNetUnfolderBase]: 89/1777 cut-off events. [2024-10-24 15:31:50,406 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-10-24 15:31:50,418 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 11565 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. [2024-10-24 15:31:50,426 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 14 selfloop transitions, 2 changer transitions 0/599 dead transitions. [2024-10-24 15:31:50,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 599 transitions, 1240 flow [2024-10-24 15:31:50,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2024-10-24 15:31:50,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592363261093911 [2024-10-24 15:31:50,430 INFO L175 Difference]: Start difference. First operand has 587 places, 600 transitions, 1210 flow. Second operand 3 states and 1859 transitions. [2024-10-24 15:31:50,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 599 transitions, 1240 flow [2024-10-24 15:31:50,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 599 transitions, 1236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,437 INFO L231 Difference]: Finished difference. Result has 586 places, 599 transitions, 1208 flow [2024-10-24 15:31:50,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:50,439 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -15 predicate places. [2024-10-24 15:31:50,439 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 599 transitions, 1208 flow [2024-10-24 15:31:50,440 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) [2024-10-24 15:31:50,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,440 INFO L204 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] [2024-10-24 15:31:50,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:31:50,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:50,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1808276789, now seen corresponding path program 1 times [2024-10-24 15:31:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717262793] [2024-10-24 15:31:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717262793] [2024-10-24 15:31:50,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717262793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307306198] [2024-10-24 15:31:50,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 646 [2024-10-24 15:31:50,511 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) [2024-10-24 15:31:50,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 646 [2024-10-24 15:31:50,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,624 INFO L124 PetriNetUnfolderBase]: 49/858 cut-off events. [2024-10-24 15:31:50,625 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-24 15:31:50,635 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 3729 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. [2024-10-24 15:31:50,642 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 14 selfloop transitions, 2 changer transitions 0/598 dead transitions. [2024-10-24 15:31:50,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 598 transitions, 1238 flow [2024-10-24 15:31:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2024-10-24 15:31:50,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592363261093911 [2024-10-24 15:31:50,646 INFO L175 Difference]: Start difference. First operand has 586 places, 599 transitions, 1208 flow. Second operand 3 states and 1859 transitions. [2024-10-24 15:31:50,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 598 transitions, 1238 flow [2024-10-24 15:31:50,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 598 transitions, 1234 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,654 INFO L231 Difference]: Finished difference. Result has 585 places, 598 transitions, 1206 flow [2024-10-24 15:31:50,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:50,657 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -16 predicate places. [2024-10-24 15:31:50,657 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 598 transitions, 1206 flow [2024-10-24 15:31:50,659 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) [2024-10-24 15:31:50,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,659 INFO L204 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] [2024-10-24 15:31:50,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:31:50,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -454764843, now seen corresponding path program 1 times [2024-10-24 15:31:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496652247] [2024-10-24 15:31:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496652247] [2024-10-24 15:31:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496652247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366247001] [2024-10-24 15:31:50,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 646 [2024-10-24 15:31:50,722 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) [2024-10-24 15:31:50,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 646 [2024-10-24 15:31:50,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,989 INFO L124 PetriNetUnfolderBase]: 93/1474 cut-off events. [2024-10-24 15:31:50,989 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2024-10-24 15:31:51,007 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 8993 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. [2024-10-24 15:31:51,018 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 16 selfloop transitions, 1 changer transitions 0/593 dead transitions. [2024-10-24 15:31:51,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 593 transitions, 1230 flow [2024-10-24 15:31:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2024-10-24 15:31:51,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95562435500516 [2024-10-24 15:31:51,022 INFO L175 Difference]: Start difference. First operand has 585 places, 598 transitions, 1206 flow. Second operand 3 states and 1852 transitions. [2024-10-24 15:31:51,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 593 transitions, 1230 flow [2024-10-24 15:31:51,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 593 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:51,031 INFO L231 Difference]: Finished difference. Result has 580 places, 593 transitions, 1194 flow [2024-10-24 15:31:51,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:51,032 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2024-10-24 15:31:51,033 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 593 transitions, 1194 flow [2024-10-24 15:31:51,034 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) [2024-10-24 15:31:51,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,034 INFO L204 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] [2024-10-24 15:31:51,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:31:51,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2002101340, now seen corresponding path program 1 times [2024-10-24 15:31:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691584283] [2024-10-24 15:31:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691584283] [2024-10-24 15:31:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691584283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294861357] [2024-10-24 15:31:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-24 15:31:51,131 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) [2024-10-24 15:31:51,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-24 15:31:51,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:51,279 INFO L124 PetriNetUnfolderBase]: 51/1070 cut-off events. [2024-10-24 15:31:51,279 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-24 15:31:51,290 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 5094 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. [2024-10-24 15:31:51,296 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2024-10-24 15:31:51,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 592 transitions, 1222 flow [2024-10-24 15:31:51,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-24 15:31:51,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-24 15:31:51,300 INFO L175 Difference]: Start difference. First operand has 580 places, 593 transitions, 1194 flow. Second operand 3 states and 1861 transitions. [2024-10-24 15:31:51,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 592 transitions, 1222 flow [2024-10-24 15:31:51,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 592 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:31:51,306 INFO L231 Difference]: Finished difference. Result has 580 places, 592 transitions, 1195 flow [2024-10-24 15:31:51,307 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:51,309 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2024-10-24 15:31:51,309 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 592 transitions, 1195 flow [2024-10-24 15:31:51,311 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) [2024-10-24 15:31:51,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,311 INFO L204 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] [2024-10-24 15:31:51,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:31:51,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:51,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1406746314, now seen corresponding path program 1 times [2024-10-24 15:31:51,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773685529] [2024-10-24 15:31:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773685529] [2024-10-24 15:31:51,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773685529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:31:51,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994830638] [2024-10-24 15:31:51,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:31:51,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:31:51,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:31:52,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 646 [2024-10-24 15:31:52,062 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) [2024-10-24 15:31:52,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:52,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 646 [2024-10-24 15:31:52,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:58,942 INFO L124 PetriNetUnfolderBase]: 12846/49114 cut-off events. [2024-10-24 15:31:58,943 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-10-24 15:31:59,288 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 645200 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. [2024-10-24 15:31:59,490 INFO L140 encePairwiseOnDemand]: 628/646 looper letters, 78 selfloop transitions, 15 changer transitions 0/589 dead transitions. [2024-10-24 15:31:59,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 589 transitions, 1375 flow [2024-10-24 15:31:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:31:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:31:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3312 transitions. [2024-10-24 15:31:59,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8544891640866873 [2024-10-24 15:31:59,495 INFO L175 Difference]: Start difference. First operand has 580 places, 592 transitions, 1195 flow. Second operand 6 states and 3312 transitions. [2024-10-24 15:31:59,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 589 transitions, 1375 flow [2024-10-24 15:31:59,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 589 transitions, 1371 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:59,501 INFO L231 Difference]: Finished difference. Result has 580 places, 589 transitions, 1215 flow [2024-10-24 15:31:59,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:59,503 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2024-10-24 15:31:59,503 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 589 transitions, 1215 flow [2024-10-24 15:31:59,505 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) [2024-10-24 15:31:59,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:59,505 INFO L204 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] [2024-10-24 15:31:59,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:31:59,506 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:59,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash 824715001, now seen corresponding path program 1 times [2024-10-24 15:31:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:59,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129491125] [2024-10-24 15:31:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:59,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:59,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:59,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129491125] [2024-10-24 15:31:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129491125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:59,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:59,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:59,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983204801] [2024-10-24 15:31:59,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:59,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:59,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:59,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:59,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:59,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 646 [2024-10-24 15:31:59,568 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) [2024-10-24 15:31:59,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:59,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 646 [2024-10-24 15:31:59,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:59,866 INFO L124 PetriNetUnfolderBase]: 184/2390 cut-off events. [2024-10-24 15:31:59,867 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2024-10-24 15:31:59,895 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 18779 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. [2024-10-24 15:31:59,909 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 16 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2024-10-24 15:31:59,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 584 transitions, 1239 flow [2024-10-24 15:31:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2024-10-24 15:31:59,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95562435500516 [2024-10-24 15:31:59,914 INFO L175 Difference]: Start difference. First operand has 580 places, 589 transitions, 1215 flow. Second operand 3 states and 1852 transitions. [2024-10-24 15:31:59,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 584 transitions, 1239 flow [2024-10-24 15:31:59,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 584 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:31:59,922 INFO L231 Difference]: Finished difference. Result has 572 places, 584 transitions, 1177 flow [2024-10-24 15:31:59,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:31:59,923 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2024-10-24 15:31:59,923 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 584 transitions, 1177 flow [2024-10-24 15:31:59,924 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) [2024-10-24 15:31:59,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:59,925 INFO L204 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] [2024-10-24 15:31:59,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:31:59,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:31:59,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash 376343607, now seen corresponding path program 1 times [2024-10-24 15:31:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145291135] [2024-10-24 15:31:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:59,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145291135] [2024-10-24 15:31:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145291135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:59,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:59,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:59,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13878358] [2024-10-24 15:31:59,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:59,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:59,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:59,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:59,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-24 15:31:59,994 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) [2024-10-24 15:31:59,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:59,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-24 15:31:59,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:00,248 INFO L124 PetriNetUnfolderBase]: 89/1741 cut-off events. [2024-10-24 15:32:00,249 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-24 15:32:00,257 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 10042 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. [2024-10-24 15:32:00,262 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-10-24 15:32:00,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 583 transitions, 1205 flow [2024-10-24 15:32:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-24 15:32:00,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-24 15:32:00,266 INFO L175 Difference]: Start difference. First operand has 572 places, 584 transitions, 1177 flow. Second operand 3 states and 1861 transitions. [2024-10-24 15:32:00,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 583 transitions, 1205 flow [2024-10-24 15:32:00,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 583 transitions, 1204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:00,272 INFO L231 Difference]: Finished difference. Result has 572 places, 583 transitions, 1178 flow [2024-10-24 15:32:00,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:00,273 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2024-10-24 15:32:00,273 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 583 transitions, 1178 flow [2024-10-24 15:32:00,275 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) [2024-10-24 15:32:00,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:00,276 INFO L204 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] [2024-10-24 15:32:00,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:32:00,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:00,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash -376228088, now seen corresponding path program 1 times [2024-10-24 15:32:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237047840] [2024-10-24 15:32:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:00,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:00,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:00,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237047840] [2024-10-24 15:32:00,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237047840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:00,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231554521] [2024-10-24 15:32:00,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:00,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:00,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:00,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 646 [2024-10-24 15:32:00,332 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) [2024-10-24 15:32:00,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:00,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 646 [2024-10-24 15:32:00,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:00,579 INFO L124 PetriNetUnfolderBase]: 167/1866 cut-off events. [2024-10-24 15:32:00,579 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2024-10-24 15:32:00,603 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 12324 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. [2024-10-24 15:32:00,614 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 16 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2024-10-24 15:32:00,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 578 transitions, 1202 flow [2024-10-24 15:32:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2024-10-24 15:32:00,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95562435500516 [2024-10-24 15:32:00,618 INFO L175 Difference]: Start difference. First operand has 572 places, 583 transitions, 1178 flow. Second operand 3 states and 1852 transitions. [2024-10-24 15:32:00,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 578 transitions, 1202 flow [2024-10-24 15:32:00,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 578 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:00,625 INFO L231 Difference]: Finished difference. Result has 567 places, 578 transitions, 1166 flow [2024-10-24 15:32:00,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:00,627 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2024-10-24 15:32:00,627 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 578 transitions, 1166 flow [2024-10-24 15:32:00,628 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) [2024-10-24 15:32:00,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:00,629 INFO L204 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] [2024-10-24 15:32:00,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:32:00,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:00,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1328575772, now seen corresponding path program 1 times [2024-10-24 15:32:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284308597] [2024-10-24 15:32:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284308597] [2024-10-24 15:32:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284308597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:00,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:00,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116857535] [2024-10-24 15:32:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:00,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-24 15:32:00,690 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) [2024-10-24 15:32:00,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:00,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-24 15:32:00,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:00,786 INFO L124 PetriNetUnfolderBase]: 49/829 cut-off events. [2024-10-24 15:32:00,786 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-24 15:32:00,795 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 3187 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. [2024-10-24 15:32:00,799 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-10-24 15:32:00,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 577 transitions, 1194 flow [2024-10-24 15:32:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-24 15:32:00,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-24 15:32:00,802 INFO L175 Difference]: Start difference. First operand has 567 places, 578 transitions, 1166 flow. Second operand 3 states and 1861 transitions. [2024-10-24 15:32:00,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 577 transitions, 1194 flow [2024-10-24 15:32:00,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 577 transitions, 1193 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:00,809 INFO L231 Difference]: Finished difference. Result has 567 places, 577 transitions, 1167 flow [2024-10-24 15:32:00,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:00,810 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2024-10-24 15:32:00,810 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 577 transitions, 1167 flow [2024-10-24 15:32:00,811 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) [2024-10-24 15:32:00,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:00,812 INFO L204 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] [2024-10-24 15:32:00,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:32:00,812 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:00,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash -233536924, now seen corresponding path program 1 times [2024-10-24 15:32:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677802249] [2024-10-24 15:32:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:00,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677802249] [2024-10-24 15:32:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677802249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:00,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:00,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:00,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17534123] [2024-10-24 15:32:00,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:00,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:00,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:00,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:00,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-24 15:32:00,871 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) [2024-10-24 15:32:00,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:00,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-24 15:32:00,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:01,057 INFO L124 PetriNetUnfolderBase]: 96/1554 cut-off events. [2024-10-24 15:32:01,057 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-24 15:32:01,077 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 9869 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. [2024-10-24 15:32:01,087 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 17 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-10-24 15:32:01,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 577 transitions, 1207 flow [2024-10-24 15:32:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2024-10-24 15:32:01,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9607843137254902 [2024-10-24 15:32:01,091 INFO L175 Difference]: Start difference. First operand has 567 places, 577 transitions, 1167 flow. Second operand 3 states and 1862 transitions. [2024-10-24 15:32:01,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 577 transitions, 1207 flow [2024-10-24 15:32:01,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 577 transitions, 1203 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:01,105 INFO L231 Difference]: Finished difference. Result has 564 places, 575 transitions, 1169 flow [2024-10-24 15:32:01,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:01,106 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2024-10-24 15:32:01,106 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 575 transitions, 1169 flow [2024-10-24 15:32:01,107 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) [2024-10-24 15:32:01,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:01,107 INFO L204 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] [2024-10-24 15:32:01,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:32:01,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:01,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1090637786, now seen corresponding path program 1 times [2024-10-24 15:32:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:01,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738799394] [2024-10-24 15:32:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:01,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738799394] [2024-10-24 15:32:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738799394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:01,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:01,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:01,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139856724] [2024-10-24 15:32:01,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:01,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:01,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:01,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:01,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:01,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-24 15:32:01,179 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) [2024-10-24 15:32:01,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:01,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-24 15:32:01,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:01,563 INFO L124 PetriNetUnfolderBase]: 165/2322 cut-off events. [2024-10-24 15:32:01,563 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-24 15:32:01,587 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 18233 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. [2024-10-24 15:32:01,598 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 17 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2024-10-24 15:32:01,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 575 transitions, 1209 flow [2024-10-24 15:32:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2024-10-24 15:32:01,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9607843137254902 [2024-10-24 15:32:01,603 INFO L175 Difference]: Start difference. First operand has 564 places, 575 transitions, 1169 flow. Second operand 3 states and 1862 transitions. [2024-10-24 15:32:01,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 575 transitions, 1209 flow [2024-10-24 15:32:01,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 575 transitions, 1209 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:01,612 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1175 flow [2024-10-24 15:32:01,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:01,615 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2024-10-24 15:32:01,615 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1175 flow [2024-10-24 15:32:01,616 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) [2024-10-24 15:32:01,616 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:01,617 INFO L204 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] [2024-10-24 15:32:01,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 15:32:01,617 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:01,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2109589298, now seen corresponding path program 1 times [2024-10-24 15:32:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:01,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4798357] [2024-10-24 15:32:01,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:01,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4798357] [2024-10-24 15:32:01,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4798357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:01,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338040620] [2024-10-24 15:32:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:01,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:01,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:01,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-24 15:32:01,701 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) [2024-10-24 15:32:01,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:01,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-24 15:32:01,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:02,257 INFO L124 PetriNetUnfolderBase]: 251/3259 cut-off events. [2024-10-24 15:32:02,257 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-10-24 15:32:02,286 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 28522 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. [2024-10-24 15:32:02,299 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 17 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-10-24 15:32:02,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 573 transitions, 1215 flow [2024-10-24 15:32:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2024-10-24 15:32:02,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9607843137254902 [2024-10-24 15:32:02,303 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1175 flow. Second operand 3 states and 1862 transitions. [2024-10-24 15:32:02,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 573 transitions, 1215 flow [2024-10-24 15:32:02,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 573 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:02,312 INFO L231 Difference]: Finished difference. Result has 562 places, 571 transitions, 1181 flow [2024-10-24 15:32:02,312 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:02,313 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2024-10-24 15:32:02,313 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 571 transitions, 1181 flow [2024-10-24 15:32:02,314 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) [2024-10-24 15:32:02,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:02,315 INFO L204 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] [2024-10-24 15:32:02,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 15:32:02,315 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:02,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1556437066, now seen corresponding path program 1 times [2024-10-24 15:32:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:02,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022514665] [2024-10-24 15:32:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:02,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:02,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:02,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022514665] [2024-10-24 15:32:02,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022514665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:02,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:02,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:02,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232055757] [2024-10-24 15:32:02,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:02,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:02,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:02,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:02,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:02,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:02,399 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) [2024-10-24 15:32:02,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:02,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:02,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:02,791 INFO L124 PetriNetUnfolderBase]: 109/2049 cut-off events. [2024-10-24 15:32:02,791 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-10-24 15:32:02,813 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 13367 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. [2024-10-24 15:32:02,822 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2024-10-24 15:32:02,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 572 transitions, 1215 flow [2024-10-24 15:32:02,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-24 15:32:02,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-24 15:32:02,825 INFO L175 Difference]: Start difference. First operand has 562 places, 571 transitions, 1181 flow. Second operand 3 states and 1870 transitions. [2024-10-24 15:32:02,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 572 transitions, 1215 flow [2024-10-24 15:32:02,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 572 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:02,883 INFO L231 Difference]: Finished difference. Result has 563 places, 570 transitions, 1183 flow [2024-10-24 15:32:02,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:02,884 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2024-10-24 15:32:02,884 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 570 transitions, 1183 flow [2024-10-24 15:32:02,888 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) [2024-10-24 15:32:02,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:02,889 INFO L204 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] [2024-10-24 15:32:02,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 15:32:02,889 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:02,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1422458722, now seen corresponding path program 1 times [2024-10-24 15:32:02,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:02,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41090205] [2024-10-24 15:32:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:02,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:02,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:02,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41090205] [2024-10-24 15:32:02,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41090205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:02,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:02,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:32:02,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045957037] [2024-10-24 15:32:02,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:02,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:02,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:02,960 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) [2024-10-24 15:32:02,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:02,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:02,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:03,241 INFO L124 PetriNetUnfolderBase]: 90/1581 cut-off events. [2024-10-24 15:32:03,241 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-24 15:32:03,258 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 10236 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. [2024-10-24 15:32:03,265 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 14 selfloop transitions, 3 changer transitions 0/573 dead transitions. [2024-10-24 15:32:03,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1225 flow [2024-10-24 15:32:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2024-10-24 15:32:03,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659442724458205 [2024-10-24 15:32:03,269 INFO L175 Difference]: Start difference. First operand has 563 places, 570 transitions, 1183 flow. Second operand 3 states and 1872 transitions. [2024-10-24 15:32:03,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1225 flow [2024-10-24 15:32:03,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1221 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:03,278 INFO L231 Difference]: Finished difference. Result has 565 places, 571 transitions, 1197 flow [2024-10-24 15:32:03,279 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:03,280 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2024-10-24 15:32:03,280 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 571 transitions, 1197 flow [2024-10-24 15:32:03,280 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) [2024-10-24 15:32:03,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:03,281 INFO L204 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] [2024-10-24 15:32:03,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 15:32:03,281 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:03,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1600465967, now seen corresponding path program 1 times [2024-10-24 15:32:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:03,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882492622] [2024-10-24 15:32:03,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:03,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:03,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882492622] [2024-10-24 15:32:03,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882492622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:03,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:03,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914454540] [2024-10-24 15:32:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:03,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:03,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:03,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:03,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:03,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-24 15:32:03,346 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) [2024-10-24 15:32:03,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:03,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-24 15:32:03,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:03,937 INFO L124 PetriNetUnfolderBase]: 198/2668 cut-off events. [2024-10-24 15:32:03,937 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2024-10-24 15:32:03,978 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 20123 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. [2024-10-24 15:32:03,994 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 20 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2024-10-24 15:32:03,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 574 transitions, 1252 flow [2024-10-24 15:32:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2024-10-24 15:32:03,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623323013415893 [2024-10-24 15:32:03,997 INFO L175 Difference]: Start difference. First operand has 565 places, 571 transitions, 1197 flow. Second operand 3 states and 1865 transitions. [2024-10-24 15:32:03,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 574 transitions, 1252 flow [2024-10-24 15:32:04,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 574 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:04,007 INFO L231 Difference]: Finished difference. Result has 562 places, 569 transitions, 1197 flow [2024-10-24 15:32:04,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:04,008 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2024-10-24 15:32:04,009 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 569 transitions, 1197 flow [2024-10-24 15:32:04,009 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) [2024-10-24 15:32:04,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:04,010 INFO L204 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] [2024-10-24 15:32:04,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 15:32:04,010 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:04,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash 255300755, now seen corresponding path program 1 times [2024-10-24 15:32:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:04,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087575937] [2024-10-24 15:32:04,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:04,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087575937] [2024-10-24 15:32:04,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087575937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:04,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:04,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:04,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272702129] [2024-10-24 15:32:04,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:04,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:04,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:04,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:04,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:04,081 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) [2024-10-24 15:32:04,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:04,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:04,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:04,626 INFO L124 PetriNetUnfolderBase]: 184/2913 cut-off events. [2024-10-24 15:32:04,626 INFO L125 PetriNetUnfolderBase]: For 18/69 co-relation queries the response was YES. [2024-10-24 15:32:04,663 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 22117 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. [2024-10-24 15:32:04,677 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2024-10-24 15:32:04,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 570 transitions, 1231 flow [2024-10-24 15:32:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-24 15:32:04,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-24 15:32:04,681 INFO L175 Difference]: Start difference. First operand has 562 places, 569 transitions, 1197 flow. Second operand 3 states and 1870 transitions. [2024-10-24 15:32:04,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 570 transitions, 1231 flow [2024-10-24 15:32:04,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 570 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:04,691 INFO L231 Difference]: Finished difference. Result has 563 places, 568 transitions, 1199 flow [2024-10-24 15:32:04,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:04,691 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2024-10-24 15:32:04,692 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 568 transitions, 1199 flow [2024-10-24 15:32:04,692 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) [2024-10-24 15:32:04,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:04,692 INFO L204 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] [2024-10-24 15:32:04,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 15:32:04,693 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:04,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1191988710, now seen corresponding path program 1 times [2024-10-24 15:32:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:04,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152109571] [2024-10-24 15:32:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152109571] [2024-10-24 15:32:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152109571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:04,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:32:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971042097] [2024-10-24 15:32:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:04,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:04,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:04,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:04,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:04,761 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) [2024-10-24 15:32:04,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:04,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:04,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:05,232 INFO L124 PetriNetUnfolderBase]: 154/2283 cut-off events. [2024-10-24 15:32:05,233 INFO L125 PetriNetUnfolderBase]: For 21/54 co-relation queries the response was YES. [2024-10-24 15:32:05,262 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 17166 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. [2024-10-24 15:32:05,274 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 14 selfloop transitions, 3 changer transitions 0/571 dead transitions. [2024-10-24 15:32:05,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 571 transitions, 1241 flow [2024-10-24 15:32:05,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2024-10-24 15:32:05,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659442724458205 [2024-10-24 15:32:05,278 INFO L175 Difference]: Start difference. First operand has 563 places, 568 transitions, 1199 flow. Second operand 3 states and 1872 transitions. [2024-10-24 15:32:05,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 571 transitions, 1241 flow [2024-10-24 15:32:05,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 571 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:05,287 INFO L231 Difference]: Finished difference. Result has 565 places, 569 transitions, 1213 flow [2024-10-24 15:32:05,288 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:05,288 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2024-10-24 15:32:05,288 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 569 transitions, 1213 flow [2024-10-24 15:32:05,289 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) [2024-10-24 15:32:05,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:05,289 INFO L204 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] [2024-10-24 15:32:05,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 15:32:05,290 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:05,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash -141943791, now seen corresponding path program 1 times [2024-10-24 15:32:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:05,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209908237] [2024-10-24 15:32:05,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:05,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:05,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209908237] [2024-10-24 15:32:05,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209908237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:05,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:05,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:05,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554434897] [2024-10-24 15:32:05,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:05,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:05,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:05,358 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) [2024-10-24 15:32:05,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:05,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:05,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:05,838 INFO L124 PetriNetUnfolderBase]: 162/2662 cut-off events. [2024-10-24 15:32:05,839 INFO L125 PetriNetUnfolderBase]: For 18/24 co-relation queries the response was YES. [2024-10-24 15:32:05,871 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 19699 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. [2024-10-24 15:32:05,883 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2024-10-24 15:32:05,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 570 transitions, 1247 flow [2024-10-24 15:32:05,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-24 15:32:05,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-24 15:32:05,886 INFO L175 Difference]: Start difference. First operand has 565 places, 569 transitions, 1213 flow. Second operand 3 states and 1870 transitions. [2024-10-24 15:32:05,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 570 transitions, 1247 flow [2024-10-24 15:32:05,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 570 transitions, 1241 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:05,895 INFO L231 Difference]: Finished difference. Result has 564 places, 568 transitions, 1209 flow [2024-10-24 15:32:05,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:05,896 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2024-10-24 15:32:05,896 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 568 transitions, 1209 flow [2024-10-24 15:32:05,897 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) [2024-10-24 15:32:05,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:05,897 INFO L204 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] [2024-10-24 15:32:05,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 15:32:05,897 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:05,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash 466147290, now seen corresponding path program 1 times [2024-10-24 15:32:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:05,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653291321] [2024-10-24 15:32:05,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:05,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:05,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:05,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653291321] [2024-10-24 15:32:05,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653291321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:05,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:05,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251470952] [2024-10-24 15:32:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:05,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:05,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:05,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:05,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:05,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-24 15:32:05,986 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) [2024-10-24 15:32:05,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:05,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-24 15:32:05,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:06,719 INFO L124 PetriNetUnfolderBase]: 248/3369 cut-off events. [2024-10-24 15:32:06,719 INFO L125 PetriNetUnfolderBase]: For 15/29 co-relation queries the response was YES. [2024-10-24 15:32:06,770 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 26682 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. [2024-10-24 15:32:06,788 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 20 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2024-10-24 15:32:06,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 571 transitions, 1264 flow [2024-10-24 15:32:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2024-10-24 15:32:06,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623323013415893 [2024-10-24 15:32:06,791 INFO L175 Difference]: Start difference. First operand has 564 places, 568 transitions, 1209 flow. Second operand 3 states and 1865 transitions. [2024-10-24 15:32:06,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 571 transitions, 1264 flow [2024-10-24 15:32:06,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 571 transitions, 1260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:06,800 INFO L231 Difference]: Finished difference. Result has 561 places, 566 transitions, 1211 flow [2024-10-24 15:32:06,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:06,800 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -40 predicate places. [2024-10-24 15:32:06,801 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 566 transitions, 1211 flow [2024-10-24 15:32:06,801 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) [2024-10-24 15:32:06,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:06,801 INFO L204 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] [2024-10-24 15:32:06,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 15:32:06,802 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:06,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1604152873, now seen corresponding path program 1 times [2024-10-24 15:32:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:06,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846110993] [2024-10-24 15:32:06,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846110993] [2024-10-24 15:32:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846110993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161082010] [2024-10-24 15:32:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:07,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:07,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:07,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:07,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-24 15:32:07,554 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) [2024-10-24 15:32:07,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:07,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-24 15:32:07,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:08,663 INFO L124 PetriNetUnfolderBase]: 311/4433 cut-off events. [2024-10-24 15:32:08,663 INFO L125 PetriNetUnfolderBase]: For 14/41 co-relation queries the response was YES. [2024-10-24 15:32:08,727 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 39953 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. [2024-10-24 15:32:08,749 INFO L140 encePairwiseOnDemand]: 631/646 looper letters, 70 selfloop transitions, 16 changer transitions 0/605 dead transitions. [2024-10-24 15:32:08,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 605 transitions, 1477 flow [2024-10-24 15:32:08,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:32:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:32:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6532 transitions. [2024-10-24 15:32:08,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192231916690121 [2024-10-24 15:32:08,759 INFO L175 Difference]: Start difference. First operand has 561 places, 566 transitions, 1211 flow. Second operand 11 states and 6532 transitions. [2024-10-24 15:32:08,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 605 transitions, 1477 flow [2024-10-24 15:32:08,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 605 transitions, 1477 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:08,768 INFO L231 Difference]: Finished difference. Result has 576 places, 575 transitions, 1295 flow [2024-10-24 15:32:08,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:08,768 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2024-10-24 15:32:08,769 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 575 transitions, 1295 flow [2024-10-24 15:32:08,770 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) [2024-10-24 15:32:08,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:08,770 INFO L204 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] [2024-10-24 15:32:08,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 15:32:08,770 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:08,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash 852160939, now seen corresponding path program 1 times [2024-10-24 15:32:08,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:08,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105560527] [2024-10-24 15:32:08,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:08,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:08,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:08,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105560527] [2024-10-24 15:32:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105560527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:08,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:08,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:08,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86452297] [2024-10-24 15:32:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:08,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:08,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:08,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:08,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:08,832 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) [2024-10-24 15:32:08,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:08,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:08,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:09,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][495], [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), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), 260#L125true, Black: 688#true, 674#(= |#race~count2~0| 0), 670#(= |#race~count1~0| 0), 732#true, 705#(= |#race~get2~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 (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 668#true]) [2024-10-24 15:32:09,500 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2024-10-24 15:32:09,501 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2024-10-24 15:32:09,501 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2024-10-24 15:32:09,501 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2024-10-24 15:32:09,513 INFO L124 PetriNetUnfolderBase]: 261/3042 cut-off events. [2024-10-24 15:32:09,513 INFO L125 PetriNetUnfolderBase]: For 84/129 co-relation queries the response was YES. [2024-10-24 15:32:09,562 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 68. Compared 24774 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. [2024-10-24 15:32:09,576 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2024-10-24 15:32:09,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 576 transitions, 1329 flow [2024-10-24 15:32:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-24 15:32:09,580 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-24 15:32:09,580 INFO L175 Difference]: Start difference. First operand has 576 places, 575 transitions, 1295 flow. Second operand 3 states and 1870 transitions. [2024-10-24 15:32:09,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 576 transitions, 1329 flow [2024-10-24 15:32:09,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 576 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:09,589 INFO L231 Difference]: Finished difference. Result has 576 places, 574 transitions, 1293 flow [2024-10-24 15:32:09,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:09,590 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2024-10-24 15:32:09,590 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 574 transitions, 1293 flow [2024-10-24 15:32:09,591 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) [2024-10-24 15:32:09,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:09,591 INFO L204 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] [2024-10-24 15:32:09,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 15:32:09,591 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:09,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:09,591 INFO L85 PathProgramCache]: Analyzing trace with hash 843557337, now seen corresponding path program 1 times [2024-10-24 15:32:09,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:09,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359347975] [2024-10-24 15:32:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:09,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:09,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359347975] [2024-10-24 15:32:09,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359347975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:09,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:09,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:09,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006678240] [2024-10-24 15:32:09,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:09,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:09,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:09,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:09,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:09,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:09,657 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) [2024-10-24 15:32:09,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:09,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:09,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:10,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1699] L90-->L90-1: Formula: (= |v_#race~get1~0_7| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_7|} AuxVars[] AssignedVars[#race~get1~0][460], [608#L122-4true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), 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 (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 142#L90-1true, 446#L50-1true, Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 554#L77-6true, 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 688#true, 674#(= |#race~count2~0| 0), 670#(= |#race~count1~0| 0), 732#true, 705#(= |#race~get2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|)]) [2024-10-24 15:32:10,568 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2024-10-24 15:32:10,568 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-10-24 15:32:10,569 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-10-24 15:32:10,569 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-10-24 15:32:10,686 INFO L124 PetriNetUnfolderBase]: 442/6407 cut-off events. [2024-10-24 15:32:10,686 INFO L125 PetriNetUnfolderBase]: For 57/115 co-relation queries the response was YES. [2024-10-24 15:32:10,777 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 62160 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. [2024-10-24 15:32:10,801 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2024-10-24 15:32:10,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 575 transitions, 1327 flow [2024-10-24 15:32:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-24 15:32:10,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-24 15:32:10,804 INFO L175 Difference]: Start difference. First operand has 576 places, 574 transitions, 1293 flow. Second operand 3 states and 1870 transitions. [2024-10-24 15:32:10,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 575 transitions, 1327 flow [2024-10-24 15:32:10,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 575 transitions, 1323 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:10,813 INFO L231 Difference]: Finished difference. Result has 575 places, 573 transitions, 1291 flow [2024-10-24 15:32:10,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, 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} [2024-10-24 15:32:10,814 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -26 predicate places. [2024-10-24 15:32:10,814 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 573 transitions, 1291 flow [2024-10-24 15:32:10,814 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) [2024-10-24 15:32:10,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:10,814 INFO L204 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] [2024-10-24 15:32:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 15:32:10,815 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:10,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1118388864, now seen corresponding path program 1 times [2024-10-24 15:32:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:10,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931433039] [2024-10-24 15:32:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:10,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:10,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:10,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931433039] [2024-10-24 15:32:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931433039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:10,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267541631] [2024-10-24 15:32:10,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:10,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:10,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:10,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:10,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:11,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-24 15:32:11,308 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) [2024-10-24 15:32:11,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:11,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-24 15:32:11,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:12,924 INFO L124 PetriNetUnfolderBase]: 701/8589 cut-off events. [2024-10-24 15:32:12,924 INFO L125 PetriNetUnfolderBase]: For 148/265 co-relation queries the response was YES. [2024-10-24 15:32:13,049 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 161. Compared 94488 event pairs, 122 based on Foata normal form. 16/7594 useless extension candidates. Maximal degree in co-relation 10048. Up to 375 conditions per place. [2024-10-24 15:32:13,090 INFO L140 encePairwiseOnDemand]: 629/646 looper letters, 65 selfloop transitions, 19 changer transitions 0/605 dead transitions. [2024-10-24 15:32:13,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 605 transitions, 1541 flow [2024-10-24 15:32:13,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 15:32:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 15:32:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7112 transitions. [2024-10-24 15:32:13,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9174406604747162 [2024-10-24 15:32:13,100 INFO L175 Difference]: Start difference. First operand has 575 places, 573 transitions, 1291 flow. Second operand 12 states and 7112 transitions. [2024-10-24 15:32:13,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 605 transitions, 1541 flow [2024-10-24 15:32:13,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 605 transitions, 1537 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:13,111 INFO L231 Difference]: Finished difference. Result has 590 places, 583 transitions, 1388 flow [2024-10-24 15:32:13,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1388, PETRI_PLACES=590, PETRI_TRANSITIONS=583} [2024-10-24 15:32:13,112 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -11 predicate places. [2024-10-24 15:32:13,112 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 583 transitions, 1388 flow [2024-10-24 15:32:13,113 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) [2024-10-24 15:32:13,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:13,114 INFO L204 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] [2024-10-24 15:32:13,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 15:32:13,114 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:13,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1328812923, now seen corresponding path program 1 times [2024-10-24 15:32:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:13,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241459499] [2024-10-24 15:32:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:13,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:13,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241459499] [2024-10-24 15:32:13,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241459499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:13,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:32:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054131182] [2024-10-24 15:32:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:13,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:13,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:13,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:13,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:13,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 583 transitions, 1388 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) [2024-10-24 15:32:13,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:13,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:13,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:14,569 INFO L124 PetriNetUnfolderBase]: 700/6568 cut-off events. [2024-10-24 15:32:14,569 INFO L125 PetriNetUnfolderBase]: For 392/463 co-relation queries the response was YES. [2024-10-24 15:32:14,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8252 conditions, 6568 events. 700/6568 cut-off events. For 392/463 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 67515 event pairs, 204 based on Foata normal form. 0/5730 useless extension candidates. Maximal degree in co-relation 8153. Up to 747 conditions per place. [2024-10-24 15:32:14,655 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 14 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2024-10-24 15:32:14,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 586 transitions, 1430 flow [2024-10-24 15:32:14,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2024-10-24 15:32:14,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659442724458205 [2024-10-24 15:32:14,657 INFO L175 Difference]: Start difference. First operand has 590 places, 583 transitions, 1388 flow. Second operand 3 states and 1872 transitions. [2024-10-24 15:32:14,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 586 transitions, 1430 flow [2024-10-24 15:32:14,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 586 transitions, 1430 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:14,665 INFO L231 Difference]: Finished difference. Result has 594 places, 584 transitions, 1406 flow [2024-10-24 15:32:14,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=594, PETRI_TRANSITIONS=584} [2024-10-24 15:32:14,666 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -7 predicate places. [2024-10-24 15:32:14,666 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 584 transitions, 1406 flow [2024-10-24 15:32:14,667 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) [2024-10-24 15:32:14,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:14,667 INFO L204 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] [2024-10-24 15:32:14,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 15:32:14,667 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:14,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1720356786, now seen corresponding path program 1 times [2024-10-24 15:32:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640249182] [2024-10-24 15:32:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640249182] [2024-10-24 15:32:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640249182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:14,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616640469] [2024-10-24 15:32:14,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:14,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:14,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:14,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:14,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:14,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:14,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 584 transitions, 1406 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) [2024-10-24 15:32:14,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:14,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:14,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:15,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][475], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), 769#true, 260#L125true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 688#true, 674#(= |#race~count2~0| 0), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 743#(<= ~n2~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|)), 764#true, Black: 738#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:15,561 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-10-24 15:32:15,561 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-24 15:32:15,561 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-24 15:32:15,561 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-10-24 15:32:15,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][475], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), 769#true, 260#L125true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 668#true, Black: 672#true, 738#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 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|)), 764#true, Black: 743#(<= ~n2~0 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:15,572 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is not cut-off event [2024-10-24 15:32:15,572 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2024-10-24 15:32:15,572 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is not cut-off event [2024-10-24 15:32:15,572 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2024-10-24 15:32:15,585 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][475], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), 769#true, 260#L125true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 668#true, Black: 672#true, 738#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 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|)), 764#true, Black: 743#(<= ~n2~0 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:15,585 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2024-10-24 15:32:15,585 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-24 15:32:15,585 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-10-24 15:32:15,585 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-24 15:32:15,585 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-10-24 15:32:15,589 INFO L124 PetriNetUnfolderBase]: 493/5346 cut-off events. [2024-10-24 15:32:15,589 INFO L125 PetriNetUnfolderBase]: For 318/387 co-relation queries the response was YES. [2024-10-24 15:32:15,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6913 conditions, 5346 events. 493/5346 cut-off events. For 318/387 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 51496 event pairs, 86 based on Foata normal form. 2/4842 useless extension candidates. Maximal degree in co-relation 6812. Up to 416 conditions per place. [2024-10-24 15:32:15,683 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-10-24 15:32:15,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 585 transitions, 1440 flow [2024-10-24 15:32:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-24 15:32:15,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-24 15:32:15,684 INFO L175 Difference]: Start difference. First operand has 594 places, 584 transitions, 1406 flow. Second operand 3 states and 1870 transitions. [2024-10-24 15:32:15,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 585 transitions, 1440 flow [2024-10-24 15:32:15,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 585 transitions, 1434 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:15,694 INFO L231 Difference]: Finished difference. Result has 593 places, 583 transitions, 1402 flow [2024-10-24 15:32:15,695 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=591, 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=1402, PETRI_PLACES=593, PETRI_TRANSITIONS=583} [2024-10-24 15:32:15,695 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -8 predicate places. [2024-10-24 15:32:15,695 INFO L471 AbstractCegarLoop]: Abstraction has has 593 places, 583 transitions, 1402 flow [2024-10-24 15:32:15,696 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) [2024-10-24 15:32:15,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:15,696 INFO L204 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] [2024-10-24 15:32:15,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 15:32:15,696 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:15,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash 292590392, now seen corresponding path program 1 times [2024-10-24 15:32:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:15,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36259315] [2024-10-24 15:32:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:15,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:15,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:15,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36259315] [2024-10-24 15:32:15,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36259315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:15,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:15,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:15,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146998620] [2024-10-24 15:32:15,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:15,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:15,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:16,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-24 15:32:16,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 583 transitions, 1402 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) [2024-10-24 15:32:16,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:16,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-24 15:32:16,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:17,399 INFO L124 PetriNetUnfolderBase]: 603/5602 cut-off events. [2024-10-24 15:32:17,399 INFO L125 PetriNetUnfolderBase]: For 424/521 co-relation queries the response was YES. [2024-10-24 15:32:17,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7616 conditions, 5602 events. 603/5602 cut-off events. For 424/521 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 52427 event pairs, 219 based on Foata normal form. 17/5039 useless extension candidates. Maximal degree in co-relation 7513. Up to 879 conditions per place. [2024-10-24 15:32:17,519 INFO L140 encePairwiseOnDemand]: 631/646 looper letters, 80 selfloop transitions, 16 changer transitions 0/622 dead transitions. [2024-10-24 15:32:17,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 622 transitions, 1722 flow [2024-10-24 15:32:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:32:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:32:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6532 transitions. [2024-10-24 15:32:17,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192231916690121 [2024-10-24 15:32:17,523 INFO L175 Difference]: Start difference. First operand has 593 places, 583 transitions, 1402 flow. Second operand 11 states and 6532 transitions. [2024-10-24 15:32:17,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 622 transitions, 1722 flow [2024-10-24 15:32:17,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 622 transitions, 1718 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:17,534 INFO L231 Difference]: Finished difference. Result has 604 places, 587 transitions, 1461 flow [2024-10-24 15:32:17,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1461, PETRI_PLACES=604, PETRI_TRANSITIONS=587} [2024-10-24 15:32:17,536 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 3 predicate places. [2024-10-24 15:32:17,536 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 587 transitions, 1461 flow [2024-10-24 15:32:17,537 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) [2024-10-24 15:32:17,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:17,537 INFO L204 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] [2024-10-24 15:32:17,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 15:32:17,537 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:17,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash 832058872, now seen corresponding path program 1 times [2024-10-24 15:32:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349642539] [2024-10-24 15:32:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:32:17,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:17,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349642539] [2024-10-24 15:32:17,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349642539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:17,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:17,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:17,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278015435] [2024-10-24 15:32:17,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:17,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:17,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:17,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:17,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:18,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-24 15:32:18,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 587 transitions, 1461 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) [2024-10-24 15:32:18,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:18,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-24 15:32:18,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:19,183 INFO L124 PetriNetUnfolderBase]: 416/5737 cut-off events. [2024-10-24 15:32:19,183 INFO L125 PetriNetUnfolderBase]: For 251/274 co-relation queries the response was YES. [2024-10-24 15:32:19,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7577 conditions, 5737 events. 416/5737 cut-off events. For 251/274 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 53390 event pairs, 66 based on Foata normal form. 2/5260 useless extension candidates. Maximal degree in co-relation 7468. Up to 268 conditions per place. [2024-10-24 15:32:19,281 INFO L140 encePairwiseOnDemand]: 630/646 looper letters, 73 selfloop transitions, 20 changer transitions 0/619 dead transitions. [2024-10-24 15:32:19,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 619 transitions, 1757 flow [2024-10-24 15:32:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:32:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:32:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6525 transitions. [2024-10-24 15:32:19,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9182381086405854 [2024-10-24 15:32:19,285 INFO L175 Difference]: Start difference. First operand has 604 places, 587 transitions, 1461 flow. Second operand 11 states and 6525 transitions. [2024-10-24 15:32:19,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 619 transitions, 1757 flow [2024-10-24 15:32:19,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 619 transitions, 1736 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-24 15:32:19,296 INFO L231 Difference]: Finished difference. Result has 610 places, 595 transitions, 1557 flow [2024-10-24 15:32:19,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1557, PETRI_PLACES=610, PETRI_TRANSITIONS=595} [2024-10-24 15:32:19,297 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 9 predicate places. [2024-10-24 15:32:19,297 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 595 transitions, 1557 flow [2024-10-24 15:32:19,298 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) [2024-10-24 15:32:19,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:19,298 INFO L204 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] [2024-10-24 15:32:19,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 15:32:19,298 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:19,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 587808464, now seen corresponding path program 1 times [2024-10-24 15:32:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:19,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065746055] [2024-10-24 15:32:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:32:19,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065746055] [2024-10-24 15:32:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065746055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:19,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:19,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:19,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582937135] [2024-10-24 15:32:19,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:19,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:19,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:19,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:19,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-24 15:32:19,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 595 transitions, 1557 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) [2024-10-24 15:32:19,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:19,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-24 15:32:19,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:21,835 INFO L124 PetriNetUnfolderBase]: 940/11014 cut-off events. [2024-10-24 15:32:21,835 INFO L125 PetriNetUnfolderBase]: For 830/965 co-relation queries the response was YES. [2024-10-24 15:32:22,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14943 conditions, 11014 events. 940/11014 cut-off events. For 830/965 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 125525 event pairs, 192 based on Foata normal form. 16/10065 useless extension candidates. Maximal degree in co-relation 14829. Up to 594 conditions per place. [2024-10-24 15:32:22,083 INFO L140 encePairwiseOnDemand]: 630/646 looper letters, 70 selfloop transitions, 21 changer transitions 0/624 dead transitions. [2024-10-24 15:32:22,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 624 transitions, 1854 flow [2024-10-24 15:32:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:32:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:32:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2024-10-24 15:32:22,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9169715733183226 [2024-10-24 15:32:22,086 INFO L175 Difference]: Start difference. First operand has 610 places, 595 transitions, 1557 flow. Second operand 11 states and 6516 transitions. [2024-10-24 15:32:22,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 624 transitions, 1854 flow [2024-10-24 15:32:22,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 624 transitions, 1833 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-24 15:32:22,103 INFO L231 Difference]: Finished difference. Result has 618 places, 609 transitions, 1690 flow [2024-10-24 15:32:22,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1690, PETRI_PLACES=618, PETRI_TRANSITIONS=609} [2024-10-24 15:32:22,104 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 17 predicate places. [2024-10-24 15:32:22,104 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 609 transitions, 1690 flow [2024-10-24 15:32:22,105 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) [2024-10-24 15:32:22,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:22,105 INFO L204 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] [2024-10-24 15:32:22,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 15:32:22,105 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:22,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 708054489, now seen corresponding path program 1 times [2024-10-24 15:32:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:22,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182503638] [2024-10-24 15:32:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:32:22,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182503638] [2024-10-24 15:32:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182503638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:22,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:22,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186370487] [2024-10-24 15:32:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:22,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:22,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:22,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:22,664 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-24 15:32:22,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 609 transitions, 1690 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) [2024-10-24 15:32:22,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:22,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-24 15:32:22,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:24,119 INFO L124 PetriNetUnfolderBase]: 761/7083 cut-off events. [2024-10-24 15:32:24,120 INFO L125 PetriNetUnfolderBase]: For 1205/1325 co-relation queries the response was YES. [2024-10-24 15:32:24,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10452 conditions, 7083 events. 761/7083 cut-off events. For 1205/1325 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 69357 event pairs, 234 based on Foata normal form. 0/6462 useless extension candidates. Maximal degree in co-relation 10331. Up to 915 conditions per place. [2024-10-24 15:32:24,252 INFO L140 encePairwiseOnDemand]: 630/646 looper letters, 69 selfloop transitions, 20 changer transitions 0/632 dead transitions. [2024-10-24 15:32:24,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 632 transitions, 1960 flow [2024-10-24 15:32:24,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:32:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:32:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2024-10-24 15:32:24,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9169715733183226 [2024-10-24 15:32:24,255 INFO L175 Difference]: Start difference. First operand has 618 places, 609 transitions, 1690 flow. Second operand 11 states and 6516 transitions. [2024-10-24 15:32:24,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 632 transitions, 1960 flow [2024-10-24 15:32:24,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 632 transitions, 1956 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:24,269 INFO L231 Difference]: Finished difference. Result has 630 places, 617 transitions, 1803 flow [2024-10-24 15:32:24,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1803, PETRI_PLACES=630, PETRI_TRANSITIONS=617} [2024-10-24 15:32:24,271 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 29 predicate places. [2024-10-24 15:32:24,271 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 617 transitions, 1803 flow [2024-10-24 15:32:24,271 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) [2024-10-24 15:32:24,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:24,272 INFO L204 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] [2024-10-24 15:32:24,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 15:32:24,272 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:24,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1656765210, now seen corresponding path program 1 times [2024-10-24 15:32:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:24,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111896996] [2024-10-24 15:32:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111896996] [2024-10-24 15:32:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111896996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:24,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:24,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:24,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508318398] [2024-10-24 15:32:24,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:24,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:24,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:24,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:25,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-24 15:32:25,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 617 transitions, 1803 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) [2024-10-24 15:32:25,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:25,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-24 15:32:25,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:26,872 INFO L124 PetriNetUnfolderBase]: 682/9716 cut-off events. [2024-10-24 15:32:26,872 INFO L125 PetriNetUnfolderBase]: For 1969/2051 co-relation queries the response was YES. [2024-10-24 15:32:27,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13886 conditions, 9716 events. 682/9716 cut-off events. For 1969/2051 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 101804 event pairs, 45 based on Foata normal form. 10/9035 useless extension candidates. Maximal degree in co-relation 13761. Up to 286 conditions per place. [2024-10-24 15:32:27,122 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/624 dead transitions. [2024-10-24 15:32:27,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 624 transitions, 1925 flow [2024-10-24 15:32:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-24 15:32:27,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-24 15:32:27,124 INFO L175 Difference]: Start difference. First operand has 630 places, 617 transitions, 1803 flow. Second operand 6 states and 3626 transitions. [2024-10-24 15:32:27,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 624 transitions, 1925 flow [2024-10-24 15:32:27,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 624 transitions, 1904 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-24 15:32:27,150 INFO L231 Difference]: Finished difference. Result has 627 places, 616 transitions, 1801 flow [2024-10-24 15:32:27,150 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=621, 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=1801, PETRI_PLACES=627, PETRI_TRANSITIONS=616} [2024-10-24 15:32:27,151 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 26 predicate places. [2024-10-24 15:32:27,151 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 616 transitions, 1801 flow [2024-10-24 15:32:27,151 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) [2024-10-24 15:32:27,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:27,152 INFO L204 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] [2024-10-24 15:32:27,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 15:32:27,153 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:27,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1453958017, now seen corresponding path program 1 times [2024-10-24 15:32:27,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167530486] [2024-10-24 15:32:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:27,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167530486] [2024-10-24 15:32:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167530486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:27,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:27,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885301577] [2024-10-24 15:32:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:27,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:27,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-24 15:32:27,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 616 transitions, 1801 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) [2024-10-24 15:32:27,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:27,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-24 15:32:27,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:29,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1699] L90-->L90-1: Formula: (= |v_#race~get1~0_7| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_7|} AuxVars[] AssignedVars[#race~get1~0][549], [608#L122-4true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), 658#(= |#race~n2~0| 0), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 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: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~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: 777#(<= ~n1~0 0), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 866#true, 142#L90-1true, Black: 668#true, Black: 848#(<= ~n3~0 0), 446#L50-1true, Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 672#true, 738#true, Black: 676#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 125#L76true, 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 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: 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|)), 873#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:29,866 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2024-10-24 15:32:29,866 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2024-10-24 15:32:29,866 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2024-10-24 15:32:29,866 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-10-24 15:32:29,879 INFO L124 PetriNetUnfolderBase]: 734/10389 cut-off events. [2024-10-24 15:32:29,880 INFO L125 PetriNetUnfolderBase]: For 2056/2229 co-relation queries the response was YES. [2024-10-24 15:32:30,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14707 conditions, 10389 events. 734/10389 cut-off events. For 2056/2229 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 110282 event pairs, 70 based on Foata normal form. 11/9607 useless extension candidates. Maximal degree in co-relation 14582. Up to 376 conditions per place. [2024-10-24 15:32:30,129 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/623 dead transitions. [2024-10-24 15:32:30,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 623 transitions, 1923 flow [2024-10-24 15:32:30,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-24 15:32:30,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-24 15:32:30,137 INFO L175 Difference]: Start difference. First operand has 627 places, 616 transitions, 1801 flow. Second operand 6 states and 3626 transitions. [2024-10-24 15:32:30,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 623 transitions, 1923 flow [2024-10-24 15:32:30,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 623 transitions, 1910 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-24 15:32:30,167 INFO L231 Difference]: Finished difference. Result has 627 places, 615 transitions, 1807 flow [2024-10-24 15:32:30,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1784, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1807, PETRI_PLACES=627, PETRI_TRANSITIONS=615} [2024-10-24 15:32:30,168 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 26 predicate places. [2024-10-24 15:32:30,169 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 615 transitions, 1807 flow [2024-10-24 15:32:30,169 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) [2024-10-24 15:32:30,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:30,169 INFO L204 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] [2024-10-24 15:32:30,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-24 15:32:30,170 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:30,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:30,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1389230815, now seen corresponding path program 1 times [2024-10-24 15:32:30,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:30,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496984948] [2024-10-24 15:32:30,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:30,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:30,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496984948] [2024-10-24 15:32:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496984948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:30,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:30,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332853713] [2024-10-24 15:32:30,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:30,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:30,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:30,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:30,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-24 15:32:30,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 615 transitions, 1807 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) [2024-10-24 15:32:30,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:30,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-24 15:32:30,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:32,180 INFO L124 PetriNetUnfolderBase]: 774/9776 cut-off events. [2024-10-24 15:32:32,180 INFO L125 PetriNetUnfolderBase]: For 1380/1405 co-relation queries the response was YES. [2024-10-24 15:32:32,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13354 conditions, 9776 events. 774/9776 cut-off events. For 1380/1405 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 96775 event pairs, 86 based on Foata normal form. 0/9037 useless extension candidates. Maximal degree in co-relation 13229. Up to 557 conditions per place. [2024-10-24 15:32:32,421 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 19 selfloop transitions, 2 changer transitions 0/617 dead transitions. [2024-10-24 15:32:32,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 617 transitions, 1857 flow [2024-10-24 15:32:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1864 transitions. [2024-10-24 15:32:32,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9618163054695562 [2024-10-24 15:32:32,423 INFO L175 Difference]: Start difference. First operand has 627 places, 615 transitions, 1807 flow. Second operand 3 states and 1864 transitions. [2024-10-24 15:32:32,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 617 transitions, 1857 flow [2024-10-24 15:32:32,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 617 transitions, 1844 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-24 15:32:32,439 INFO L231 Difference]: Finished difference. Result has 622 places, 613 transitions, 1800 flow [2024-10-24 15:32:32,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1800, PETRI_PLACES=622, PETRI_TRANSITIONS=613} [2024-10-24 15:32:32,444 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 21 predicate places. [2024-10-24 15:32:32,444 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 613 transitions, 1800 flow [2024-10-24 15:32:32,444 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) [2024-10-24 15:32:32,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:32,444 INFO L204 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] [2024-10-24 15:32:32,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-24 15:32:32,444 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:32,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1926704244, now seen corresponding path program 1 times [2024-10-24 15:32:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:32,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125966777] [2024-10-24 15:32:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:32,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:32,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125966777] [2024-10-24 15:32:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125966777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:32,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:32,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253521796] [2024-10-24 15:32:32,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:32,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:32,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:33,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-24 15:32:33,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 613 transitions, 1800 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) [2024-10-24 15:32:33,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:33,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-24 15:32:33,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:35,283 INFO L124 PetriNetUnfolderBase]: 747/10933 cut-off events. [2024-10-24 15:32:35,283 INFO L125 PetriNetUnfolderBase]: For 2136/2222 co-relation queries the response was YES. [2024-10-24 15:32:35,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15529 conditions, 10933 events. 747/10933 cut-off events. For 2136/2222 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 114743 event pairs, 52 based on Foata normal form. 10/10261 useless extension candidates. Maximal degree in co-relation 15403. Up to 314 conditions per place. [2024-10-24 15:32:35,422 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/619 dead transitions. [2024-10-24 15:32:35,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 619 transitions, 1916 flow [2024-10-24 15:32:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-24 15:32:35,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-24 15:32:35,425 INFO L175 Difference]: Start difference. First operand has 622 places, 613 transitions, 1800 flow. Second operand 6 states and 3626 transitions. [2024-10-24 15:32:35,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 619 transitions, 1916 flow [2024-10-24 15:32:35,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 619 transitions, 1916 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:35,443 INFO L231 Difference]: Finished difference. Result has 625 places, 611 transitions, 1808 flow [2024-10-24 15:32:35,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1808, PETRI_PLACES=625, PETRI_TRANSITIONS=611} [2024-10-24 15:32:35,444 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 24 predicate places. [2024-10-24 15:32:35,444 INFO L471 AbstractCegarLoop]: Abstraction has has 625 places, 611 transitions, 1808 flow [2024-10-24 15:32:35,445 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) [2024-10-24 15:32:35,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:35,446 INFO L204 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] [2024-10-24 15:32:35,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 15:32:35,446 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:35,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:35,449 INFO L85 PathProgramCache]: Analyzing trace with hash -351660666, now seen corresponding path program 1 times [2024-10-24 15:32:35,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:35,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947938870] [2024-10-24 15:32:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:35,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947938870] [2024-10-24 15:32:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947938870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:35,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789818758] [2024-10-24 15:32:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:35,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:36,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-24 15:32:36,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 611 transitions, 1808 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) [2024-10-24 15:32:36,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:36,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-24 15:32:36,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:37,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: 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[][589], [658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), Black: 668#true, 884#true, Black: 672#true, 577#L124true, Black: 676#true, 664#(= |#race~n3~0| 0), 325#L90-4true, Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, 892#(= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0), Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:37,585 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-10-24 15:32:37,585 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-10-24 15:32:37,585 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-24 15:32:37,585 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-24 15:32:37,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: 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[][593], [658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), 893#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 668#true, 884#true, Black: 672#true, 577#L124true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 144#L90-5true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:37,589 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-10-24 15:32:37,589 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:37,589 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-10-24 15:32:37,589 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:37,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: 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[][597], [658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), Black: 668#true, 884#true, Black: 672#true, 577#L124true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 894#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 878#(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)), 417#L90-6true, Black: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:37,593 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-10-24 15:32:37,593 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:37,593 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2024-10-24 15:32:37,593 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:37,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: 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), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), Black: 668#true, 884#true, Black: 672#true, 577#L124true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), 116#L90-7true, Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:37,598 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2024-10-24 15:32:37,598 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-10-24 15:32:37,598 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2024-10-24 15:32:37,598 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-10-24 15:32:37,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: 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), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), Black: 668#true, 884#true, Black: 672#true, 577#L124true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 605#L90-8true, Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:37,602 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-10-24 15:32:37,602 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2024-10-24 15:32:37,602 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-24 15:32:37,602 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-24 15:32:37,626 INFO L124 PetriNetUnfolderBase]: 711/7183 cut-off events. [2024-10-24 15:32:37,626 INFO L125 PetriNetUnfolderBase]: For 2215/2451 co-relation queries the response was YES. [2024-10-24 15:32:37,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10910 conditions, 7183 events. 711/7183 cut-off events. For 2215/2451 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 69878 event pairs, 97 based on Foata normal form. 33/6784 useless extension candidates. Maximal degree in co-relation 10783. Up to 461 conditions per place. [2024-10-24 15:32:37,776 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/618 dead transitions. [2024-10-24 15:32:37,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 618 transitions, 1930 flow [2024-10-24 15:32:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-24 15:32:37,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-24 15:32:37,779 INFO L175 Difference]: Start difference. First operand has 625 places, 611 transitions, 1808 flow. Second operand 6 states and 3626 transitions. [2024-10-24 15:32:37,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 618 transitions, 1930 flow [2024-10-24 15:32:37,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 618 transitions, 1918 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:32:37,794 INFO L231 Difference]: Finished difference. Result has 624 places, 610 transitions, 1815 flow [2024-10-24 15:32:37,794 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1815, PETRI_PLACES=624, PETRI_TRANSITIONS=610} [2024-10-24 15:32:37,794 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 23 predicate places. [2024-10-24 15:32:37,795 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 610 transitions, 1815 flow [2024-10-24 15:32:37,795 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) [2024-10-24 15:32:37,795 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:37,795 INFO L204 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] [2024-10-24 15:32:37,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-24 15:32:37,795 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:37,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash 417647269, now seen corresponding path program 1 times [2024-10-24 15:32:37,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:37,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928086977] [2024-10-24 15:32:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:37,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:38,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928086977] [2024-10-24 15:32:38,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928086977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:38,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:38,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:38,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540509600] [2024-10-24 15:32:38,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:38,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:38,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:38,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:38,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-24 15:32:38,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 610 transitions, 1815 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) [2024-10-24 15:32:38,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:38,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-24 15:32:38,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:40,502 INFO L124 PetriNetUnfolderBase]: 778/10893 cut-off events. [2024-10-24 15:32:40,502 INFO L125 PetriNetUnfolderBase]: For 2430/2608 co-relation queries the response was YES. [2024-10-24 15:32:40,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16061 conditions, 10893 events. 778/10893 cut-off events. For 2430/2608 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 117180 event pairs, 76 based on Foata normal form. 15/10289 useless extension candidates. Maximal degree in co-relation 15933. Up to 419 conditions per place. [2024-10-24 15:32:40,733 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/616 dead transitions. [2024-10-24 15:32:40,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 616 transitions, 1931 flow [2024-10-24 15:32:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-24 15:32:40,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-24 15:32:40,736 INFO L175 Difference]: Start difference. First operand has 624 places, 610 transitions, 1815 flow. Second operand 6 states and 3626 transitions. [2024-10-24 15:32:40,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 616 transitions, 1931 flow [2024-10-24 15:32:40,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 616 transitions, 1918 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-24 15:32:40,763 INFO L231 Difference]: Finished difference. Result has 623 places, 608 transitions, 1810 flow [2024-10-24 15:32:40,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1798, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1810, PETRI_PLACES=623, PETRI_TRANSITIONS=608} [2024-10-24 15:32:40,764 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 22 predicate places. [2024-10-24 15:32:40,764 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 608 transitions, 1810 flow [2024-10-24 15:32:40,765 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) [2024-10-24 15:32:40,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:40,765 INFO L204 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] [2024-10-24 15:32:40,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-24 15:32:40,765 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:40,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1407047757, now seen corresponding path program 1 times [2024-10-24 15:32:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880990658] [2024-10-24 15:32:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:40,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:40,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:40,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880990658] [2024-10-24 15:32:40,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880990658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:40,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:40,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464004552] [2024-10-24 15:32:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:40,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:40,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:40,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:40,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 646 [2024-10-24 15:32:40,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 608 transitions, 1810 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) [2024-10-24 15:32:40,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:40,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 646 [2024-10-24 15:32:40,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:42,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][432], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), 260#L125true, Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), 903#true, Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(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)), 897#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 (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:42,728 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-10-24 15:32:42,728 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-10-24 15:32:42,729 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:42,729 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:42,756 INFO L124 PetriNetUnfolderBase]: 683/10524 cut-off events. [2024-10-24 15:32:42,756 INFO L125 PetriNetUnfolderBase]: For 1910/1945 co-relation queries the response was YES. [2024-10-24 15:32:42,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14931 conditions, 10524 events. 683/10524 cut-off events. For 1910/1945 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 109098 event pairs, 51 based on Foata normal form. 0/9956 useless extension candidates. Maximal degree in co-relation 14804. Up to 320 conditions per place. [2024-10-24 15:32:43,009 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 10 selfloop transitions, 1 changer transitions 0/607 dead transitions. [2024-10-24 15:32:43,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 607 transitions, 1830 flow [2024-10-24 15:32:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2024-10-24 15:32:43,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659442724458205 [2024-10-24 15:32:43,011 INFO L175 Difference]: Start difference. First operand has 623 places, 608 transitions, 1810 flow. Second operand 3 states and 1872 transitions. [2024-10-24 15:32:43,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 607 transitions, 1830 flow [2024-10-24 15:32:43,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 607 transitions, 1818 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:32:43,035 INFO L231 Difference]: Finished difference. Result has 619 places, 607 transitions, 1798 flow [2024-10-24 15:32:43,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1798, PETRI_PLACES=619, PETRI_TRANSITIONS=607} [2024-10-24 15:32:43,036 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 18 predicate places. [2024-10-24 15:32:43,036 INFO L471 AbstractCegarLoop]: Abstraction has has 619 places, 607 transitions, 1798 flow [2024-10-24 15:32:43,037 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) [2024-10-24 15:32:43,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:43,037 INFO L204 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] [2024-10-24 15:32:43,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-24 15:32:43,037 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:43,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1962186028, now seen corresponding path program 1 times [2024-10-24 15:32:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:43,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58558446] [2024-10-24 15:32:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:43,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:43,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:43,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58558446] [2024-10-24 15:32:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58558446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:43,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737126186] [2024-10-24 15:32:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:43,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-24 15:32:43,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 607 transitions, 1798 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) [2024-10-24 15:32:43,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:43,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-24 15:32:43,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:45,124 INFO L124 PetriNetUnfolderBase]: 636/6942 cut-off events. [2024-10-24 15:32:45,125 INFO L125 PetriNetUnfolderBase]: For 2268/2480 co-relation queries the response was YES. [2024-10-24 15:32:45,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10543 conditions, 6942 events. 636/6942 cut-off events. For 2268/2480 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 66694 event pairs, 97 based on Foata normal form. 41/6642 useless extension candidates. Maximal degree in co-relation 10415. Up to 467 conditions per place. [2024-10-24 15:32:45,290 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/613 dead transitions. [2024-10-24 15:32:45,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 613 transitions, 1914 flow [2024-10-24 15:32:45,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-24 15:32:45,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-24 15:32:45,293 INFO L175 Difference]: Start difference. First operand has 619 places, 607 transitions, 1798 flow. Second operand 6 states and 3626 transitions. [2024-10-24 15:32:45,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 613 transitions, 1914 flow [2024-10-24 15:32:45,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 613 transitions, 1913 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:45,310 INFO L231 Difference]: Finished difference. Result has 621 places, 605 transitions, 1805 flow [2024-10-24 15:32:45,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1793, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1805, PETRI_PLACES=621, PETRI_TRANSITIONS=605} [2024-10-24 15:32:45,310 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 20 predicate places. [2024-10-24 15:32:45,311 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 605 transitions, 1805 flow [2024-10-24 15:32:45,311 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) [2024-10-24 15:32:45,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:45,311 INFO L204 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] [2024-10-24 15:32:45,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-24 15:32:45,311 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:45,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:45,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1337140498, now seen corresponding path program 1 times [2024-10-24 15:32:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453721710] [2024-10-24 15:32:45,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:45,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:45,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:45,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453721710] [2024-10-24 15:32:45,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453721710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:45,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:45,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:45,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95430289] [2024-10-24 15:32:45,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:45,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:45,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:45,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:45,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:45,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 646 [2024-10-24 15:32:45,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 605 transitions, 1805 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) [2024-10-24 15:32:45,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:45,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 646 [2024-10-24 15:32:45,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:47,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][432], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 906#true, 882#(= |#race~get3~0| 0), 260#L125true, Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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)), 912#true, Black: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:47,390 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-10-24 15:32:47,390 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:47,390 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-10-24 15:32:47,390 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:47,405 INFO L124 PetriNetUnfolderBase]: 688/10505 cut-off events. [2024-10-24 15:32:47,405 INFO L125 PetriNetUnfolderBase]: For 1868/1938 co-relation queries the response was YES. [2024-10-24 15:32:47,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15089 conditions, 10505 events. 688/10505 cut-off events. For 1868/1938 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 110011 event pairs, 76 based on Foata normal form. 0/10006 useless extension candidates. Maximal degree in co-relation 14962. Up to 384 conditions per place. [2024-10-24 15:32:47,677 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 10 selfloop transitions, 1 changer transitions 0/604 dead transitions. [2024-10-24 15:32:47,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 604 transitions, 1825 flow [2024-10-24 15:32:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2024-10-24 15:32:47,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659442724458205 [2024-10-24 15:32:47,679 INFO L175 Difference]: Start difference. First operand has 621 places, 605 transitions, 1805 flow. Second operand 3 states and 1872 transitions. [2024-10-24 15:32:47,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 604 transitions, 1825 flow [2024-10-24 15:32:47,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 604 transitions, 1813 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:32:47,707 INFO L231 Difference]: Finished difference. Result has 617 places, 604 transitions, 1793 flow [2024-10-24 15:32:47,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1793, PETRI_PLACES=617, PETRI_TRANSITIONS=604} [2024-10-24 15:32:47,708 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 16 predicate places. [2024-10-24 15:32:47,708 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 604 transitions, 1793 flow [2024-10-24 15:32:47,709 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) [2024-10-24 15:32:47,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:47,709 INFO L204 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] [2024-10-24 15:32:47,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-24 15:32:47,709 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:47,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2009011021, now seen corresponding path program 1 times [2024-10-24 15:32:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:47,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69804046] [2024-10-24 15:32:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69804046] [2024-10-24 15:32:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69804046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:47,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:47,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:32:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016221229] [2024-10-24 15:32:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:47,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:32:47,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:32:47,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:32:47,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 646 [2024-10-24 15:32:47,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 604 transitions, 1793 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) [2024-10-24 15:32:47,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:47,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 646 [2024-10-24 15:32:47,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:48,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][432], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), 260#L125true, Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 915#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 912#true, Black: 878#(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: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:48,897 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-10-24 15:32:48,897 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-10-24 15:32:48,897 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:48,897 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:48,901 INFO L124 PetriNetUnfolderBase]: 345/5842 cut-off events. [2024-10-24 15:32:48,901 INFO L125 PetriNetUnfolderBase]: For 996/1031 co-relation queries the response was YES. [2024-10-24 15:32:49,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8282 conditions, 5842 events. 345/5842 cut-off events. For 996/1031 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 51584 event pairs, 7 based on Foata normal form. 15/5609 useless extension candidates. Maximal degree in co-relation 8154. Up to 158 conditions per place. [2024-10-24 15:32:49,026 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 12 selfloop transitions, 0 changer transitions 2/605 dead transitions. [2024-10-24 15:32:49,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 605 transitions, 1823 flow [2024-10-24 15:32:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:32:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 15:32:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2471 transitions. [2024-10-24 15:32:49,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9562693498452013 [2024-10-24 15:32:49,028 INFO L175 Difference]: Start difference. First operand has 617 places, 604 transitions, 1793 flow. Second operand 4 states and 2471 transitions. [2024-10-24 15:32:49,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 605 transitions, 1823 flow [2024-10-24 15:32:49,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 605 transitions, 1822 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:49,044 INFO L231 Difference]: Finished difference. Result has 621 places, 603 transitions, 1794 flow [2024-10-24 15:32:49,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1794, PETRI_PLACES=621, PETRI_TRANSITIONS=603} [2024-10-24 15:32:49,045 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 20 predicate places. [2024-10-24 15:32:49,045 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 603 transitions, 1794 flow [2024-10-24 15:32:49,045 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) [2024-10-24 15:32:49,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:49,046 INFO L204 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] [2024-10-24 15:32:49,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-24 15:32:49,046 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:49,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash 169432210, now seen corresponding path program 1 times [2024-10-24 15:32:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850921410] [2024-10-24 15:32:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:49,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:49,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850921410] [2024-10-24 15:32:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850921410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:49,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:49,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122917315] [2024-10-24 15:32:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:49,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:49,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:49,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:49,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 646 [2024-10-24 15:32:49,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 603 transitions, 1794 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) [2024-10-24 15:32:49,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:49,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 646 [2024-10-24 15:32:49,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:50,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1708] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][394], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 917#(not |ULTIMATE.start_main_#t~short52#1|), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), Black: 920#(and (not |ULTIMATE.start_main_#t~short53#1|) (not |ULTIMATE.start_main_#t~short52#1|)), Black: 668#true, Black: 672#true, 577#L124true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 915#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 493#L97-7true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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)), 923#true, Black: 880#true, 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: 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:50,297 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-10-24 15:32:50,297 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:50,298 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:50,298 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2024-10-24 15:32:50,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][432], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), 260#L125true, Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 917#(not |ULTIMATE.start_main_#t~short52#1|), Black: 920#(and (not |ULTIMATE.start_main_#t~short53#1|) (not |ULTIMATE.start_main_#t~short52#1|)), Black: 777#(<= ~n1~0 0), Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 915#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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)), 923#true, Black: 880#true, 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: 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:50,325 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-10-24 15:32:50,325 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-10-24 15:32:50,325 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is cut-off event [2024-10-24 15:32:50,325 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-10-24 15:32:50,327 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][432], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), 260#L125true, Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 917#(not |ULTIMATE.start_main_#t~short52#1|), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), Black: 920#(and (not |ULTIMATE.start_main_#t~short53#1|) (not |ULTIMATE.start_main_#t~short52#1|)), Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 915#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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)), 923#true, Black: 880#true, 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: 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:50,327 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-10-24 15:32:50,327 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:50,327 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-10-24 15:32:50,327 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:50,327 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:50,332 INFO L124 PetriNetUnfolderBase]: 464/6048 cut-off events. [2024-10-24 15:32:50,332 INFO L125 PetriNetUnfolderBase]: For 1071/1122 co-relation queries the response was YES. [2024-10-24 15:32:50,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 6048 events. 464/6048 cut-off events. For 1071/1122 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56110 event pairs, 98 based on Foata normal form. 15/5754 useless extension candidates. Maximal degree in co-relation 8708. Up to 389 conditions per place. [2024-10-24 15:32:50,473 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 8 selfloop transitions, 0 changer transitions 21/602 dead transitions. [2024-10-24 15:32:50,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 602 transitions, 1812 flow [2024-10-24 15:32:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2024-10-24 15:32:50,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9654282765737874 [2024-10-24 15:32:50,475 INFO L175 Difference]: Start difference. First operand has 621 places, 603 transitions, 1794 flow. Second operand 3 states and 1871 transitions. [2024-10-24 15:32:50,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 602 transitions, 1812 flow [2024-10-24 15:32:50,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 602 transitions, 1808 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:50,491 INFO L231 Difference]: Finished difference. Result has 618 places, 581 transitions, 1657 flow [2024-10-24 15:32:50,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1657, PETRI_PLACES=618, PETRI_TRANSITIONS=581} [2024-10-24 15:32:50,492 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 17 predicate places. [2024-10-24 15:32:50,492 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 581 transitions, 1657 flow [2024-10-24 15:32:50,492 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) [2024-10-24 15:32:50,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:50,492 INFO L204 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] [2024-10-24 15:32:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-24 15:32:50,492 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:50,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2123814525, now seen corresponding path program 1 times [2024-10-24 15:32:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094416404] [2024-10-24 15:32:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:50,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:50,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094416404] [2024-10-24 15:32:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094416404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:50,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:50,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366181931] [2024-10-24 15:32:50,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:50,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:50,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:50,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 581 transitions, 1657 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) [2024-10-24 15:32:50,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:50,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:50,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:52,415 INFO L124 PetriNetUnfolderBase]: 625/9646 cut-off events. [2024-10-24 15:32:52,415 INFO L125 PetriNetUnfolderBase]: For 1365/1391 co-relation queries the response was YES. [2024-10-24 15:32:52,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13387 conditions, 9646 events. 625/9646 cut-off events. For 1365/1391 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 96785 event pairs, 53 based on Foata normal form. 0/9218 useless extension candidates. Maximal degree in co-relation 13346. Up to 279 conditions per place. [2024-10-24 15:32:52,641 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 11 selfloop transitions, 2 changer transitions 14/582 dead transitions. [2024-10-24 15:32:52,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 582 transitions, 1687 flow [2024-10-24 15:32:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2024-10-24 15:32:52,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638802889576883 [2024-10-24 15:32:52,643 INFO L175 Difference]: Start difference. First operand has 618 places, 581 transitions, 1657 flow. Second operand 3 states and 1868 transitions. [2024-10-24 15:32:52,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 582 transitions, 1687 flow [2024-10-24 15:32:52,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 582 transitions, 1671 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:52,664 INFO L231 Difference]: Finished difference. Result has 605 places, 566 transitions, 1539 flow [2024-10-24 15:32:52,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1539, PETRI_PLACES=605, PETRI_TRANSITIONS=566} [2024-10-24 15:32:52,665 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 4 predicate places. [2024-10-24 15:32:52,665 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 566 transitions, 1539 flow [2024-10-24 15:32:52,665 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) [2024-10-24 15:32:52,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:52,666 INFO L204 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] [2024-10-24 15:32:52,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-24 15:32:52,666 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1124151461, now seen corresponding path program 1 times [2024-10-24 15:32:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190221092] [2024-10-24 15:32:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:52,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:52,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:52,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190221092] [2024-10-24 15:32:52,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190221092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:52,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:52,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:52,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197178276] [2024-10-24 15:32:52,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:52,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:52,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:52,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:52,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:52,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 566 transitions, 1539 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) [2024-10-24 15:32:52,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:52,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:52,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:54,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1699] L90-->L90-1: Formula: (= |v_#race~get1~0_7| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_7|} AuxVars[] AssignedVars[#race~get1~0][476], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), 142#L90-1true, Black: 668#true, Black: 672#true, 926#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 915#true, 249#L77-7true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 608#L122-4true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), 446#L50-1true, Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, 929#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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)), 923#true, Black: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:54,127 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-10-24 15:32:54,127 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-10-24 15:32:54,127 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2024-10-24 15:32:54,127 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-10-24 15:32:54,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1492] L50-8-->L50-9: Formula: (= |v_#race~get2~0_1| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_1|} AuxVars[] AssignedVars[#race~get2~0][464], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), 142#L90-1true, Black: 668#true, Black: 672#true, 926#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 915#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 111#L50-9true, 608#L122-4true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, 929#true, 567#L70-1true, Black: 878#(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)), 923#true, Black: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:54,199 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-10-24 15:32:54,199 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-10-24 15:32:54,199 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-10-24 15:32:54,199 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:54,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: 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[][420], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), 142#L90-1true, Black: 668#true, Black: 672#true, 577#L124true, 926#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 915#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, 929#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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)), 923#true, Black: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:54,216 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-10-24 15:32:54,216 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2024-10-24 15:32:54,216 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-10-24 15:32:54,216 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-10-24 15:32:54,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1595] L77-6-->L77-7: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_7|) 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_7|} AuxVars[] AssignedVars[#race~res2~0][350], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 658#(= |#race~n2~0| 0), 882#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 777#(<= ~n1~0 0), 142#L90-1true, Black: 668#true, Black: 672#true, 926#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 915#true, 198#L123-1true, 249#L77-7true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 837#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 823#(<= ~n3~0 0), Black: 824#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 831#(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: 829#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 848#(<= ~n3~0 0), Black: 862#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 849#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#true, 929#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 878#(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)), 923#true, Black: 880#true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:54,217 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2024-10-24 15:32:54,217 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:54,217 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-10-24 15:32:54,217 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:54,217 INFO L124 PetriNetUnfolderBase]: 536/7958 cut-off events. [2024-10-24 15:32:54,217 INFO L125 PetriNetUnfolderBase]: For 859/899 co-relation queries the response was YES. [2024-10-24 15:32:54,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10862 conditions, 7958 events. 536/7958 cut-off events. For 859/899 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 77383 event pairs, 63 based on Foata normal form. 1/7620 useless extension candidates. Maximal degree in co-relation 10820. Up to 233 conditions per place. [2024-10-24 15:32:54,356 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 11 selfloop transitions, 2 changer transitions 12/567 dead transitions. [2024-10-24 15:32:54,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 567 transitions, 1569 flow [2024-10-24 15:32:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2024-10-24 15:32:54,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638802889576883 [2024-10-24 15:32:54,358 INFO L175 Difference]: Start difference. First operand has 605 places, 566 transitions, 1539 flow. Second operand 3 states and 1868 transitions. [2024-10-24 15:32:54,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 567 transitions, 1569 flow [2024-10-24 15:32:54,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 567 transitions, 1517 flow, removed 16 selfloop flow, removed 13 redundant places. [2024-10-24 15:32:54,377 INFO L231 Difference]: Finished difference. Result has 586 places, 553 transitions, 1413 flow [2024-10-24 15:32:54,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1413, PETRI_PLACES=586, PETRI_TRANSITIONS=553} [2024-10-24 15:32:54,378 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -15 predicate places. [2024-10-24 15:32:54,378 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 553 transitions, 1413 flow [2024-10-24 15:32:54,378 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) [2024-10-24 15:32:54,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:54,378 INFO L204 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] [2024-10-24 15:32:54,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-24 15:32:54,378 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-10-24 15:32:54,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash 206480901, now seen corresponding path program 1 times [2024-10-24 15:32:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838954314] [2024-10-24 15:32:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838954314] [2024-10-24 15:32:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838954314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258356074] [2024-10-24 15:32:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:54,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:54,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-24 15:32:54,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 553 transitions, 1413 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) [2024-10-24 15:32:54,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:54,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-24 15:32:54,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:55,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1492] L50-8-->L50-9: Formula: (= |v_#race~get2~0_1| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_1|} AuxVars[] AssignedVars[#race~get2~0][430], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), 608#L122-4true, 111#L50-9true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 829#(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)), 882#(= |#race~get3~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: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~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: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 777#(<= ~n1~0 0), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 142#L90-1true, Black: 668#true, 932#true, Black: 672#true, 738#true, 929#true, Black: 676#true, 567#L70-1true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 878#(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), 923#true, Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, Black: 880#true, 674#(= |#race~count2~0| 0), 915#true, 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: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:55,073 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-10-24 15:32:55,073 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-10-24 15:32:55,073 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-10-24 15:32:55,073 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:55,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1708] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][397], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 703#true, 493#L97-7true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 829#(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)), 882#(= |#race~get3~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: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~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: 777#(<= ~n1~0 0), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 668#true, 932#true, Black: 672#true, 738#true, 929#true, Black: 676#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 664#(= |#race~n3~0| 0), 567#L70-1true, Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 878#(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), 923#true, Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, Black: 880#true, 674#(= |#race~count2~0| 0), 915#true, 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), 198#L123-1true, 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: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:55,093 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2024-10-24 15:32:55,093 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-10-24 15:32:55,093 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:55,093 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:55,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1708] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][397], [Black: 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 703#true, 493#L97-7true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 829#(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)), 882#(= |#race~get3~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: 778#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 791#(and (<= ~n1~0 0) (not |thread3Thread1of1ForFork1_#t~short19|) (= thread3Thread1of1ForFork1_~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 (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 777#(<= ~n1~0 0), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 668#true, 932#true, Black: 672#true, 738#true, 577#L124true, 929#true, Black: 676#true, Black: 871#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork2_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 878#(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), 923#true, Black: 814#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 688#true, Black: 880#true, 674#(= |#race~count2~0| 0), 915#true, 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: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 766#(not |thread3Thread1of1ForFork1_#t~short19|)]) [2024-10-24 15:32:55,094 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2024-10-24 15:32:55,094 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:55,094 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:55,094 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:55,094 INFO L124 PetriNetUnfolderBase]: 300/3535 cut-off events. [2024-10-24 15:32:55,094 INFO L125 PetriNetUnfolderBase]: For 235/277 co-relation queries the response was YES. [2024-10-24 15:32:55,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4717 conditions, 3535 events. 300/3535 cut-off events. For 235/277 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 27851 event pairs, 62 based on Foata normal form. 1/3358 useless extension candidates. Maximal degree in co-relation 4682. Up to 213 conditions per place. [2024-10-24 15:32:55,158 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 0 selfloop transitions, 0 changer transitions 554/554 dead transitions. [2024-10-24 15:32:55,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 554 transitions, 1443 flow [2024-10-24 15:32:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2024-10-24 15:32:55,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638802889576883 [2024-10-24 15:32:55,159 INFO L175 Difference]: Start difference. First operand has 586 places, 553 transitions, 1413 flow. Second operand 3 states and 1868 transitions. [2024-10-24 15:32:55,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 554 transitions, 1443 flow [2024-10-24 15:32:55,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 554 transitions, 1397 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-10-24 15:32:55,167 INFO L231 Difference]: Finished difference. Result has 567 places, 0 transitions, 0 flow [2024-10-24 15:32:55,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=565, 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=567, PETRI_TRANSITIONS=0} [2024-10-24 15:32:55,168 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2024-10-24 15:32:55,168 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 0 transitions, 0 flow [2024-10-24 15:32:55,169 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) [2024-10-24 15:32:55,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (134 of 135 remaining) [2024-10-24 15:32:55,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (133 of 135 remaining) [2024-10-24 15:32:55,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (132 of 135 remaining) [2024-10-24 15:32:55,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (131 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (130 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (129 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (128 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (127 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (126 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (125 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (124 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (123 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (122 of 135 remaining) [2024-10-24 15:32:55,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (121 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (120 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (119 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (118 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (117 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (116 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (115 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (114 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (113 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (112 of 135 remaining) [2024-10-24 15:32:55,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (111 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (110 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (109 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (108 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (107 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (106 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (105 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (104 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (103 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (102 of 135 remaining) [2024-10-24 15:32:55,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (101 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (100 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (99 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (98 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (97 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (96 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (95 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (93 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (92 of 135 remaining) [2024-10-24 15:32:55,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (91 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (90 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (89 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (88 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (87 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (86 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (85 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (84 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (83 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (82 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (81 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (80 of 135 remaining) [2024-10-24 15:32:55,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (79 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (78 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (77 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (76 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (75 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (74 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (73 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (72 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (71 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (70 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (69 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (68 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (67 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (66 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (65 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (64 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (63 of 135 remaining) [2024-10-24 15:32:55,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (62 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (61 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (60 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (52 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (51 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (49 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (48 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (46 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 135 remaining) [2024-10-24 15:32:55,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 135 remaining) [2024-10-24 15:32:55,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 135 remaining) [2024-10-24 15:32:55,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (42 of 135 remaining) [2024-10-24 15:32:55,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (41 of 135 remaining) [2024-10-24 15:32:55,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (40 of 135 remaining) [2024-10-24 15:32:55,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 135 remaining) [2024-10-24 15:32:55,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (38 of 135 remaining) [2024-10-24 15:32:55,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 135 remaining) [2024-10-24 15:32:55,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 135 remaining) [2024-10-24 15:32:55,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 135 remaining) [2024-10-24 15:32:55,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 135 remaining) [2024-10-24 15:32:55,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (33 of 135 remaining) [2024-10-24 15:32:55,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (32 of 135 remaining) [2024-10-24 15:32:55,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (31 of 135 remaining) [2024-10-24 15:32:55,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (30 of 135 remaining) [2024-10-24 15:32:55,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (29 of 135 remaining) [2024-10-24 15:32:55,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 135 remaining) [2024-10-24 15:32:55,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (18 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (17 of 135 remaining) [2024-10-24 15:32:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 135 remaining) [2024-10-24 15:32:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 135 remaining) [2024-10-24 15:32:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (14 of 135 remaining) [2024-10-24 15:32:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 135 remaining) [2024-10-24 15:32:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 135 remaining) [2024-10-24 15:32:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (11 of 135 remaining) [2024-10-24 15:32:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (10 of 135 remaining) [2024-10-24 15:32:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 135 remaining) [2024-10-24 15:32:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (8 of 135 remaining) [2024-10-24 15:32:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 135 remaining) [2024-10-24 15:32:55,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 135 remaining) [2024-10-24 15:32:55,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 135 remaining) [2024-10-24 15:32:55,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 135 remaining) [2024-10-24 15:32:55,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 135 remaining) [2024-10-24 15:32:55,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 135 remaining) [2024-10-24 15:32:55,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 135 remaining) [2024-10-24 15:32:55,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 135 remaining) [2024-10-24 15:32:55,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-24 15:32:55,184 INFO L407 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] [2024-10-24 15:32:55,189 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 15:32:55,189 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:32:55,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:32:55 BasicIcfg [2024-10-24 15:32:55,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:32:55,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:32:55,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:32:55,195 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:32:55,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:31:48" (3/4) ... [2024-10-24 15:32:55,196 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 15:32:55,199 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-24 15:32:55,199 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-24 15:32:55,200 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-24 15:32:55,205 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-10-24 15:32:55,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 15:32:55,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 15:32:55,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 15:32:55,301 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 15:32:55,301 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 15:32:55,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:32:55,302 INFO L158 Benchmark]: Toolchain (without parser) took 68681.63ms. Allocated memory was 209.7MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 157.0MB in the beginning and 6.0GB in the end (delta: -5.8GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-10-24 15:32:55,302 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:32:55,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.96ms. Allocated memory is still 209.7MB. Free memory was 156.6MB in the beginning and 140.8MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 15:32:55,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.07ms. Allocated memory is still 209.7MB. Free memory was 140.8MB in the beginning and 138.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:32:55,302 INFO L158 Benchmark]: Boogie Preprocessor took 55.32ms. Allocated memory is still 209.7MB. Free memory was 138.3MB in the beginning and 134.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 15:32:55,302 INFO L158 Benchmark]: RCFGBuilder took 959.55ms. Allocated memory is still 209.7MB. Free memory was 134.9MB in the beginning and 171.5MB in the end (delta: -36.6MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2024-10-24 15:32:55,302 INFO L158 Benchmark]: TraceAbstraction took 67187.62ms. Allocated memory was 209.7MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 171.5MB in the beginning and 6.0GB in the end (delta: -5.8GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-10-24 15:32:55,303 INFO L158 Benchmark]: Witness Printer took 106.82ms. Allocated memory is still 7.7GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 15:32:55,304 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.14ms. Allocated memory is still 134.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.96ms. Allocated memory is still 209.7MB. Free memory was 156.6MB in the beginning and 140.8MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.07ms. Allocated memory is still 209.7MB. Free memory was 140.8MB in the beginning and 138.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.32ms. Allocated memory is still 209.7MB. Free memory was 138.3MB in the beginning and 134.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 959.55ms. Allocated memory is still 209.7MB. Free memory was 134.9MB in the beginning and 171.5MB in the end (delta: -36.6MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * TraceAbstraction took 67187.62ms. Allocated memory was 209.7MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 171.5MB in the beginning and 6.0GB in the end (delta: -5.8GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 106.82ms. Allocated memory is still 7.7GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 7.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: 67.0s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 61.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7057 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4439 mSDsluCounter, 6903 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6451 mSDsCounter, 1346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11301 IncrementalHoareTripleChecker+Invalid, 12647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1346 mSolverCounterUnsat, 452 mSDtfsCounter, 11301 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=1815occurred in iteration=38, InterpolantAutomatonStates: 212, 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, 4.4s InterpolantComputationTime, 8709 NumberOfCodeBlocks, 8709 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 8662 ConstructedInterpolants, 0 QuantifiedInterpolants, 10758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 23/23 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 - AllSpecificationsHoldResult: All specifications hold 75 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 15:32:55,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE