./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:58:26,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:58:26,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:58:26,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:58:26,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:58:26,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:58:26,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:58:26,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:58:26,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:58:26,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:58:26,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:58:26,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:58:26,196 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:58:26,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:58:26,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:58:26,198 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:58:26,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:58:26,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:58:26,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:58:26,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:58:26,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:58:26,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:58:26,204 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:58:26,204 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:58:26,204 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:58:26,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:58:26,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:58:26,205 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:58:26,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:58:26,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:58:26,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:58:26,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:26,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:58:26,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:58:26,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:58:26,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:58:26,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:58:26,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:58:26,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:58:26,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:58:26,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:58:26,209 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-13 09:58:26,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:58:26,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:58:26,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:58:26,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:58:26,494 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:58:26,495 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-13 09:58:27,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:58:28,115 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:58:28,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2024-10-13 09:58:28,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3e66e44/e7b97eaab5d64cb8b315585be5d3bfe9/FLAGa8a8c715b [2024-10-13 09:58:28,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3e66e44/e7b97eaab5d64cb8b315585be5d3bfe9 [2024-10-13 09:58:28,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:58:28,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:58:28,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:28,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:58:28,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:58:28,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518fddd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28, skipping insertion in model container [2024-10-13 09:58:28,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:58:28,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:28,440 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:58:28,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:28,497 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:58:28,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28 WrapperNode [2024-10-13 09:58:28,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:28,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:28,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:58:28,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:58:28,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,555 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 244 [2024-10-13 09:58:28,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:28,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:58:28,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:58:28,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:58:28,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:58:28,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:58:28,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:58:28,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:58:28,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:28,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:58:28,663 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-13 09:58:28,666 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-13 09:58:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:58:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:58:28,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:58:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:58:28,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:58:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:58:28,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:58:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:58:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:58:28,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:58:28,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:58:28,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:58:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:58:28,718 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:58:28,839 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:58:28,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:58:29,650 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:58:29,651 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:58:29,695 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:58:29,697 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 09:58:29,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:29 BoogieIcfgContainer [2024-10-13 09:58:29,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:58:29,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:58:29,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:58:29,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:58:29,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:58:28" (1/3) ... [2024-10-13 09:58:29,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d58c7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:29, skipping insertion in model container [2024-10-13 09:58:29,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (2/3) ... [2024-10-13 09:58:29,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d58c7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:29, skipping insertion in model container [2024-10-13 09:58:29,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:29" (3/3) ... [2024-10-13 09:58:29,711 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2024-10-13 09:58:29,728 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:58:29,729 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2024-10-13 09:58:29,729 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:58:29,902 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:58:29,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 623 places, 646 transitions, 1313 flow [2024-10-13 09:58:30,184 INFO L124 PetriNetUnfolderBase]: 33/643 cut-off events. [2024-10-13 09:58:30,185 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:58:30,206 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-13 09:58:30,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 623 places, 646 transitions, 1313 flow [2024-10-13 09:58:30,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 601 places, 622 transitions, 1262 flow [2024-10-13 09:58:30,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:58:30,247 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;@8f17be8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:58:30,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2024-10-13 09:58:30,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:58:30,253 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-13 09:58:30,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:58:30,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,254 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-13 09:58:30,255 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-13 09:58:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2016546986, now seen corresponding path program 1 times [2024-10-13 09:58:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113378185] [2024-10-13 09:58:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,502 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-13 09:58:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113378185] [2024-10-13 09:58:30,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113378185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965383119] [2024-10-13 09:58:30,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:30,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-13 09:58:30,621 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-13 09:58:30,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:30,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-13 09:58:30,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:30,919 INFO L124 PetriNetUnfolderBase]: 51/1065 cut-off events. [2024-10-13 09:58:30,920 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-13 09:58:30,937 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-13 09:58:30,951 INFO L140 encePairwiseOnDemand]: 631/646 looper letters, 13 selfloop transitions, 2 changer transitions 6/609 dead transitions. [2024-10-13 09:58:30,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 609 transitions, 1266 flow [2024-10-13 09:58:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1873 transitions. [2024-10-13 09:58:30,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9664602683178535 [2024-10-13 09:58:30,981 INFO L175 Difference]: Start difference. First operand has 601 places, 622 transitions, 1262 flow. Second operand 3 states and 1873 transitions. [2024-10-13 09:58:30,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 609 transitions, 1266 flow [2024-10-13 09:58:30,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-13 09:58:31,004 INFO L231 Difference]: Finished difference. Result has 596 places, 603 transitions, 1216 flow [2024-10-13 09:58:31,007 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-13 09:58:31,010 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -5 predicate places. [2024-10-13 09:58:31,011 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 603 transitions, 1216 flow [2024-10-13 09:58:31,012 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-13 09:58:31,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,015 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-13 09:58:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:58:31,015 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-13 09:58:31,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2142014687, now seen corresponding path program 1 times [2024-10-13 09:58:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781749134] [2024-10-13 09:58:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,094 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-13 09:58:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781749134] [2024-10-13 09:58:31,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781749134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368943281] [2024-10-13 09:58:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-13 09:58:31,142 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-13 09:58:31,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-13 09:58:31,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,477 INFO L124 PetriNetUnfolderBase]: 79/1490 cut-off events. [2024-10-13 09:58:31,477 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:58:31,498 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-13 09:58:31,518 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2024-10-13 09:58:31,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 602 transitions, 1244 flow [2024-10-13 09:58:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-13 09:58:31,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-13 09:58:31,524 INFO L175 Difference]: Start difference. First operand has 596 places, 603 transitions, 1216 flow. Second operand 3 states and 1861 transitions. [2024-10-13 09:58:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 602 transitions, 1244 flow [2024-10-13 09:58:31,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 602 transitions, 1240 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:31,533 INFO L231 Difference]: Finished difference. Result has 589 places, 602 transitions, 1214 flow [2024-10-13 09:58:31,534 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-13 09:58:31,534 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -12 predicate places. [2024-10-13 09:58:31,535 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 602 transitions, 1214 flow [2024-10-13 09:58:31,536 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-13 09:58:31,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,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] [2024-10-13 09:58:31,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:58:31,537 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-13 09:58:31,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1394337867, now seen corresponding path program 1 times [2024-10-13 09:58:31,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915963217] [2024-10-13 09:58:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,603 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-13 09:58:31,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915963217] [2024-10-13 09:58:31,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915963217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714437016] [2024-10-13 09:58:31,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-13 09:58:31,661 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-13 09:58:31,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-13 09:58:31,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,941 INFO L124 PetriNetUnfolderBase]: 79/1477 cut-off events. [2024-10-13 09:58:31,941 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-13 09:58:31,961 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-13 09:58:31,973 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2024-10-13 09:58:31,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 601 transitions, 1242 flow [2024-10-13 09:58:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-13 09:58:31,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-13 09:58:31,979 INFO L175 Difference]: Start difference. First operand has 589 places, 602 transitions, 1214 flow. Second operand 3 states and 1861 transitions. [2024-10-13 09:58:31,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 601 transitions, 1242 flow [2024-10-13 09:58:31,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 601 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:31,991 INFO L231 Difference]: Finished difference. Result has 588 places, 601 transitions, 1212 flow [2024-10-13 09:58:31,992 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-13 09:58:31,994 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -13 predicate places. [2024-10-13 09:58:31,995 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 601 transitions, 1212 flow [2024-10-13 09:58:31,996 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-13 09:58:31,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,997 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-13 09:58:31,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:58:31,997 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-13 09:58:31,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash -221744102, now seen corresponding path program 1 times [2024-10-13 09:58:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438431552] [2024-10-13 09:58:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,058 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-13 09:58:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438431552] [2024-10-13 09:58:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438431552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144888742] [2024-10-13 09:58:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 646 [2024-10-13 09:58:32,105 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-13 09:58:32,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 646 [2024-10-13 09:58:32,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,316 INFO L124 PetriNetUnfolderBase]: 51/1082 cut-off events. [2024-10-13 09:58:32,317 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-10-13 09:58:32,333 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-13 09:58:32,343 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 14 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2024-10-13 09:58:32,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 600 transitions, 1242 flow [2024-10-13 09:58:32,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2024-10-13 09:58:32,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592363261093911 [2024-10-13 09:58:32,347 INFO L175 Difference]: Start difference. First operand has 588 places, 601 transitions, 1212 flow. Second operand 3 states and 1859 transitions. [2024-10-13 09:58:32,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 600 transitions, 1242 flow [2024-10-13 09:58:32,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 600 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:32,357 INFO L231 Difference]: Finished difference. Result has 587 places, 600 transitions, 1210 flow [2024-10-13 09:58:32,358 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-13 09:58:32,359 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -14 predicate places. [2024-10-13 09:58:32,360 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 600 transitions, 1210 flow [2024-10-13 09:58:32,361 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-13 09:58:32,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,362 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-13 09:58:32,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:58:32,362 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-13 09:58:32,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1688950506, now seen corresponding path program 1 times [2024-10-13 09:58:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581617107] [2024-10-13 09:58:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,420 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-13 09:58:32,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581617107] [2024-10-13 09:58:32,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581617107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039790403] [2024-10-13 09:58:32,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 646 [2024-10-13 09:58:32,470 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-13 09:58:32,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 646 [2024-10-13 09:58:32,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,817 INFO L124 PetriNetUnfolderBase]: 89/1777 cut-off events. [2024-10-13 09:58:32,817 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-10-13 09:58:32,844 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-13 09:58:32,859 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 14 selfloop transitions, 2 changer transitions 0/599 dead transitions. [2024-10-13 09:58:32,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 599 transitions, 1240 flow [2024-10-13 09:58:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2024-10-13 09:58:32,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592363261093911 [2024-10-13 09:58:32,864 INFO L175 Difference]: Start difference. First operand has 587 places, 600 transitions, 1210 flow. Second operand 3 states and 1859 transitions. [2024-10-13 09:58:32,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 599 transitions, 1240 flow [2024-10-13 09:58:32,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 599 transitions, 1236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:32,875 INFO L231 Difference]: Finished difference. Result has 586 places, 599 transitions, 1208 flow [2024-10-13 09:58:32,876 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-13 09:58:32,877 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -15 predicate places. [2024-10-13 09:58:32,877 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 599 transitions, 1208 flow [2024-10-13 09:58:32,879 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-13 09:58:32,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,879 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-13 09:58:32,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:58:32,879 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-13 09:58:32,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1808276789, now seen corresponding path program 1 times [2024-10-13 09:58:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324203788] [2024-10-13 09:58:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,931 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-13 09:58:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324203788] [2024-10-13 09:58:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324203788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636743886] [2024-10-13 09:58:32,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 646 [2024-10-13 09:58:32,974 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-13 09:58:32,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 646 [2024-10-13 09:58:32,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:33,187 INFO L124 PetriNetUnfolderBase]: 49/858 cut-off events. [2024-10-13 09:58:33,188 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-13 09:58:33,201 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-13 09:58:33,209 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 14 selfloop transitions, 2 changer transitions 0/598 dead transitions. [2024-10-13 09:58:33,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 598 transitions, 1238 flow [2024-10-13 09:58:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2024-10-13 09:58:33,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592363261093911 [2024-10-13 09:58:33,214 INFO L175 Difference]: Start difference. First operand has 586 places, 599 transitions, 1208 flow. Second operand 3 states and 1859 transitions. [2024-10-13 09:58:33,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 598 transitions, 1238 flow [2024-10-13 09:58:33,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 598 transitions, 1234 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:33,223 INFO L231 Difference]: Finished difference. Result has 585 places, 598 transitions, 1206 flow [2024-10-13 09:58:33,224 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-13 09:58:33,225 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -16 predicate places. [2024-10-13 09:58:33,225 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 598 transitions, 1206 flow [2024-10-13 09:58:33,226 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-13 09:58:33,227 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:33,227 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-13 09:58:33,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:58:33,227 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-13 09:58:33,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -454764843, now seen corresponding path program 1 times [2024-10-13 09:58:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:33,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145911514] [2024-10-13 09:58:33,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:33,273 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-13 09:58:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145911514] [2024-10-13 09:58:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145911514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:33,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:33,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328791502] [2024-10-13 09:58:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:33,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:33,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:33,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:33,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:33,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 646 [2024-10-13 09:58:33,298 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-13 09:58:33,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:33,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 646 [2024-10-13 09:58:33,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:33,596 INFO L124 PetriNetUnfolderBase]: 93/1474 cut-off events. [2024-10-13 09:58:33,596 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2024-10-13 09:58:33,616 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-13 09:58:33,627 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 16 selfloop transitions, 1 changer transitions 0/593 dead transitions. [2024-10-13 09:58:33,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 593 transitions, 1230 flow [2024-10-13 09:58:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2024-10-13 09:58:33,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95562435500516 [2024-10-13 09:58:33,632 INFO L175 Difference]: Start difference. First operand has 585 places, 598 transitions, 1206 flow. Second operand 3 states and 1852 transitions. [2024-10-13 09:58:33,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 593 transitions, 1230 flow [2024-10-13 09:58:33,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 593 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:33,641 INFO L231 Difference]: Finished difference. Result has 580 places, 593 transitions, 1194 flow [2024-10-13 09:58:33,641 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-13 09:58:33,642 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2024-10-13 09:58:33,642 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 593 transitions, 1194 flow [2024-10-13 09:58:33,644 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-13 09:58:33,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:33,644 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-13 09:58:33,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:58:33,645 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-13 09:58:33,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2002101340, now seen corresponding path program 1 times [2024-10-13 09:58:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:33,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468492958] [2024-10-13 09:58:33,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:33,707 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-13 09:58:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468492958] [2024-10-13 09:58:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468492958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:33,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:33,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:33,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854570571] [2024-10-13 09:58:33,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:33,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:33,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:33,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:33,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-13 09:58:33,737 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-13 09:58:33,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:33,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-13 09:58:33,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:33,940 INFO L124 PetriNetUnfolderBase]: 51/1070 cut-off events. [2024-10-13 09:58:33,941 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-13 09:58:33,949 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-13 09:58:33,955 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2024-10-13 09:58:33,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 592 transitions, 1222 flow [2024-10-13 09:58:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-13 09:58:33,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-13 09:58:33,959 INFO L175 Difference]: Start difference. First operand has 580 places, 593 transitions, 1194 flow. Second operand 3 states and 1861 transitions. [2024-10-13 09:58:33,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 592 transitions, 1222 flow [2024-10-13 09:58:33,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 592 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:33,967 INFO L231 Difference]: Finished difference. Result has 580 places, 592 transitions, 1195 flow [2024-10-13 09:58:33,968 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-13 09:58:33,969 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2024-10-13 09:58:33,969 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 592 transitions, 1195 flow [2024-10-13 09:58:33,971 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-13 09:58:33,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:33,971 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-13 09:58:33,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:58:33,971 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-13 09:58:33,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1406746314, now seen corresponding path program 1 times [2024-10-13 09:58:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:33,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55192079] [2024-10-13 09:58:33,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:34,516 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-13 09:58:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:34,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55192079] [2024-10-13 09:58:34,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55192079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:34,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:34,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:58:34,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906327319] [2024-10-13 09:58:34,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:34,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:58:34,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:34,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:58:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:58:34,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 646 [2024-10-13 09:58:34,959 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-13 09:58:34,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:34,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 646 [2024-10-13 09:58:34,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:43,161 INFO L124 PetriNetUnfolderBase]: 12846/49114 cut-off events. [2024-10-13 09:58:43,162 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-10-13 09:58:43,410 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-13 09:58:43,690 INFO L140 encePairwiseOnDemand]: 628/646 looper letters, 78 selfloop transitions, 15 changer transitions 0/589 dead transitions. [2024-10-13 09:58:43,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 589 transitions, 1375 flow [2024-10-13 09:58:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:58:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:58:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3312 transitions. [2024-10-13 09:58:43,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8544891640866873 [2024-10-13 09:58:43,698 INFO L175 Difference]: Start difference. First operand has 580 places, 592 transitions, 1195 flow. Second operand 6 states and 3312 transitions. [2024-10-13 09:58:43,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 589 transitions, 1375 flow [2024-10-13 09:58:43,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 589 transitions, 1371 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:43,708 INFO L231 Difference]: Finished difference. Result has 580 places, 589 transitions, 1215 flow [2024-10-13 09:58:43,709 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-13 09:58:43,710 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2024-10-13 09:58:43,710 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 589 transitions, 1215 flow [2024-10-13 09:58:43,712 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-13 09:58:43,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:43,712 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-13 09:58:43,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:58:43,713 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-13 09:58:43,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash 824715001, now seen corresponding path program 1 times [2024-10-13 09:58:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394476534] [2024-10-13 09:58:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:43,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:43,758 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-13 09:58:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394476534] [2024-10-13 09:58:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394476534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:43,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:43,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970573081] [2024-10-13 09:58:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:43,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:43,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:43,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 646 [2024-10-13 09:58:43,788 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-13 09:58:43,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:43,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 646 [2024-10-13 09:58:43,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:44,301 INFO L124 PetriNetUnfolderBase]: 184/2390 cut-off events. [2024-10-13 09:58:44,301 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2024-10-13 09:58:44,327 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-13 09:58:44,341 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 16 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2024-10-13 09:58:44,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 584 transitions, 1239 flow [2024-10-13 09:58:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2024-10-13 09:58:44,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95562435500516 [2024-10-13 09:58:44,347 INFO L175 Difference]: Start difference. First operand has 580 places, 589 transitions, 1215 flow. Second operand 3 states and 1852 transitions. [2024-10-13 09:58:44,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 584 transitions, 1239 flow [2024-10-13 09:58:44,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 584 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:58:44,356 INFO L231 Difference]: Finished difference. Result has 572 places, 584 transitions, 1177 flow [2024-10-13 09:58:44,358 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-13 09:58:44,359 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2024-10-13 09:58:44,359 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 584 transitions, 1177 flow [2024-10-13 09:58:44,361 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-13 09:58:44,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:44,361 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-13 09:58:44,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:58:44,361 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-13 09:58:44,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:44,361 INFO L85 PathProgramCache]: Analyzing trace with hash 376343607, now seen corresponding path program 1 times [2024-10-13 09:58:44,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:44,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553862967] [2024-10-13 09:58:44,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:44,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:44,412 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-13 09:58:44,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:44,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553862967] [2024-10-13 09:58:44,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553862967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:44,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:44,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:44,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471764652] [2024-10-13 09:58:44,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:44,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:44,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:44,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:44,441 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-13 09:58:44,444 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-13 09:58:44,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:44,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-13 09:58:44,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:44,705 INFO L124 PetriNetUnfolderBase]: 89/1741 cut-off events. [2024-10-13 09:58:44,706 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-13 09:58:44,727 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-13 09:58:44,738 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-10-13 09:58:44,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 583 transitions, 1205 flow [2024-10-13 09:58:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-13 09:58:44,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-13 09:58:44,743 INFO L175 Difference]: Start difference. First operand has 572 places, 584 transitions, 1177 flow. Second operand 3 states and 1861 transitions. [2024-10-13 09:58:44,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 583 transitions, 1205 flow [2024-10-13 09:58:44,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 583 transitions, 1204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:44,753 INFO L231 Difference]: Finished difference. Result has 572 places, 583 transitions, 1178 flow [2024-10-13 09:58:44,755 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-13 09:58:44,755 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2024-10-13 09:58:44,755 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 583 transitions, 1178 flow [2024-10-13 09:58:44,757 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-13 09:58:44,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:44,757 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-13 09:58:44,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:58:44,757 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-13 09:58:44,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -376228088, now seen corresponding path program 1 times [2024-10-13 09:58:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719111187] [2024-10-13 09:58:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:44,806 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-13 09:58:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:44,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719111187] [2024-10-13 09:58:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719111187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757955475] [2024-10-13 09:58:44,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:44,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:44,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 646 [2024-10-13 09:58:44,830 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-13 09:58:44,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:44,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 646 [2024-10-13 09:58:44,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:45,294 INFO L124 PetriNetUnfolderBase]: 167/1866 cut-off events. [2024-10-13 09:58:45,295 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2024-10-13 09:58:45,313 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-13 09:58:45,327 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 16 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2024-10-13 09:58:45,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 578 transitions, 1202 flow [2024-10-13 09:58:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2024-10-13 09:58:45,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95562435500516 [2024-10-13 09:58:45,333 INFO L175 Difference]: Start difference. First operand has 572 places, 583 transitions, 1178 flow. Second operand 3 states and 1852 transitions. [2024-10-13 09:58:45,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 578 transitions, 1202 flow [2024-10-13 09:58:45,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 578 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:45,344 INFO L231 Difference]: Finished difference. Result has 567 places, 578 transitions, 1166 flow [2024-10-13 09:58:45,345 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-13 09:58:45,346 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2024-10-13 09:58:45,346 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 578 transitions, 1166 flow [2024-10-13 09:58:45,348 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-13 09:58:45,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:45,348 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-13 09:58:45,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:58:45,348 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-13 09:58:45,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1328575772, now seen corresponding path program 1 times [2024-10-13 09:58:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:45,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731238973] [2024-10-13 09:58:45,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:45,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:45,415 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-13 09:58:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731238973] [2024-10-13 09:58:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731238973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:45,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:45,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:45,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878458477] [2024-10-13 09:58:45,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:45,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:45,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:45,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 646 [2024-10-13 09:58:45,449 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-13 09:58:45,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:45,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 646 [2024-10-13 09:58:45,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:45,635 INFO L124 PetriNetUnfolderBase]: 49/829 cut-off events. [2024-10-13 09:58:45,635 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-13 09:58:45,647 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-13 09:58:45,655 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-10-13 09:58:45,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 577 transitions, 1194 flow [2024-10-13 09:58:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-10-13 09:58:45,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602683178534571 [2024-10-13 09:58:45,660 INFO L175 Difference]: Start difference. First operand has 567 places, 578 transitions, 1166 flow. Second operand 3 states and 1861 transitions. [2024-10-13 09:58:45,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 577 transitions, 1194 flow [2024-10-13 09:58:45,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 577 transitions, 1193 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:45,671 INFO L231 Difference]: Finished difference. Result has 567 places, 577 transitions, 1167 flow [2024-10-13 09:58:45,672 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-13 09:58:45,674 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2024-10-13 09:58:45,674 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 577 transitions, 1167 flow [2024-10-13 09:58:45,675 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-13 09:58:45,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:45,676 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-13 09:58:45,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:58:45,676 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-13 09:58:45,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash -233536924, now seen corresponding path program 1 times [2024-10-13 09:58:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:45,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650811796] [2024-10-13 09:58:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:45,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:45,745 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-13 09:58:45,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650811796] [2024-10-13 09:58:45,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650811796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:45,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:45,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:45,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165980930] [2024-10-13 09:58:45,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:45,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:45,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:45,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:45,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:45,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-13 09:58:45,770 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-13 09:58:45,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:45,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-13 09:58:45,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:46,095 INFO L124 PetriNetUnfolderBase]: 96/1554 cut-off events. [2024-10-13 09:58:46,095 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-13 09:58:46,116 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-13 09:58:46,126 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 17 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-10-13 09:58:46,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 577 transitions, 1207 flow [2024-10-13 09:58:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2024-10-13 09:58:46,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9607843137254902 [2024-10-13 09:58:46,131 INFO L175 Difference]: Start difference. First operand has 567 places, 577 transitions, 1167 flow. Second operand 3 states and 1862 transitions. [2024-10-13 09:58:46,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 577 transitions, 1207 flow [2024-10-13 09:58:46,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 577 transitions, 1203 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:46,145 INFO L231 Difference]: Finished difference. Result has 564 places, 575 transitions, 1169 flow [2024-10-13 09:58:46,147 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-13 09:58:46,148 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2024-10-13 09:58:46,148 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 575 transitions, 1169 flow [2024-10-13 09:58:46,150 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-13 09:58:46,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:46,150 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-13 09:58:46,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:58:46,151 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-13 09:58:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1090637786, now seen corresponding path program 1 times [2024-10-13 09:58:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:46,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826909330] [2024-10-13 09:58:46,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:46,232 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-13 09:58:46,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826909330] [2024-10-13 09:58:46,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826909330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:46,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:46,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:46,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181677261] [2024-10-13 09:58:46,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:46,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:46,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:46,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:46,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:46,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-13 09:58:46,257 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-13 09:58:46,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:46,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-13 09:58:46,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:46,600 INFO L124 PetriNetUnfolderBase]: 165/2322 cut-off events. [2024-10-13 09:58:46,600 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 09:58:46,636 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-13 09:58:46,649 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 17 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2024-10-13 09:58:46,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 575 transitions, 1209 flow [2024-10-13 09:58:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2024-10-13 09:58:46,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9607843137254902 [2024-10-13 09:58:46,653 INFO L175 Difference]: Start difference. First operand has 564 places, 575 transitions, 1169 flow. Second operand 3 states and 1862 transitions. [2024-10-13 09:58:46,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 575 transitions, 1209 flow [2024-10-13 09:58:46,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 575 transitions, 1209 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:46,663 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1175 flow [2024-10-13 09:58:46,665 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-13 09:58:46,666 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2024-10-13 09:58:46,666 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1175 flow [2024-10-13 09:58:46,668 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-13 09:58:46,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:46,668 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-13 09:58:46,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:58:46,668 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-13 09:58:46,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:46,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2109589298, now seen corresponding path program 1 times [2024-10-13 09:58:46,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:46,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016940969] [2024-10-13 09:58:46,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:46,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:46,728 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-13 09:58:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:46,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016940969] [2024-10-13 09:58:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016940969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443458849] [2024-10-13 09:58:46,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:46,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:46,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:46,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:46,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-13 09:58:46,753 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-13 09:58:46,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:46,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-13 09:58:46,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:47,269 INFO L124 PetriNetUnfolderBase]: 251/3259 cut-off events. [2024-10-13 09:58:47,270 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-10-13 09:58:47,300 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-13 09:58:47,314 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 17 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-10-13 09:58:47,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 573 transitions, 1215 flow [2024-10-13 09:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2024-10-13 09:58:47,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9607843137254902 [2024-10-13 09:58:47,318 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1175 flow. Second operand 3 states and 1862 transitions. [2024-10-13 09:58:47,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 573 transitions, 1215 flow [2024-10-13 09:58:47,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 573 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:47,328 INFO L231 Difference]: Finished difference. Result has 562 places, 571 transitions, 1181 flow [2024-10-13 09:58:47,328 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-13 09:58:47,329 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2024-10-13 09:58:47,329 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 571 transitions, 1181 flow [2024-10-13 09:58:47,330 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-13 09:58:47,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:47,330 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-13 09:58:47,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:58:47,331 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-13 09:58:47,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1556437066, now seen corresponding path program 1 times [2024-10-13 09:58:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054712341] [2024-10-13 09:58:47,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:47,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:47,401 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-13 09:58:47,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:47,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054712341] [2024-10-13 09:58:47,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054712341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:47,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:47,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659467552] [2024-10-13 09:58:47,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:47,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:47,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:47,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:47,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-13 09:58:47,431 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-13 09:58:47,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:47,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-13 09:58:47,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:47,880 INFO L124 PetriNetUnfolderBase]: 109/2049 cut-off events. [2024-10-13 09:58:47,880 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-10-13 09:58:47,900 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-13 09:58:47,909 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2024-10-13 09:58:47,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 572 transitions, 1215 flow [2024-10-13 09:58:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-13 09:58:47,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-13 09:58:47,914 INFO L175 Difference]: Start difference. First operand has 562 places, 571 transitions, 1181 flow. Second operand 3 states and 1870 transitions. [2024-10-13 09:58:47,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 572 transitions, 1215 flow [2024-10-13 09:58:47,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 572 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:47,926 INFO L231 Difference]: Finished difference. Result has 563 places, 570 transitions, 1183 flow [2024-10-13 09:58:47,926 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-13 09:58:47,927 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2024-10-13 09:58:47,927 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 570 transitions, 1183 flow [2024-10-13 09:58:47,928 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-13 09:58:47,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:47,928 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-13 09:58:47,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:58:47,928 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-13 09:58:47,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1422458722, now seen corresponding path program 1 times [2024-10-13 09:58:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547271611] [2024-10-13 09:58:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:47,995 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-13 09:58:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:47,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547271611] [2024-10-13 09:58:47,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547271611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:47,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:47,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:58:47,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555808667] [2024-10-13 09:58:47,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:47,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:47,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:48,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-13 09:58:48,012 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-13 09:58:48,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:48,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-13 09:58:48,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:48,279 INFO L124 PetriNetUnfolderBase]: 90/1581 cut-off events. [2024-10-13 09:58:48,280 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-13 09:58:48,297 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-13 09:58:48,305 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 14 selfloop transitions, 3 changer transitions 0/573 dead transitions. [2024-10-13 09:58:48,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1225 flow [2024-10-13 09:58:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2024-10-13 09:58:48,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659442724458205 [2024-10-13 09:58:48,311 INFO L175 Difference]: Start difference. First operand has 563 places, 570 transitions, 1183 flow. Second operand 3 states and 1872 transitions. [2024-10-13 09:58:48,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1225 flow [2024-10-13 09:58:48,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1221 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:48,323 INFO L231 Difference]: Finished difference. Result has 565 places, 571 transitions, 1197 flow [2024-10-13 09:58:48,324 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-13 09:58:48,324 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2024-10-13 09:58:48,325 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 571 transitions, 1197 flow [2024-10-13 09:58:48,326 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-13 09:58:48,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:48,326 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-13 09:58:48,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:58:48,327 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-13 09:58:48,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1600465967, now seen corresponding path program 1 times [2024-10-13 09:58:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:48,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015307681] [2024-10-13 09:58:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:48,390 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-13 09:58:48,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015307681] [2024-10-13 09:58:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015307681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:48,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:48,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:48,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390825673] [2024-10-13 09:58:48,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:48,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:48,410 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-13 09:58:48,412 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-13 09:58:48,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:48,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-13 09:58:48,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:48,947 INFO L124 PetriNetUnfolderBase]: 198/2668 cut-off events. [2024-10-13 09:58:48,947 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2024-10-13 09:58:48,983 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-13 09:58:48,997 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 20 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2024-10-13 09:58:48,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 574 transitions, 1252 flow [2024-10-13 09:58:48,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2024-10-13 09:58:49,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623323013415893 [2024-10-13 09:58:49,002 INFO L175 Difference]: Start difference. First operand has 565 places, 571 transitions, 1197 flow. Second operand 3 states and 1865 transitions. [2024-10-13 09:58:49,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 574 transitions, 1252 flow [2024-10-13 09:58:49,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 574 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:49,015 INFO L231 Difference]: Finished difference. Result has 562 places, 569 transitions, 1197 flow [2024-10-13 09:58:49,015 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-13 09:58:49,016 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2024-10-13 09:58:49,016 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 569 transitions, 1197 flow [2024-10-13 09:58:49,016 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-13 09:58:49,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:49,017 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-13 09:58:49,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:58:49,017 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-13 09:58:49,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash 255300755, now seen corresponding path program 1 times [2024-10-13 09:58:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571717979] [2024-10-13 09:58:49,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:49,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:49,086 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-13 09:58:49,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:49,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571717979] [2024-10-13 09:58:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571717979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:49,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:49,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:49,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081305153] [2024-10-13 09:58:49,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:49,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:49,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:49,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:49,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-13 09:58:49,108 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-13 09:58:49,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:49,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-13 09:58:49,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:49,659 INFO L124 PetriNetUnfolderBase]: 184/2913 cut-off events. [2024-10-13 09:58:49,659 INFO L125 PetriNetUnfolderBase]: For 18/69 co-relation queries the response was YES. [2024-10-13 09:58:49,691 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-13 09:58:49,703 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2024-10-13 09:58:49,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 570 transitions, 1231 flow [2024-10-13 09:58:49,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-13 09:58:49,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-13 09:58:49,708 INFO L175 Difference]: Start difference. First operand has 562 places, 569 transitions, 1197 flow. Second operand 3 states and 1870 transitions. [2024-10-13 09:58:49,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 570 transitions, 1231 flow [2024-10-13 09:58:49,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 570 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:49,718 INFO L231 Difference]: Finished difference. Result has 563 places, 568 transitions, 1199 flow [2024-10-13 09:58:49,719 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-13 09:58:49,719 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2024-10-13 09:58:49,719 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 568 transitions, 1199 flow [2024-10-13 09:58:49,720 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-13 09:58:49,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:49,720 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-13 09:58:49,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:58:49,721 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-13 09:58:49,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1191988710, now seen corresponding path program 1 times [2024-10-13 09:58:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626891656] [2024-10-13 09:58:49,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:49,779 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-13 09:58:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626891656] [2024-10-13 09:58:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626891656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:49,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:49,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:58:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054090755] [2024-10-13 09:58:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:49,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:49,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-13 09:58:49,796 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-13 09:58:49,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:49,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-13 09:58:49,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:50,238 INFO L124 PetriNetUnfolderBase]: 154/2283 cut-off events. [2024-10-13 09:58:50,238 INFO L125 PetriNetUnfolderBase]: For 21/54 co-relation queries the response was YES. [2024-10-13 09:58:50,267 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-13 09:58:50,279 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 14 selfloop transitions, 3 changer transitions 0/571 dead transitions. [2024-10-13 09:58:50,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 571 transitions, 1241 flow [2024-10-13 09:58:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2024-10-13 09:58:50,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659442724458205 [2024-10-13 09:58:50,283 INFO L175 Difference]: Start difference. First operand has 563 places, 568 transitions, 1199 flow. Second operand 3 states and 1872 transitions. [2024-10-13 09:58:50,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 571 transitions, 1241 flow [2024-10-13 09:58:50,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 571 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:50,293 INFO L231 Difference]: Finished difference. Result has 565 places, 569 transitions, 1213 flow [2024-10-13 09:58:50,294 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-13 09:58:50,294 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2024-10-13 09:58:50,295 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 569 transitions, 1213 flow [2024-10-13 09:58:50,295 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-13 09:58:50,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:50,296 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-13 09:58:50,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:58:50,296 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-13 09:58:50,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:50,296 INFO L85 PathProgramCache]: Analyzing trace with hash -141943791, now seen corresponding path program 1 times [2024-10-13 09:58:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:50,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084494382] [2024-10-13 09:58:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:50,363 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-13 09:58:50,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:50,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084494382] [2024-10-13 09:58:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084494382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:50,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:50,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:50,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934863659] [2024-10-13 09:58:50,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:50,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:50,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:50,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:50,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:50,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-13 09:58:50,390 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-13 09:58:50,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:50,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-13 09:58:50,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:50,889 INFO L124 PetriNetUnfolderBase]: 162/2662 cut-off events. [2024-10-13 09:58:50,889 INFO L125 PetriNetUnfolderBase]: For 18/24 co-relation queries the response was YES. [2024-10-13 09:58:50,920 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-13 09:58:50,931 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2024-10-13 09:58:50,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 570 transitions, 1247 flow [2024-10-13 09:58:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-13 09:58:50,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-13 09:58:50,934 INFO L175 Difference]: Start difference. First operand has 565 places, 569 transitions, 1213 flow. Second operand 3 states and 1870 transitions. [2024-10-13 09:58:50,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 570 transitions, 1247 flow [2024-10-13 09:58:50,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 570 transitions, 1241 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:50,944 INFO L231 Difference]: Finished difference. Result has 564 places, 568 transitions, 1209 flow [2024-10-13 09:58:50,945 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-13 09:58:50,946 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2024-10-13 09:58:50,946 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 568 transitions, 1209 flow [2024-10-13 09:58:50,946 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-13 09:58:50,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:50,947 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-13 09:58:50,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 09:58:50,947 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-13 09:58:50,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash 466147290, now seen corresponding path program 1 times [2024-10-13 09:58:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:50,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073035841] [2024-10-13 09:58:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:50,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:51,020 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-13 09:58:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073035841] [2024-10-13 09:58:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073035841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:51,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:51,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:51,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972633419] [2024-10-13 09:58:51,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:51,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:51,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:51,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:51,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-13 09:58:51,045 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-13 09:58:51,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:51,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-13 09:58:51,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:51,734 INFO L124 PetriNetUnfolderBase]: 248/3369 cut-off events. [2024-10-13 09:58:51,734 INFO L125 PetriNetUnfolderBase]: For 15/29 co-relation queries the response was YES. [2024-10-13 09:58:51,785 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-13 09:58:51,802 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 20 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2024-10-13 09:58:51,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 571 transitions, 1264 flow [2024-10-13 09:58:51,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2024-10-13 09:58:51,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623323013415893 [2024-10-13 09:58:51,806 INFO L175 Difference]: Start difference. First operand has 564 places, 568 transitions, 1209 flow. Second operand 3 states and 1865 transitions. [2024-10-13 09:58:51,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 571 transitions, 1264 flow [2024-10-13 09:58:51,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 571 transitions, 1260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:51,820 INFO L231 Difference]: Finished difference. Result has 561 places, 566 transitions, 1211 flow [2024-10-13 09:58:51,821 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-13 09:58:51,821 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -40 predicate places. [2024-10-13 09:58:51,822 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 566 transitions, 1211 flow [2024-10-13 09:58:51,822 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-13 09:58:51,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:51,823 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-13 09:58:51,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 09:58:51,823 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-13 09:58:51,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:51,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1604152873, now seen corresponding path program 1 times [2024-10-13 09:58:51,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:51,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612242344] [2024-10-13 09:58:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:52,103 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-13 09:58:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:52,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612242344] [2024-10-13 09:58:52,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612242344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:52,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:52,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:58:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140149333] [2024-10-13 09:58:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:52,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:58:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:58:52,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:58:52,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-13 09:58:52,713 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-13 09:58:52,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:52,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-13 09:58:52,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:53,932 INFO L124 PetriNetUnfolderBase]: 311/4433 cut-off events. [2024-10-13 09:58:53,933 INFO L125 PetriNetUnfolderBase]: For 14/41 co-relation queries the response was YES. [2024-10-13 09:58:53,996 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-13 09:58:54,019 INFO L140 encePairwiseOnDemand]: 631/646 looper letters, 70 selfloop transitions, 16 changer transitions 0/605 dead transitions. [2024-10-13 09:58:54,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 605 transitions, 1477 flow [2024-10-13 09:58:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 09:58:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 09:58:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6532 transitions. [2024-10-13 09:58:54,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192231916690121 [2024-10-13 09:58:54,029 INFO L175 Difference]: Start difference. First operand has 561 places, 566 transitions, 1211 flow. Second operand 11 states and 6532 transitions. [2024-10-13 09:58:54,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 605 transitions, 1477 flow [2024-10-13 09:58:54,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 605 transitions, 1477 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:54,039 INFO L231 Difference]: Finished difference. Result has 576 places, 575 transitions, 1295 flow [2024-10-13 09:58:54,039 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-13 09:58:54,040 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2024-10-13 09:58:54,040 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 575 transitions, 1295 flow [2024-10-13 09:58:54,041 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-13 09:58:54,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:54,042 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-13 09:58:54,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 09:58:54,042 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-13 09:58:54,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash 852160939, now seen corresponding path program 1 times [2024-10-13 09:58:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742551850] [2024-10-13 09:58:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:54,107 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-13 09:58:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:54,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742551850] [2024-10-13 09:58:54,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742551850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:54,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930724347] [2024-10-13 09:58:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:54,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:54,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:54,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:54,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:54,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-13 09:58:54,129 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-13 09:58:54,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:54,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-13 09:58:54,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:54,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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-13 09:58:54,638 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2024-10-13 09:58:54,638 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2024-10-13 09:58:54,638 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2024-10-13 09:58:54,638 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2024-10-13 09:58:54,646 INFO L124 PetriNetUnfolderBase]: 261/3042 cut-off events. [2024-10-13 09:58:54,646 INFO L125 PetriNetUnfolderBase]: For 84/129 co-relation queries the response was YES. [2024-10-13 09:58:54,688 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-13 09:58:54,699 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2024-10-13 09:58:54,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 576 transitions, 1329 flow [2024-10-13 09:58:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-13 09:58:54,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-13 09:58:54,702 INFO L175 Difference]: Start difference. First operand has 576 places, 575 transitions, 1295 flow. Second operand 3 states and 1870 transitions. [2024-10-13 09:58:54,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 576 transitions, 1329 flow [2024-10-13 09:58:54,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 576 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:54,710 INFO L231 Difference]: Finished difference. Result has 576 places, 574 transitions, 1293 flow [2024-10-13 09:58:54,711 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-13 09:58:54,711 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2024-10-13 09:58:54,711 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 574 transitions, 1293 flow [2024-10-13 09:58:54,711 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-13 09:58:54,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:54,712 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-13 09:58:54,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 09:58:54,712 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-13 09:58:54,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash 843557337, now seen corresponding path program 1 times [2024-10-13 09:58:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:54,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376365518] [2024-10-13 09:58:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:54,765 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-13 09:58:54,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:54,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376365518] [2024-10-13 09:58:54,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376365518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:54,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:54,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741158774] [2024-10-13 09:58:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:54,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:54,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:54,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:54,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-13 09:58:54,789 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-13 09:58:54,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:54,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-13 09:58:54,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:55,871 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-13 09:58:55,871 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2024-10-13 09:58:55,871 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-10-13 09:58:55,871 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-10-13 09:58:55,871 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-10-13 09:58:56,043 INFO L124 PetriNetUnfolderBase]: 442/6407 cut-off events. [2024-10-13 09:58:56,043 INFO L125 PetriNetUnfolderBase]: For 57/115 co-relation queries the response was YES. [2024-10-13 09:58:56,135 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-13 09:58:56,161 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2024-10-13 09:58:56,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 575 transitions, 1327 flow [2024-10-13 09:58:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-13 09:58:56,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-13 09:58:56,164 INFO L175 Difference]: Start difference. First operand has 576 places, 574 transitions, 1293 flow. Second operand 3 states and 1870 transitions. [2024-10-13 09:58:56,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 575 transitions, 1327 flow [2024-10-13 09:58:56,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 575 transitions, 1323 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:56,177 INFO L231 Difference]: Finished difference. Result has 575 places, 573 transitions, 1291 flow [2024-10-13 09:58:56,178 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-13 09:58:56,179 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -26 predicate places. [2024-10-13 09:58:56,179 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 573 transitions, 1291 flow [2024-10-13 09:58:56,179 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-13 09:58:56,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:56,180 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-13 09:58:56,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 09:58:56,180 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-13 09:58:56,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:56,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1118388864, now seen corresponding path program 1 times [2024-10-13 09:58:56,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:56,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973743278] [2024-10-13 09:58:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:56,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:56,403 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-13 09:58:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:56,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973743278] [2024-10-13 09:58:56,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973743278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:56,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:56,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:58:56,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012632766] [2024-10-13 09:58:56,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:56,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:58:56,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:56,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:58:56,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:58:56,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-13 09:58:56,818 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-13 09:58:56,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:56,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-13 09:58:56,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:58,862 INFO L124 PetriNetUnfolderBase]: 701/8589 cut-off events. [2024-10-13 09:58:58,862 INFO L125 PetriNetUnfolderBase]: For 148/265 co-relation queries the response was YES. [2024-10-13 09:58:58,990 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-13 09:58:59,037 INFO L140 encePairwiseOnDemand]: 629/646 looper letters, 65 selfloop transitions, 19 changer transitions 0/605 dead transitions. [2024-10-13 09:58:59,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 605 transitions, 1541 flow [2024-10-13 09:58:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 09:58:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 09:58:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7112 transitions. [2024-10-13 09:58:59,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9174406604747162 [2024-10-13 09:58:59,049 INFO L175 Difference]: Start difference. First operand has 575 places, 573 transitions, 1291 flow. Second operand 12 states and 7112 transitions. [2024-10-13 09:58:59,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 605 transitions, 1541 flow [2024-10-13 09:58:59,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 605 transitions, 1537 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:59,063 INFO L231 Difference]: Finished difference. Result has 590 places, 583 transitions, 1388 flow [2024-10-13 09:58:59,064 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-13 09:58:59,065 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -11 predicate places. [2024-10-13 09:58:59,065 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 583 transitions, 1388 flow [2024-10-13 09:58:59,066 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-13 09:58:59,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:59,066 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-13 09:58:59,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 09:58:59,067 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-13 09:58:59,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:59,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1328812923, now seen corresponding path program 1 times [2024-10-13 09:58:59,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:59,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975252934] [2024-10-13 09:58:59,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:59,135 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-13 09:58:59,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975252934] [2024-10-13 09:58:59,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975252934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:59,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:58:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813118891] [2024-10-13 09:58:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:59,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:59,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:59,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:59,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:59,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-13 09:58:59,149 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-13 09:58:59,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:59,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-13 09:58:59,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:00,400 INFO L124 PetriNetUnfolderBase]: 700/6568 cut-off events. [2024-10-13 09:59:00,400 INFO L125 PetriNetUnfolderBase]: For 392/463 co-relation queries the response was YES. [2024-10-13 09:59:00,478 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-13 09:59:00,501 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 14 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2024-10-13 09:59:00,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 586 transitions, 1430 flow [2024-10-13 09:59:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2024-10-13 09:59:00,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659442724458205 [2024-10-13 09:59:00,503 INFO L175 Difference]: Start difference. First operand has 590 places, 583 transitions, 1388 flow. Second operand 3 states and 1872 transitions. [2024-10-13 09:59:00,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 586 transitions, 1430 flow [2024-10-13 09:59:00,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 586 transitions, 1430 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:59:00,511 INFO L231 Difference]: Finished difference. Result has 594 places, 584 transitions, 1406 flow [2024-10-13 09:59:00,511 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-13 09:59:00,511 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -7 predicate places. [2024-10-13 09:59:00,512 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 584 transitions, 1406 flow [2024-10-13 09:59:00,512 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-13 09:59:00,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:00,512 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-13 09:59:00,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 09:59:00,513 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-13 09:59:00,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1720356786, now seen corresponding path program 1 times [2024-10-13 09:59:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393932089] [2024-10-13 09:59:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:00,573 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-13 09:59:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393932089] [2024-10-13 09:59:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393932089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014053633] [2024-10-13 09:59:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:00,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:00,592 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 646 [2024-10-13 09:59:00,593 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-13 09:59:00,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:00,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 646 [2024-10-13 09:59:00,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:01,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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-13 09:59:01,511 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-10-13 09:59:01,511 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-13 09:59:01,511 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-13 09:59:01,511 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-10-13 09:59:01,522 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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-13 09:59:01,522 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is not cut-off event [2024-10-13 09:59:01,522 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2024-10-13 09:59:01,522 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is not cut-off event [2024-10-13 09:59:01,522 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2024-10-13 09:59:01,536 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1774] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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-13 09:59:01,536 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2024-10-13 09:59:01,536 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-13 09:59:01,536 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-10-13 09:59:01,536 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-13 09:59:01,536 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-10-13 09:59:01,540 INFO L124 PetriNetUnfolderBase]: 493/5346 cut-off events. [2024-10-13 09:59:01,541 INFO L125 PetriNetUnfolderBase]: For 318/387 co-relation queries the response was YES. [2024-10-13 09:59:01,623 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-13 09:59:01,646 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 13 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-10-13 09:59:01,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 585 transitions, 1440 flow [2024-10-13 09:59:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-10-13 09:59:01,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-10-13 09:59:01,648 INFO L175 Difference]: Start difference. First operand has 594 places, 584 transitions, 1406 flow. Second operand 3 states and 1870 transitions. [2024-10-13 09:59:01,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 585 transitions, 1440 flow [2024-10-13 09:59:01,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 585 transitions, 1434 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:01,660 INFO L231 Difference]: Finished difference. Result has 593 places, 583 transitions, 1402 flow [2024-10-13 09:59:01,661 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-13 09:59:01,662 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, -8 predicate places. [2024-10-13 09:59:01,662 INFO L471 AbstractCegarLoop]: Abstraction has has 593 places, 583 transitions, 1402 flow [2024-10-13 09:59:01,663 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-13 09:59:01,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:01,663 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-13 09:59:01,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 09:59:01,664 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-13 09:59:01,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash 292590392, now seen corresponding path program 1 times [2024-10-13 09:59:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:01,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980859262] [2024-10-13 09:59:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:01,893 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-13 09:59:01,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:01,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980859262] [2024-10-13 09:59:01,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980859262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:01,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:01,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:59:01,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87781182] [2024-10-13 09:59:01,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:01,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:59:01,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:01,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:59:01,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:59:02,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-13 09:59:02,382 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-13 09:59:02,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:02,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-13 09:59:02,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:03,441 INFO L124 PetriNetUnfolderBase]: 603/5602 cut-off events. [2024-10-13 09:59:03,441 INFO L125 PetriNetUnfolderBase]: For 424/521 co-relation queries the response was YES. [2024-10-13 09:59:03,521 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-13 09:59:03,541 INFO L140 encePairwiseOnDemand]: 631/646 looper letters, 80 selfloop transitions, 16 changer transitions 0/622 dead transitions. [2024-10-13 09:59:03,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 622 transitions, 1722 flow [2024-10-13 09:59:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 09:59:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 09:59:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6532 transitions. [2024-10-13 09:59:03,545 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192231916690121 [2024-10-13 09:59:03,545 INFO L175 Difference]: Start difference. First operand has 593 places, 583 transitions, 1402 flow. Second operand 11 states and 6532 transitions. [2024-10-13 09:59:03,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 622 transitions, 1722 flow [2024-10-13 09:59:03,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 622 transitions, 1718 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:03,555 INFO L231 Difference]: Finished difference. Result has 604 places, 587 transitions, 1461 flow [2024-10-13 09:59:03,556 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-13 09:59:03,556 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 3 predicate places. [2024-10-13 09:59:03,556 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 587 transitions, 1461 flow [2024-10-13 09:59:03,557 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-13 09:59:03,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:03,557 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-13 09:59:03,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 09:59:03,557 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-13 09:59:03,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash 832058872, now seen corresponding path program 1 times [2024-10-13 09:59:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537700902] [2024-10-13 09:59:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:03,759 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-13 09:59:03,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:03,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537700902] [2024-10-13 09:59:03,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537700902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:03,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:03,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:59:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002317756] [2024-10-13 09:59:03,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:03,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:59:03,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:03,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:59:03,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:59:04,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-13 09:59:04,366 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-13 09:59:04,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:04,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-13 09:59:04,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:05,408 INFO L124 PetriNetUnfolderBase]: 416/5737 cut-off events. [2024-10-13 09:59:05,408 INFO L125 PetriNetUnfolderBase]: For 251/274 co-relation queries the response was YES. [2024-10-13 09:59:05,487 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-13 09:59:05,507 INFO L140 encePairwiseOnDemand]: 630/646 looper letters, 73 selfloop transitions, 20 changer transitions 0/619 dead transitions. [2024-10-13 09:59:05,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 619 transitions, 1757 flow [2024-10-13 09:59:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 09:59:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 09:59:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6525 transitions. [2024-10-13 09:59:05,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9182381086405854 [2024-10-13 09:59:05,512 INFO L175 Difference]: Start difference. First operand has 604 places, 587 transitions, 1461 flow. Second operand 11 states and 6525 transitions. [2024-10-13 09:59:05,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 619 transitions, 1757 flow [2024-10-13 09:59:05,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 619 transitions, 1736 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-13 09:59:05,522 INFO L231 Difference]: Finished difference. Result has 610 places, 595 transitions, 1557 flow [2024-10-13 09:59:05,523 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-13 09:59:05,523 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 9 predicate places. [2024-10-13 09:59:05,523 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 595 transitions, 1557 flow [2024-10-13 09:59:05,524 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-13 09:59:05,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:05,524 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-13 09:59:05,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 09:59:05,525 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-13 09:59:05,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash 587808464, now seen corresponding path program 1 times [2024-10-13 09:59:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738895533] [2024-10-13 09:59:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:05,704 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-13 09:59:05,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738895533] [2024-10-13 09:59:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738895533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:05,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:05,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:59:05,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333936661] [2024-10-13 09:59:05,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:05,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:59:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:05,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:59:05,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:59:06,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-13 09:59:06,181 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-13 09:59:06,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:06,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-13 09:59:06,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:08,168 INFO L124 PetriNetUnfolderBase]: 940/11014 cut-off events. [2024-10-13 09:59:08,168 INFO L125 PetriNetUnfolderBase]: For 830/965 co-relation queries the response was YES. [2024-10-13 09:59:08,372 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-13 09:59:08,417 INFO L140 encePairwiseOnDemand]: 630/646 looper letters, 70 selfloop transitions, 21 changer transitions 0/624 dead transitions. [2024-10-13 09:59:08,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 624 transitions, 1854 flow [2024-10-13 09:59:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 09:59:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 09:59:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2024-10-13 09:59:08,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9169715733183226 [2024-10-13 09:59:08,421 INFO L175 Difference]: Start difference. First operand has 610 places, 595 transitions, 1557 flow. Second operand 11 states and 6516 transitions. [2024-10-13 09:59:08,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 624 transitions, 1854 flow [2024-10-13 09:59:08,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 624 transitions, 1833 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-13 09:59:08,440 INFO L231 Difference]: Finished difference. Result has 618 places, 609 transitions, 1690 flow [2024-10-13 09:59:08,441 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-13 09:59:08,441 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 17 predicate places. [2024-10-13 09:59:08,442 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 609 transitions, 1690 flow [2024-10-13 09:59:08,443 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-13 09:59:08,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:08,443 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-13 09:59:08,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 09:59:08,443 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-13 09:59:08,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash 708054489, now seen corresponding path program 1 times [2024-10-13 09:59:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:08,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325517985] [2024-10-13 09:59:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:08,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:08,651 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-13 09:59:08,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325517985] [2024-10-13 09:59:08,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325517985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:08,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:08,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:59:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509537668] [2024-10-13 09:59:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:08,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:59:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:08,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:59:08,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:59:09,076 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 646 [2024-10-13 09:59:09,079 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-13 09:59:09,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:09,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 646 [2024-10-13 09:59:09,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:10,475 INFO L124 PetriNetUnfolderBase]: 761/7083 cut-off events. [2024-10-13 09:59:10,475 INFO L125 PetriNetUnfolderBase]: For 1205/1325 co-relation queries the response was YES. [2024-10-13 09:59:10,572 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-13 09:59:10,597 INFO L140 encePairwiseOnDemand]: 630/646 looper letters, 69 selfloop transitions, 20 changer transitions 0/632 dead transitions. [2024-10-13 09:59:10,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 632 transitions, 1960 flow [2024-10-13 09:59:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 09:59:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 09:59:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2024-10-13 09:59:10,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9169715733183226 [2024-10-13 09:59:10,603 INFO L175 Difference]: Start difference. First operand has 618 places, 609 transitions, 1690 flow. Second operand 11 states and 6516 transitions. [2024-10-13 09:59:10,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 632 transitions, 1960 flow [2024-10-13 09:59:10,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 632 transitions, 1956 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:10,621 INFO L231 Difference]: Finished difference. Result has 630 places, 617 transitions, 1803 flow [2024-10-13 09:59:10,622 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-13 09:59:10,622 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 29 predicate places. [2024-10-13 09:59:10,622 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 617 transitions, 1803 flow [2024-10-13 09:59:10,623 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-13 09:59:10,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:10,624 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-13 09:59:10,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-13 09:59:10,624 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-13 09:59:10,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1656765210, now seen corresponding path program 1 times [2024-10-13 09:59:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:10,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289975460] [2024-10-13 09:59:10,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:10,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:11,151 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-13 09:59:11,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:11,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289975460] [2024-10-13 09:59:11,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289975460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:11,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:11,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:59:11,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700939509] [2024-10-13 09:59:11,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:11,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:59:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:11,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:59:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:59:11,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-13 09:59:11,606 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-13 09:59:11,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:11,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-13 09:59:11,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:13,344 INFO L124 PetriNetUnfolderBase]: 682/9716 cut-off events. [2024-10-13 09:59:13,344 INFO L125 PetriNetUnfolderBase]: For 1969/2051 co-relation queries the response was YES. [2024-10-13 09:59:13,441 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-13 09:59:13,466 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/624 dead transitions. [2024-10-13 09:59:13,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 624 transitions, 1925 flow [2024-10-13 09:59:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:59:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:59:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-13 09:59:13,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-13 09:59:13,469 INFO L175 Difference]: Start difference. First operand has 630 places, 617 transitions, 1803 flow. Second operand 6 states and 3626 transitions. [2024-10-13 09:59:13,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 624 transitions, 1925 flow [2024-10-13 09:59:13,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 624 transitions, 1904 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-13 09:59:13,495 INFO L231 Difference]: Finished difference. Result has 627 places, 616 transitions, 1801 flow [2024-10-13 09:59:13,496 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-13 09:59:13,496 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 26 predicate places. [2024-10-13 09:59:13,496 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 616 transitions, 1801 flow [2024-10-13 09:59:13,497 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-13 09:59:13,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:13,497 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-13 09:59:13,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-13 09:59:13,498 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-13 09:59:13,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1453958017, now seen corresponding path program 1 times [2024-10-13 09:59:13,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:13,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697819977] [2024-10-13 09:59:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:14,198 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-13 09:59:14,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:14,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697819977] [2024-10-13 09:59:14,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697819977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:14,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:14,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:59:14,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837113426] [2024-10-13 09:59:14,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:14,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:59:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:14,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:59:14,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:59:14,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-13 09:59:14,780 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-13 09:59:14,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:14,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-13 09:59:14,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:16,737 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-13 09:59:16,737 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2024-10-13 09:59:16,737 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2024-10-13 09:59:16,738 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2024-10-13 09:59:16,738 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-10-13 09:59:16,749 INFO L124 PetriNetUnfolderBase]: 734/10389 cut-off events. [2024-10-13 09:59:16,750 INFO L125 PetriNetUnfolderBase]: For 2056/2229 co-relation queries the response was YES. [2024-10-13 09:59:16,835 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-13 09:59:16,860 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/623 dead transitions. [2024-10-13 09:59:16,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 623 transitions, 1923 flow [2024-10-13 09:59:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:59:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:59:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-13 09:59:16,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-13 09:59:16,864 INFO L175 Difference]: Start difference. First operand has 627 places, 616 transitions, 1801 flow. Second operand 6 states and 3626 transitions. [2024-10-13 09:59:16,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 623 transitions, 1923 flow [2024-10-13 09:59:16,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 623 transitions, 1910 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-13 09:59:16,892 INFO L231 Difference]: Finished difference. Result has 627 places, 615 transitions, 1807 flow [2024-10-13 09:59:16,893 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-13 09:59:16,894 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 26 predicate places. [2024-10-13 09:59:16,894 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 615 transitions, 1807 flow [2024-10-13 09:59:16,895 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-13 09:59:16,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:16,895 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-13 09:59:16,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-13 09:59:16,895 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-13 09:59:16,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1389230815, now seen corresponding path program 1 times [2024-10-13 09:59:16,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:16,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506343498] [2024-10-13 09:59:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:16,959 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-13 09:59:16,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:16,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506343498] [2024-10-13 09:59:16,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506343498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:16,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:16,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:16,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059605556] [2024-10-13 09:59:16,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:16,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:16,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:16,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:16,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:16,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 646 [2024-10-13 09:59:16,979 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-13 09:59:16,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:16,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 646 [2024-10-13 09:59:16,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:19,080 INFO L124 PetriNetUnfolderBase]: 774/9776 cut-off events. [2024-10-13 09:59:19,080 INFO L125 PetriNetUnfolderBase]: For 1380/1405 co-relation queries the response was YES. [2024-10-13 09:59:19,163 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-13 09:59:19,185 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 19 selfloop transitions, 2 changer transitions 0/617 dead transitions. [2024-10-13 09:59:19,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 617 transitions, 1857 flow [2024-10-13 09:59:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1864 transitions. [2024-10-13 09:59:19,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9618163054695562 [2024-10-13 09:59:19,187 INFO L175 Difference]: Start difference. First operand has 627 places, 615 transitions, 1807 flow. Second operand 3 states and 1864 transitions. [2024-10-13 09:59:19,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 617 transitions, 1857 flow [2024-10-13 09:59:19,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 617 transitions, 1844 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-13 09:59:19,202 INFO L231 Difference]: Finished difference. Result has 622 places, 613 transitions, 1800 flow [2024-10-13 09:59:19,203 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-13 09:59:19,203 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 21 predicate places. [2024-10-13 09:59:19,203 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 613 transitions, 1800 flow [2024-10-13 09:59:19,203 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-13 09:59:19,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:19,204 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-13 09:59:19,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-13 09:59:19,204 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-13 09:59:19,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1926704244, now seen corresponding path program 1 times [2024-10-13 09:59:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:19,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199467111] [2024-10-13 09:59:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:19,755 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-13 09:59:19,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:19,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199467111] [2024-10-13 09:59:19,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199467111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:19,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:59:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720786631] [2024-10-13 09:59:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:19,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:59:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:19,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:59:19,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:59:20,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-13 09:59:20,477 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-13 09:59:20,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:20,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-13 09:59:20,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:22,448 INFO L124 PetriNetUnfolderBase]: 747/10933 cut-off events. [2024-10-13 09:59:22,448 INFO L125 PetriNetUnfolderBase]: For 2136/2222 co-relation queries the response was YES. [2024-10-13 09:59:22,563 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-13 09:59:22,593 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/619 dead transitions. [2024-10-13 09:59:22,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 619 transitions, 1916 flow [2024-10-13 09:59:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:59:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:59:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-13 09:59:22,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-13 09:59:22,597 INFO L175 Difference]: Start difference. First operand has 622 places, 613 transitions, 1800 flow. Second operand 6 states and 3626 transitions. [2024-10-13 09:59:22,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 619 transitions, 1916 flow [2024-10-13 09:59:22,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 619 transitions, 1916 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:59:22,624 INFO L231 Difference]: Finished difference. Result has 625 places, 611 transitions, 1808 flow [2024-10-13 09:59:22,625 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-13 09:59:22,625 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 24 predicate places. [2024-10-13 09:59:22,625 INFO L471 AbstractCegarLoop]: Abstraction has has 625 places, 611 transitions, 1808 flow [2024-10-13 09:59:22,626 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-13 09:59:22,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:22,626 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-13 09:59:22,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-13 09:59:22,627 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-13 09:59:22,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:22,627 INFO L85 PathProgramCache]: Analyzing trace with hash -351660666, now seen corresponding path program 1 times [2024-10-13 09:59:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:22,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151626481] [2024-10-13 09:59:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:23,249 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-13 09:59:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151626481] [2024-10-13 09:59:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151626481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:23,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:59:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721828490] [2024-10-13 09:59:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:23,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:59:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:23,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:59:23,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:59:23,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-13 09:59:23,755 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-13 09:59:23,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:23,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-13 09:59:23,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:25,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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-13 09:59:25,154 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-10-13 09:59:25,154 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-10-13 09:59:25,154 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-13 09:59:25,154 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-13 09:59:25,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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-13 09:59:25,157 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-10-13 09:59:25,157 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-13 09:59:25,157 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-10-13 09:59:25,157 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-13 09:59:25,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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-13 09:59:25,160 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-10-13 09:59:25,160 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-13 09:59:25,160 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2024-10-13 09:59:25,160 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-13 09:59:25,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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-13 09:59:25,163 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2024-10-13 09:59:25,163 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-10-13 09:59:25,163 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2024-10-13 09:59:25,163 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-10-13 09:59:25,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1773] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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-13 09:59:25,166 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-10-13 09:59:25,166 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2024-10-13 09:59:25,166 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-13 09:59:25,166 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-13 09:59:25,184 INFO L124 PetriNetUnfolderBase]: 711/7183 cut-off events. [2024-10-13 09:59:25,184 INFO L125 PetriNetUnfolderBase]: For 2215/2451 co-relation queries the response was YES. [2024-10-13 09:59:25,250 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-13 09:59:25,265 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/618 dead transitions. [2024-10-13 09:59:25,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 618 transitions, 1930 flow [2024-10-13 09:59:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:59:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:59:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-13 09:59:25,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-13 09:59:25,267 INFO L175 Difference]: Start difference. First operand has 625 places, 611 transitions, 1808 flow. Second operand 6 states and 3626 transitions. [2024-10-13 09:59:25,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 618 transitions, 1930 flow [2024-10-13 09:59:25,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 618 transitions, 1918 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:59:25,279 INFO L231 Difference]: Finished difference. Result has 624 places, 610 transitions, 1815 flow [2024-10-13 09:59:25,279 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-13 09:59:25,279 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 23 predicate places. [2024-10-13 09:59:25,280 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 610 transitions, 1815 flow [2024-10-13 09:59:25,280 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-13 09:59:25,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:25,280 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-13 09:59:25,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-13 09:59:25,280 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-13 09:59:25,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash 417647269, now seen corresponding path program 1 times [2024-10-13 09:59:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:25,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808285791] [2024-10-13 09:59:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:25,991 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-13 09:59:25,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:25,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808285791] [2024-10-13 09:59:25,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808285791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:25,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:25,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:59:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119042404] [2024-10-13 09:59:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:25,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:59:25,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:25,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:59:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:59:26,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 646 [2024-10-13 09:59:26,456 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-13 09:59:26,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:26,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 646 [2024-10-13 09:59:26,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:28,849 INFO L124 PetriNetUnfolderBase]: 778/10893 cut-off events. [2024-10-13 09:59:28,849 INFO L125 PetriNetUnfolderBase]: For 2430/2608 co-relation queries the response was YES. [2024-10-13 09:59:28,944 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-13 09:59:28,968 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 42 selfloop transitions, 6 changer transitions 0/616 dead transitions. [2024-10-13 09:59:28,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 616 transitions, 1931 flow [2024-10-13 09:59:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:59:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:59:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2024-10-13 09:59:28,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935500515995872 [2024-10-13 09:59:28,971 INFO L175 Difference]: Start difference. First operand has 624 places, 610 transitions, 1815 flow. Second operand 6 states and 3626 transitions. [2024-10-13 09:59:28,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 616 transitions, 1931 flow [2024-10-13 09:59:28,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 616 transitions, 1918 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-13 09:59:29,003 INFO L231 Difference]: Finished difference. Result has 623 places, 608 transitions, 1810 flow [2024-10-13 09:59:29,004 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-13 09:59:29,004 INFO L277 CegarLoopForPetriNet]: 601 programPoint places, 22 predicate places. [2024-10-13 09:59:29,004 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 608 transitions, 1810 flow [2024-10-13 09:59:29,005 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-13 09:59:29,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:29,005 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-13 09:59:29,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-13 09:59:29,006 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-13 09:59:29,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1407047757, now seen corresponding path program 1 times [2024-10-13 09:59:29,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:29,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684656884] [2024-10-13 09:59:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:29,065 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-13 09:59:29,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:29,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684656884] [2024-10-13 09:59:29,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684656884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:29,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:29,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270354644] [2024-10-13 09:59:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:29,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:29,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:29,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:29,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:29,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 646 [2024-10-13 09:59:29,083 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-13 09:59:29,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:29,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 646 [2024-10-13 09:59:29,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand