./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-file-item-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 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-file-item-subst.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 d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:11:53,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:11:53,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:11:53,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:11:53,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:11:53,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:11:53,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:11:53,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:11:53,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:11:53,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:11:53,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:11:53,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:11:53,205 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:11:53,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:11:53,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:11:53,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:11:53,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:11:53,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:11:53,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:11:53,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:11:53,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:11:53,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:11:53,208 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:11:53,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:11:53,208 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:11:53,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:11:53,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:11:53,209 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:11:53,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:11:53,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:11:53,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:11:53,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:11:53,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:11:53,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:11:53,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:11:53,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:11:53,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:11:53,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:11:53,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:11:53,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:11:53,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:11:53,214 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 -> d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 [2024-10-14 17:11:53,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:11:53,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:11:53,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:11:53,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:11:53,471 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:11:53,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2024-10-14 17:11:54,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:11:55,130 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:11:55,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2024-10-14 17:11:55,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b28225d/b1d63e70e79e4ce1a596185a346e1daa/FLAG4be5fd965 [2024-10-14 17:11:55,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b28225d/b1d63e70e79e4ce1a596185a346e1daa [2024-10-14 17:11:55,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:11:55,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:11:55,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:11:55,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:11:55,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:11:55,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7736f4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55, skipping insertion in model container [2024-10-14 17:11:55,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:11:55,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:11:55,465 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:11:55,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:11:55,531 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:11:55,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55 WrapperNode [2024-10-14 17:11:55,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:11:55,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:11:55,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:11:55,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:11:55,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,582 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 308 [2024-10-14 17:11:55,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:11:55,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:11:55,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:11:55,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:11:55,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:11:55,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:11:55,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:11:55,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:11:55,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (1/1) ... [2024-10-14 17:11:55,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:11:55,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:11:55,684 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-14 17:11:55,694 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-14 17:11:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:11:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:11:55,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:11:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:11:55,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:11:55,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:11:55,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:11:55,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:11:55,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:11:55,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:11:55,746 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:11:55,887 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:11:55,890 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:11:56,378 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:11:56,378 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:11:56,410 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:11:56,411 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 17:11:56,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:56 BoogieIcfgContainer [2024-10-14 17:11:56,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:11:56,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:11:56,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:11:56,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:11:56,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:11:55" (1/3) ... [2024-10-14 17:11:56,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457b00bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:56, skipping insertion in model container [2024-10-14 17:11:56,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:55" (2/3) ... [2024-10-14 17:11:56,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457b00bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:56, skipping insertion in model container [2024-10-14 17:11:56,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:56" (3/3) ... [2024-10-14 17:11:56,420 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2024-10-14 17:11:56,436 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:11:56,437 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-14 17:11:56,438 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:11:56,571 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:11:56,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 412 transitions, 845 flow [2024-10-14 17:11:56,830 INFO L124 PetriNetUnfolderBase]: 21/409 cut-off events. [2024-10-14 17:11:56,830 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:11:56,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 409 events. 21/409 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1065 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 283. Up to 2 conditions per place. [2024-10-14 17:11:56,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 412 transitions, 845 flow [2024-10-14 17:11:56,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 389 transitions, 796 flow [2024-10-14 17:11:56,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:11:56,924 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;@746672a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:11:56,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-10-14 17:11:56,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:11:56,931 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-14 17:11:56,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:11:56,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:56,932 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-14 17:11:56,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:56,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:56,938 INFO L85 PathProgramCache]: Analyzing trace with hash 795979492, now seen corresponding path program 1 times [2024-10-14 17:11:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:56,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014575658] [2024-10-14 17:11:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:57,126 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-14 17:11:57,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014575658] [2024-10-14 17:11:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014575658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:57,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504158469] [2024-10-14 17:11:57,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:57,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:57,204 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-14 17:11:57,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 389 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:57,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:57,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-14 17:11:57,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:57,455 INFO L124 PetriNetUnfolderBase]: 35/716 cut-off events. [2024-10-14 17:11:57,456 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-10-14 17:11:57,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 716 events. 35/716 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3261 event pairs, 7 based on Foata normal form. 23/617 useless extension candidates. Maximal degree in co-relation 608. Up to 25 conditions per place. [2024-10-14 17:11:57,470 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 11 selfloop transitions, 2 changer transitions 1/381 dead transitions. [2024-10-14 17:11:57,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 381 transitions, 806 flow [2024-10-14 17:11:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-14 17:11:57,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-14 17:11:57,496 INFO L175 Difference]: Start difference. First operand has 380 places, 389 transitions, 796 flow. Second operand 3 states and 1185 transitions. [2024-10-14 17:11:57,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 381 transitions, 806 flow [2024-10-14 17:11:57,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 794 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 17:11:57,512 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 770 flow [2024-10-14 17:11:57,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2024-10-14 17:11:57,519 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -5 predicate places. [2024-10-14 17:11:57,520 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 770 flow [2024-10-14 17:11:57,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:57,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:57,521 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-14 17:11:57,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:11:57,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:57,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:57,523 INFO L85 PathProgramCache]: Analyzing trace with hash 213531984, now seen corresponding path program 1 times [2024-10-14 17:11:57,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:57,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705619759] [2024-10-14 17:11:57,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:57,605 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-14 17:11:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705619759] [2024-10-14 17:11:57,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705619759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:57,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:57,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104614469] [2024-10-14 17:11:57,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:57,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:57,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:57,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:57,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:57,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-14 17:11:57,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:57,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:57,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-14 17:11:57,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:57,769 INFO L124 PetriNetUnfolderBase]: 25/551 cut-off events. [2024-10-14 17:11:57,770 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-14 17:11:57,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 551 events. 25/551 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2196 event pairs, 5 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 547. Up to 22 conditions per place. [2024-10-14 17:11:57,780 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2024-10-14 17:11:57,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 794 flow [2024-10-14 17:11:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-14 17:11:57,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-14 17:11:57,786 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 770 flow. Second operand 3 states and 1178 transitions. [2024-10-14 17:11:57,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 794 flow [2024-10-14 17:11:57,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:57,796 INFO L231 Difference]: Finished difference. Result has 373 places, 379 transitions, 768 flow [2024-10-14 17:11:57,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=373, PETRI_TRANSITIONS=379} [2024-10-14 17:11:57,798 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2024-10-14 17:11:57,798 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 379 transitions, 768 flow [2024-10-14 17:11:57,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:57,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:57,800 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-14 17:11:57,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:11:57,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:57,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -144288898, now seen corresponding path program 1 times [2024-10-14 17:11:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:57,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029210692] [2024-10-14 17:11:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:57,877 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-14 17:11:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029210692] [2024-10-14 17:11:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029210692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:57,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:57,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166937645] [2024-10-14 17:11:57,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:57,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:57,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:57,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:57,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-14 17:11:57,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 379 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:57,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:57,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-14 17:11:57,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:57,990 INFO L124 PetriNetUnfolderBase]: 23/470 cut-off events. [2024-10-14 17:11:57,991 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-14 17:11:57,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 470 events. 23/470 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1661 event pairs, 7 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 460. Up to 25 conditions per place. [2024-10-14 17:11:57,999 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-10-14 17:11:58,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 378 transitions, 792 flow [2024-10-14 17:11:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-14 17:11:58,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-14 17:11:58,004 INFO L175 Difference]: Start difference. First operand has 373 places, 379 transitions, 768 flow. Second operand 3 states and 1178 transitions. [2024-10-14 17:11:58,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 378 transitions, 792 flow [2024-10-14 17:11:58,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 378 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:58,010 INFO L231 Difference]: Finished difference. Result has 372 places, 378 transitions, 766 flow [2024-10-14 17:11:58,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=372, PETRI_TRANSITIONS=378} [2024-10-14 17:11:58,012 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -8 predicate places. [2024-10-14 17:11:58,013 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 378 transitions, 766 flow [2024-10-14 17:11:58,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:58,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:58,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:11:58,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:58,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1587522512, now seen corresponding path program 1 times [2024-10-14 17:11:58,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:58,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563208391] [2024-10-14 17:11:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:58,108 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-14 17:11:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:58,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563208391] [2024-10-14 17:11:58,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563208391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:58,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:58,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404290076] [2024-10-14 17:11:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:58,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:58,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:58,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:58,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-14 17:11:58,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 378 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:58,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:58,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-14 17:11:58,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:58,261 INFO L124 PetriNetUnfolderBase]: 43/846 cut-off events. [2024-10-14 17:11:58,261 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:11:58,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 846 events. 43/846 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4599 event pairs, 7 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 831. Up to 25 conditions per place. [2024-10-14 17:11:58,275 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-10-14 17:11:58,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 377 transitions, 790 flow [2024-10-14 17:11:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-14 17:11:58,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-14 17:11:58,279 INFO L175 Difference]: Start difference. First operand has 372 places, 378 transitions, 766 flow. Second operand 3 states and 1178 transitions. [2024-10-14 17:11:58,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 377 transitions, 790 flow [2024-10-14 17:11:58,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 377 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:58,285 INFO L231 Difference]: Finished difference. Result has 371 places, 377 transitions, 764 flow [2024-10-14 17:11:58,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=371, PETRI_TRANSITIONS=377} [2024-10-14 17:11:58,287 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2024-10-14 17:11:58,288 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 377 transitions, 764 flow [2024-10-14 17:11:58,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:58,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:58,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:58,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:11:58,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:58,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1746765296, now seen corresponding path program 1 times [2024-10-14 17:11:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158838515] [2024-10-14 17:11:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:58,356 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-14 17:11:58,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:58,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158838515] [2024-10-14 17:11:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158838515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:58,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601146293] [2024-10-14 17:11:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:58,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:58,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:58,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:58,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-14 17:11:58,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 377 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 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-14 17:11:58,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:58,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-14 17:11:58,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:58,482 INFO L124 PetriNetUnfolderBase]: 32/602 cut-off events. [2024-10-14 17:11:58,483 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:11:58,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 602 events. 32/602 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2760 event pairs, 8 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 583. Up to 29 conditions per place. [2024-10-14 17:11:58,493 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-10-14 17:11:58,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 376 transitions, 790 flow [2024-10-14 17:11:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2024-10-14 17:11:58,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2024-10-14 17:11:58,496 INFO L175 Difference]: Start difference. First operand has 371 places, 377 transitions, 764 flow. Second operand 3 states and 1176 transitions. [2024-10-14 17:11:58,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 376 transitions, 790 flow [2024-10-14 17:11:58,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 376 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:58,503 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 762 flow [2024-10-14 17:11:58,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=370, PETRI_TRANSITIONS=376} [2024-10-14 17:11:58,506 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2024-10-14 17:11:58,506 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 762 flow [2024-10-14 17:11:58,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 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-14 17:11:58,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:58,515 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-14 17:11:58,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:11:58,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:58,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash 639497774, now seen corresponding path program 1 times [2024-10-14 17:11:58,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:58,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88779608] [2024-10-14 17:11:58,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:58,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:58,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-14 17:11:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88779608] [2024-10-14 17:11:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88779608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:58,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675129958] [2024-10-14 17:11:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:58,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2024-10-14 17:11:58,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 376 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 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-14 17:11:58,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:58,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2024-10-14 17:11:58,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:58,746 INFO L124 PetriNetUnfolderBase]: 64/971 cut-off events. [2024-10-14 17:11:58,747 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-14 17:11:58,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 64/971 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5214 event pairs, 20 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 963. Up to 50 conditions per place. [2024-10-14 17:11:58,762 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2024-10-14 17:11:58,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 375 transitions, 790 flow [2024-10-14 17:11:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2024-10-14 17:11:58,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2024-10-14 17:11:58,766 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 762 flow. Second operand 3 states and 1174 transitions. [2024-10-14 17:11:58,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 375 transitions, 790 flow [2024-10-14 17:11:58,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:58,773 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 760 flow [2024-10-14 17:11:58,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=369, PETRI_TRANSITIONS=375} [2024-10-14 17:11:58,774 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2024-10-14 17:11:58,774 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 760 flow [2024-10-14 17:11:58,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 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-14 17:11:58,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:58,775 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] [2024-10-14 17:11:58,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:11:58,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:58,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash -447938175, now seen corresponding path program 1 times [2024-10-14 17:11:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:58,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111579686] [2024-10-14 17:11:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:58,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:58,842 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-14 17:11:58,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:58,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111579686] [2024-10-14 17:11:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111579686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:58,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:58,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496697152] [2024-10-14 17:11:58,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:58,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:58,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:58,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:58,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-14 17:11:58,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 375 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:58,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:58,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-14 17:11:58,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:58,993 INFO L124 PetriNetUnfolderBase]: 35/709 cut-off events. [2024-10-14 17:11:58,993 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-10-14 17:11:58,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 709 events. 35/709 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3503 event pairs, 7 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 670. Up to 25 conditions per place. [2024-10-14 17:11:59,005 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2024-10-14 17:11:59,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 784 flow [2024-10-14 17:11:59,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-14 17:11:59,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-14 17:11:59,011 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 760 flow. Second operand 3 states and 1178 transitions. [2024-10-14 17:11:59,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 784 flow [2024-10-14 17:11:59,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:59,018 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 758 flow [2024-10-14 17:11:59,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2024-10-14 17:11:59,019 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2024-10-14 17:11:59,019 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 758 flow [2024-10-14 17:11:59,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 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-14 17:11:59,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:59,021 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] [2024-10-14 17:11:59,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:11:59,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:59,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1577847982, now seen corresponding path program 1 times [2024-10-14 17:11:59,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:59,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415110606] [2024-10-14 17:11:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:59,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:59,072 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-14 17:11:59,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:59,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415110606] [2024-10-14 17:11:59,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415110606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:59,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:59,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469747560] [2024-10-14 17:11:59,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:59,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:59,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:59,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:59,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:59,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-14 17:11:59,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 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-14 17:11:59,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:59,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-14 17:11:59,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:59,202 INFO L124 PetriNetUnfolderBase]: 36/713 cut-off events. [2024-10-14 17:11:59,202 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-14 17:11:59,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 713 events. 36/713 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3722 event pairs, 8 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 670. Up to 29 conditions per place. [2024-10-14 17:11:59,213 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-10-14 17:11:59,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 784 flow [2024-10-14 17:11:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2024-10-14 17:11:59,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2024-10-14 17:11:59,217 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 758 flow. Second operand 3 states and 1176 transitions. [2024-10-14 17:11:59,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 784 flow [2024-10-14 17:11:59,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:59,224 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 756 flow [2024-10-14 17:11:59,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2024-10-14 17:11:59,225 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2024-10-14 17:11:59,225 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 756 flow [2024-10-14 17:11:59,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 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-14 17:11:59,226 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:59,226 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] [2024-10-14 17:11:59,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:11:59,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:59,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1051413800, now seen corresponding path program 1 times [2024-10-14 17:11:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:59,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266627195] [2024-10-14 17:11:59,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:59,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:59,266 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-14 17:11:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:59,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266627195] [2024-10-14 17:11:59,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266627195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:59,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:59,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:59,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110094880] [2024-10-14 17:11:59,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:59,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:59,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:59,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:59,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2024-10-14 17:11:59,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 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-14 17:11:59,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:59,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2024-10-14 17:11:59,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:59,423 INFO L124 PetriNetUnfolderBase]: 40/564 cut-off events. [2024-10-14 17:11:59,424 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2024-10-14 17:11:59,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 564 events. 40/564 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2627 event pairs, 20 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 532. Up to 50 conditions per place. [2024-10-14 17:11:59,433 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-14 17:11:59,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 784 flow [2024-10-14 17:11:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2024-10-14 17:11:59,437 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2024-10-14 17:11:59,437 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 756 flow. Second operand 3 states and 1174 transitions. [2024-10-14 17:11:59,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 784 flow [2024-10-14 17:11:59,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:59,444 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 754 flow [2024-10-14 17:11:59,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2024-10-14 17:11:59,445 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2024-10-14 17:11:59,445 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 754 flow [2024-10-14 17:11:59,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 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-14 17:11:59,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:59,447 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] [2024-10-14 17:11:59,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:11:59,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:59,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1398066235, now seen corresponding path program 1 times [2024-10-14 17:11:59,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:59,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083881962] [2024-10-14 17:11:59,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:59,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:59,519 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-14 17:11:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083881962] [2024-10-14 17:11:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083881962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:59,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047678879] [2024-10-14 17:11:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:59,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:59,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-14 17:11:59,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 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-14 17:11:59,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:59,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-14 17:11:59,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:59,709 INFO L124 PetriNetUnfolderBase]: 76/1238 cut-off events. [2024-10-14 17:11:59,710 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:11:59,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1238 events. 76/1238 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8585 event pairs, 13 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1202. Up to 43 conditions per place. [2024-10-14 17:11:59,727 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2024-10-14 17:11:59,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 374 transitions, 790 flow [2024-10-14 17:11:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2024-10-14 17:11:59,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2024-10-14 17:11:59,731 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 754 flow. Second operand 3 states and 1187 transitions. [2024-10-14 17:11:59,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 374 transitions, 790 flow [2024-10-14 17:11:59,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:59,737 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 760 flow [2024-10-14 17:11:59,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2024-10-14 17:11:59,739 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-14 17:11:59,739 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 760 flow [2024-10-14 17:11:59,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 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-14 17:11:59,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:59,740 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] [2024-10-14 17:11:59,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:11:59,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:11:59,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1492401106, now seen corresponding path program 1 times [2024-10-14 17:11:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:59,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861217417] [2024-10-14 17:11:59,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:59,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:59,788 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-14 17:11:59,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:59,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861217417] [2024-10-14 17:11:59,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861217417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:59,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:59,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:59,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756215067] [2024-10-14 17:11:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:59,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:59,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:59,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:59,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-14 17:11:59,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 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-14 17:11:59,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:59,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-14 17:11:59,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:59,973 INFO L124 PetriNetUnfolderBase]: 69/1058 cut-off events. [2024-10-14 17:11:59,973 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:11:59,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 1058 events. 69/1058 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6756 event pairs, 10 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 942. Up to 49 conditions per place. [2024-10-14 17:11:59,994 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 15 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2024-10-14 17:11:59,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 374 transitions, 802 flow [2024-10-14 17:11:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2024-10-14 17:11:59,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2024-10-14 17:11:59,998 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 760 flow. Second operand 3 states and 1182 transitions. [2024-10-14 17:11:59,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 374 transitions, 802 flow [2024-10-14 17:12:00,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:00,005 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 775 flow [2024-10-14 17:12:00,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2024-10-14 17:12:00,006 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-14 17:12:00,006 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 775 flow [2024-10-14 17:12:00,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 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-14 17:12:00,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:00,008 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] [2024-10-14 17:12:00,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:12:00,009 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:00,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:00,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1381044782, now seen corresponding path program 1 times [2024-10-14 17:12:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:00,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204013781] [2024-10-14 17:12:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:00,071 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-14 17:12:00,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:00,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204013781] [2024-10-14 17:12:00,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204013781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:00,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109389259] [2024-10-14 17:12:00,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:00,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:00,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:00,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:00,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:00,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-14 17:12:00,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 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-14 17:12:00,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:00,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-14 17:12:00,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:00,301 INFO L124 PetriNetUnfolderBase]: 70/1296 cut-off events. [2024-10-14 17:12:00,302 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2024-10-14 17:12:00,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 1296 events. 70/1296 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9339 event pairs, 4 based on Foata normal form. 1/1110 useless extension candidates. Maximal degree in co-relation 1117. Up to 53 conditions per place. [2024-10-14 17:12:00,315 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-10-14 17:12:00,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 377 transitions, 826 flow [2024-10-14 17:12:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-14 17:12:00,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2024-10-14 17:12:00,318 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 775 flow. Second operand 3 states and 1190 transitions. [2024-10-14 17:12:00,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 377 transitions, 826 flow [2024-10-14 17:12:00,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 377 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:00,324 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 785 flow [2024-10-14 17:12:00,325 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2024-10-14 17:12:00,325 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2024-10-14 17:12:00,325 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 785 flow [2024-10-14 17:12:00,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 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-14 17:12:00,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:00,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] [2024-10-14 17:12:00,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:12:00,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:00,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1644657233, now seen corresponding path program 1 times [2024-10-14 17:12:00,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:00,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222234746] [2024-10-14 17:12:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:00,369 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-14 17:12:00,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:00,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222234746] [2024-10-14 17:12:00,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222234746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:00,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655392546] [2024-10-14 17:12:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:00,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:00,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 412 [2024-10-14 17:12:00,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 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-14 17:12:00,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:00,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 412 [2024-10-14 17:12:00,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:00,549 INFO L124 PetriNetUnfolderBase]: 57/1056 cut-off events. [2024-10-14 17:12:00,550 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2024-10-14 17:12:00,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 1056 events. 57/1056 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6850 event pairs, 8 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 957. Up to 32 conditions per place. [2024-10-14 17:12:00,568 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-10-14 17:12:00,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 373 transitions, 815 flow [2024-10-14 17:12:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2024-10-14 17:12:00,572 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2024-10-14 17:12:00,572 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 785 flow. Second operand 3 states and 1187 transitions. [2024-10-14 17:12:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 373 transitions, 815 flow [2024-10-14 17:12:00,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:00,579 INFO L231 Difference]: Finished difference. Result has 367 places, 371 transitions, 787 flow [2024-10-14 17:12:00,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=367, PETRI_TRANSITIONS=371} [2024-10-14 17:12:00,580 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2024-10-14 17:12:00,580 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 371 transitions, 787 flow [2024-10-14 17:12:00,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 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-14 17:12:00,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:00,582 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] [2024-10-14 17:12:00,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:12:00,582 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:00,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash -375103681, now seen corresponding path program 1 times [2024-10-14 17:12:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:00,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910576488] [2024-10-14 17:12:00,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:00,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:00,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910576488] [2024-10-14 17:12:00,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910576488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:00,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:00,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572160178] [2024-10-14 17:12:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:00,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:00,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2024-10-14 17:12:00,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 371 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 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-14 17:12:00,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:00,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2024-10-14 17:12:00,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:01,195 INFO L124 PetriNetUnfolderBase]: 344/3908 cut-off events. [2024-10-14 17:12:01,195 INFO L125 PetriNetUnfolderBase]: For 62/74 co-relation queries the response was YES. [2024-10-14 17:12:01,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 3908 events. 344/3908 cut-off events. For 62/74 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 40513 event pairs, 96 based on Foata normal form. 0/3321 useless extension candidates. Maximal degree in co-relation 3500. Up to 312 conditions per place. [2024-10-14 17:12:01,228 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 17 selfloop transitions, 4 changer transitions 0/373 dead transitions. [2024-10-14 17:12:01,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 373 transitions, 835 flow [2024-10-14 17:12:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1177 transitions. [2024-10-14 17:12:01,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9522653721682848 [2024-10-14 17:12:01,233 INFO L175 Difference]: Start difference. First operand has 367 places, 371 transitions, 787 flow. Second operand 3 states and 1177 transitions. [2024-10-14 17:12:01,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 373 transitions, 835 flow [2024-10-14 17:12:01,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:01,240 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 803 flow [2024-10-14 17:12:01,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2024-10-14 17:12:01,241 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-14 17:12:01,242 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 803 flow [2024-10-14 17:12:01,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 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-14 17:12:01,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:01,243 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] [2024-10-14 17:12:01,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:12:01,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1214327577, now seen corresponding path program 1 times [2024-10-14 17:12:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399487263] [2024-10-14 17:12:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:01,287 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-14 17:12:01,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399487263] [2024-10-14 17:12:01,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399487263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:01,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:01,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:01,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601271469] [2024-10-14 17:12:01,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:01,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:01,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:01,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:01,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-14 17:12:01,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 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-14 17:12:01,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:01,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-14 17:12:01,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:01,747 INFO L124 PetriNetUnfolderBase]: 167/2950 cut-off events. [2024-10-14 17:12:01,747 INFO L125 PetriNetUnfolderBase]: For 23/34 co-relation queries the response was YES. [2024-10-14 17:12:01,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 2950 events. 167/2950 cut-off events. For 23/34 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 27821 event pairs, 20 based on Foata normal form. 1/2540 useless extension candidates. Maximal degree in co-relation 2794. Up to 133 conditions per place. [2024-10-14 17:12:01,776 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 18 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2024-10-14 17:12:01,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 376 transitions, 860 flow [2024-10-14 17:12:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-14 17:12:01,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-14 17:12:01,779 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 803 flow. Second operand 3 states and 1185 transitions. [2024-10-14 17:12:01,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 376 transitions, 860 flow [2024-10-14 17:12:01,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 376 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:01,786 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 818 flow [2024-10-14 17:12:01,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2024-10-14 17:12:01,788 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-14 17:12:01,788 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 818 flow [2024-10-14 17:12:01,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 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-14 17:12:01,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:01,789 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] [2024-10-14 17:12:01,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:12:01,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:01,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:01,790 INFO L85 PathProgramCache]: Analyzing trace with hash -475719494, now seen corresponding path program 1 times [2024-10-14 17:12:01,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:01,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24556782] [2024-10-14 17:12:01,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:01,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:01,829 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-14 17:12:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24556782] [2024-10-14 17:12:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24556782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:01,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086236500] [2024-10-14 17:12:01,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:01,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:01,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:01,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-14 17:12:01,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 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-14 17:12:01,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:01,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-14 17:12:01,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:02,250 INFO L124 PetriNetUnfolderBase]: 114/2582 cut-off events. [2024-10-14 17:12:02,250 INFO L125 PetriNetUnfolderBase]: For 12/18 co-relation queries the response was YES. [2024-10-14 17:12:02,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 2582 events. 114/2582 cut-off events. For 12/18 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 23033 event pairs, 4 based on Foata normal form. 0/2258 useless extension candidates. Maximal degree in co-relation 2341. Up to 68 conditions per place. [2024-10-14 17:12:02,282 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-10-14 17:12:02,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 376 transitions, 869 flow [2024-10-14 17:12:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-14 17:12:02,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2024-10-14 17:12:02,285 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 818 flow. Second operand 3 states and 1190 transitions. [2024-10-14 17:12:02,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 376 transitions, 869 flow [2024-10-14 17:12:02,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:02,291 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 828 flow [2024-10-14 17:12:02,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2024-10-14 17:12:02,292 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-14 17:12:02,292 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 828 flow [2024-10-14 17:12:02,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 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-14 17:12:02,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:02,293 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] [2024-10-14 17:12:02,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:12:02,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:02,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1624830416, now seen corresponding path program 1 times [2024-10-14 17:12:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:02,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347780358] [2024-10-14 17:12:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:02,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347780358] [2024-10-14 17:12:02,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347780358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:02,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:02,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:02,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799814096] [2024-10-14 17:12:02,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:02,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:02,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:02,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:02,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:02,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-14 17:12:02,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 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-14 17:12:02,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:02,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-14 17:12:02,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:02,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1006] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~nondet12#1][173], [437#(= |#race~is_null_3~0| 0), 139#L50-40true, Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:02,752 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2024-10-14 17:12:02,752 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-14 17:12:02,752 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-14 17:12:02,752 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-14 17:12:02,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][225], [437#(= |#race~is_null_3~0| 0), 139#L50-40true, Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:02,780 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2024-10-14 17:12:02,780 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-14 17:12:02,780 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-14 17:12:02,781 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-14 17:12:02,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][265], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 460#(= |#race~result_10~0| |thread2Thread1of1ForFork2_#t~nondet12#1|), Black: 431#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L50-41true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:02,781 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-10-14 17:12:02,781 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-14 17:12:02,781 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-14 17:12:02,781 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-10-14 17:12:02,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][265], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 387#L50-42true, 460#(= |#race~result_10~0| |thread2Thread1of1ForFork2_#t~nondet12#1|), Black: 431#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:02,786 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-14 17:12:02,786 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-14 17:12:02,786 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-14 17:12:02,786 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-14 17:12:02,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][225], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 100#L52true, Black: 431#true, 458#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:02,807 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-10-14 17:12:02,807 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-10-14 17:12:02,807 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-10-14 17:12:02,808 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-10-14 17:12:02,844 INFO L124 PetriNetUnfolderBase]: 227/3804 cut-off events. [2024-10-14 17:12:02,845 INFO L125 PetriNetUnfolderBase]: For 44/113 co-relation queries the response was YES. [2024-10-14 17:12:02,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 3804 events. 227/3804 cut-off events. For 44/113 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 36952 event pairs, 28 based on Foata normal form. 1/3299 useless extension candidates. Maximal degree in co-relation 3487. Up to 120 conditions per place. [2024-10-14 17:12:02,893 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-14 17:12:02,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 372 transitions, 860 flow [2024-10-14 17:12:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-14 17:12:02,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-14 17:12:02,896 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 828 flow. Second operand 3 states and 1185 transitions. [2024-10-14 17:12:02,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 372 transitions, 860 flow [2024-10-14 17:12:02,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:02,906 INFO L231 Difference]: Finished difference. Result has 366 places, 370 transitions, 830 flow [2024-10-14 17:12:02,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=366, PETRI_TRANSITIONS=370} [2024-10-14 17:12:02,907 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2024-10-14 17:12:02,907 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 370 transitions, 830 flow [2024-10-14 17:12:02,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 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-14 17:12:02,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:02,908 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] [2024-10-14 17:12:02,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:12:02,909 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:02,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1899868835, now seen corresponding path program 1 times [2024-10-14 17:12:02,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:02,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78841953] [2024-10-14 17:12:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:02,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:02,951 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-14 17:12:02,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:02,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78841953] [2024-10-14 17:12:02,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78841953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:02,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:02,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:02,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159055701] [2024-10-14 17:12:02,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:02,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:02,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:02,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:02,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-14 17:12:02,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 370 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 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-14 17:12:02,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:02,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-14 17:12:02,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:03,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= 0 |#race~filename_is_null_5~0|), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), 299#L56-25true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:03,531 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2024-10-14 17:12:03,531 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-10-14 17:12:03,531 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2024-10-14 17:12:03,532 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-10-14 17:12:03,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= 0 |#race~filename_is_null_5~0|), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), 193#L56-26true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:03,537 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2024-10-14 17:12:03,537 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-10-14 17:12:03,537 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-10-14 17:12:03,537 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2024-10-14 17:12:03,561 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), 299#L56-25true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:03,561 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2024-10-14 17:12:03,561 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2024-10-14 17:12:03,562 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2024-10-14 17:12:03,562 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2024-10-14 17:12:03,562 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2024-10-14 17:12:03,563 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), 193#L56-26true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:03,563 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is not cut-off event [2024-10-14 17:12:03,563 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is not cut-off event [2024-10-14 17:12:03,563 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2024-10-14 17:12:03,564 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2024-10-14 17:12:03,564 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is not cut-off event [2024-10-14 17:12:03,589 INFO L124 PetriNetUnfolderBase]: 126/3370 cut-off events. [2024-10-14 17:12:03,590 INFO L125 PetriNetUnfolderBase]: For 43/80 co-relation queries the response was YES. [2024-10-14 17:12:03,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 3370 events. 126/3370 cut-off events. For 43/80 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 30759 event pairs, 14 based on Foata normal form. 2/3002 useless extension candidates. Maximal degree in co-relation 3242. Up to 140 conditions per place. [2024-10-14 17:12:03,639 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2024-10-14 17:12:03,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 375 transitions, 881 flow [2024-10-14 17:12:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-14 17:12:03,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2024-10-14 17:12:03,643 INFO L175 Difference]: Start difference. First operand has 366 places, 370 transitions, 830 flow. Second operand 3 states and 1190 transitions. [2024-10-14 17:12:03,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 375 transitions, 881 flow [2024-10-14 17:12:03,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 375 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:03,651 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 836 flow [2024-10-14 17:12:03,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2024-10-14 17:12:03,651 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-14 17:12:03,652 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 836 flow [2024-10-14 17:12:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 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-14 17:12:03,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:03,652 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] [2024-10-14 17:12:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:12:03,653 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:03,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:03,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1355541654, now seen corresponding path program 1 times [2024-10-14 17:12:03,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565077464] [2024-10-14 17:12:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:03,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:03,699 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-14 17:12:03,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565077464] [2024-10-14 17:12:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565077464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:03,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704402780] [2024-10-14 17:12:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:03,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:03,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:03,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:03,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:03,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2024-10-14 17:12:03,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 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-14 17:12:03,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:03,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2024-10-14 17:12:03,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:04,766 INFO L124 PetriNetUnfolderBase]: 456/7770 cut-off events. [2024-10-14 17:12:04,766 INFO L125 PetriNetUnfolderBase]: For 134/150 co-relation queries the response was YES. [2024-10-14 17:12:04,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 7770 events. 456/7770 cut-off events. For 134/150 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 92500 event pairs, 76 based on Foata normal form. 2/7022 useless extension candidates. Maximal degree in co-relation 7734. Up to 616 conditions per place. [2024-10-14 17:12:04,861 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 19 selfloop transitions, 4 changer transitions 0/374 dead transitions. [2024-10-14 17:12:04,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 374 transitions, 894 flow [2024-10-14 17:12:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2024-10-14 17:12:04,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9538834951456311 [2024-10-14 17:12:04,865 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 836 flow. Second operand 3 states and 1179 transitions. [2024-10-14 17:12:04,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 374 transitions, 894 flow [2024-10-14 17:12:04,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 374 transitions, 894 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:04,872 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 856 flow [2024-10-14 17:12:04,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2024-10-14 17:12:04,873 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-14 17:12:04,874 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 856 flow [2024-10-14 17:12:04,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 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-14 17:12:04,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:04,875 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] [2024-10-14 17:12:04,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:12:04,875 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:04,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash 136961259, now seen corresponding path program 1 times [2024-10-14 17:12:04,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:04,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048439603] [2024-10-14 17:12:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:04,918 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-14 17:12:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048439603] [2024-10-14 17:12:04,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048439603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:04,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:04,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:04,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475854174] [2024-10-14 17:12:04,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:04,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:04,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:04,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:04,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-14 17:12:04,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 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-14 17:12:04,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:04,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-14 17:12:04,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:05,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,444 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2024-10-14 17:12:05,444 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-14 17:12:05,444 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-14 17:12:05,444 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-14 17:12:05,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,524 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,524 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-14 17:12:05,524 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,524 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,525 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,526 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-10-14 17:12:05,526 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-14 17:12:05,526 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,526 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,526 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,527 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-10-14 17:12:05,527 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-14 17:12:05,528 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,528 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,528 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,528 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,528 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-14 17:12:05,528 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,528 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,528 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-14 17:12:05,528 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,528 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2024-10-14 17:12:05,528 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-14 17:12:05,529 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,529 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,529 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-14 17:12:05,529 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,530 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,530 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,530 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-14 17:12:05,531 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,531 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-14 17:12:05,531 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-14 17:12:05,531 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,531 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-14 17:12:05,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,534 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-14 17:12:05,534 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:05,534 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:05,534 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-14 17:12:05,535 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,535 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-10-14 17:12:05,535 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:05,535 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:05,535 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:05,535 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-14 17:12:05,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 98#L56-42true, Black: 439#true, 46#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,539 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2024-10-14 17:12:05,539 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-14 17:12:05,539 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-14 17:12:05,539 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-14 17:12:05,540 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 98#L56-42true, Black: 439#true, 46#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,540 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-10-14 17:12:05,540 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-14 17:12:05,540 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-14 17:12:05,540 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-10-14 17:12:05,541 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-14 17:12:05,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 45#L58true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,550 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-10-14 17:12:05,550 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,550 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-14 17:12:05,550 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,550 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 45#L58true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,550 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-10-14 17:12:05,551 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,551 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-14 17:12:05,551 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-14 17:12:05,551 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:05,552 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,552 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is not cut-off event [2024-10-14 17:12:05,552 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2024-10-14 17:12:05,552 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-14 17:12:05,552 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-14 17:12:05,553 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-10-14 17:12:05,553 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-10-14 17:12:05,553 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,553 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2024-10-14 17:12:05,553 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:05,553 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:05,553 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:05,553 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-10-14 17:12:05,553 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-14 17:12:05,555 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, 98#L56-42true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,556 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2024-10-14 17:12:05,556 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-14 17:12:05,556 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-14 17:12:05,556 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-10-14 17:12:05,556 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-14 17:12:05,556 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-14 17:12:05,561 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 45#L58true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:05,562 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is not cut-off event [2024-10-14 17:12:05,562 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-14 17:12:05,562 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is not cut-off event [2024-10-14 17:12:05,562 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-14 17:12:05,562 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-14 17:12:05,562 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2024-10-14 17:12:05,576 INFO L124 PetriNetUnfolderBase]: 368/4189 cut-off events. [2024-10-14 17:12:05,576 INFO L125 PetriNetUnfolderBase]: For 239/376 co-relation queries the response was YES. [2024-10-14 17:12:05,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5318 conditions, 4189 events. 368/4189 cut-off events. For 239/376 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 43461 event pairs, 82 based on Foata normal form. 2/3815 useless extension candidates. Maximal degree in co-relation 4684. Up to 427 conditions per place. [2024-10-14 17:12:05,640 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-10-14 17:12:05,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 371 transitions, 888 flow [2024-10-14 17:12:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-14 17:12:05,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-14 17:12:05,643 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 856 flow. Second operand 3 states and 1185 transitions. [2024-10-14 17:12:05,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 371 transitions, 888 flow [2024-10-14 17:12:05,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:05,649 INFO L231 Difference]: Finished difference. Result has 365 places, 369 transitions, 858 flow [2024-10-14 17:12:05,650 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=365, PETRI_TRANSITIONS=369} [2024-10-14 17:12:05,650 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-14 17:12:05,650 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 369 transitions, 858 flow [2024-10-14 17:12:05,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 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-14 17:12:05,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:05,651 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] [2024-10-14 17:12:05,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:12:05,651 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:05,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash 239459324, now seen corresponding path program 1 times [2024-10-14 17:12:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:05,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363274654] [2024-10-14 17:12:05,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:05,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:05,692 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-14 17:12:05,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:05,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363274654] [2024-10-14 17:12:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363274654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:05,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:05,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239995374] [2024-10-14 17:12:05,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:05,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:05,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:05,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:05,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-14 17:12:05,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 369 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 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-14 17:12:05,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:05,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-14 17:12:05,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:06,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] thread3EXIT-->L80: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][348], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 104#L80true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 472#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:06,364 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2024-10-14 17:12:06,364 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-10-14 17:12:06,364 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2024-10-14 17:12:06,364 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-10-14 17:12:06,434 INFO L124 PetriNetUnfolderBase]: 240/5812 cut-off events. [2024-10-14 17:12:06,434 INFO L125 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2024-10-14 17:12:06,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6721 conditions, 5812 events. 240/5812 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 62759 event pairs, 20 based on Foata normal form. 0/5413 useless extension candidates. Maximal degree in co-relation 5910. Up to 300 conditions per place. [2024-10-14 17:12:06,483 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 15 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-10-14 17:12:06,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 373 transitions, 904 flow [2024-10-14 17:12:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2024-10-14 17:12:06,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2024-10-14 17:12:06,487 INFO L175 Difference]: Start difference. First operand has 365 places, 369 transitions, 858 flow. Second operand 3 states and 1189 transitions. [2024-10-14 17:12:06,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 373 transitions, 904 flow [2024-10-14 17:12:06,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:06,498 INFO L231 Difference]: Finished difference. Result has 364 places, 369 transitions, 864 flow [2024-10-14 17:12:06,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=364, PETRI_TRANSITIONS=369} [2024-10-14 17:12:06,499 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-14 17:12:06,499 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 369 transitions, 864 flow [2024-10-14 17:12:06,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 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-14 17:12:06,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:06,500 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] [2024-10-14 17:12:06,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:12:06,500 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:06,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1141967850, now seen corresponding path program 1 times [2024-10-14 17:12:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073210193] [2024-10-14 17:12:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:06,560 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-14 17:12:06,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:06,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073210193] [2024-10-14 17:12:06,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073210193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:06,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:06,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:06,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057563021] [2024-10-14 17:12:06,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:06,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:06,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:06,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 412 [2024-10-14 17:12:06,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 369 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 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-14 17:12:06,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:06,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 412 [2024-10-14 17:12:06,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:07,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] thread3EXIT-->L80: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 104#L80true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, Black: 472#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:07,257 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-10-14 17:12:07,258 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:07,258 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:07,258 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-10-14 17:12:07,261 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1156] thread3EXIT-->L80: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 104#L80true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, Black: 472#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:07,262 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-10-14 17:12:07,262 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-14 17:12:07,262 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-14 17:12:07,262 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-14 17:12:07,262 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-14 17:12:07,263 INFO L124 PetriNetUnfolderBase]: 193/5368 cut-off events. [2024-10-14 17:12:07,263 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2024-10-14 17:12:07,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 5368 events. 193/5368 cut-off events. For 21/57 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 56682 event pairs, 6 based on Foata normal form. 0/5015 useless extension candidates. Maximal degree in co-relation 5455. Up to 147 conditions per place. [2024-10-14 17:12:07,316 INFO L140 encePairwiseOnDemand]: 410/412 looper letters, 8 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2024-10-14 17:12:07,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 368 transitions, 880 flow [2024-10-14 17:12:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2024-10-14 17:12:07,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2024-10-14 17:12:07,320 INFO L175 Difference]: Start difference. First operand has 364 places, 369 transitions, 864 flow. Second operand 3 states and 1189 transitions. [2024-10-14 17:12:07,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 368 transitions, 880 flow [2024-10-14 17:12:07,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 368 transitions, 880 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:07,326 INFO L231 Difference]: Finished difference. Result has 365 places, 368 transitions, 864 flow [2024-10-14 17:12:07,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=365, PETRI_TRANSITIONS=368} [2024-10-14 17:12:07,327 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-14 17:12:07,327 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 368 transitions, 864 flow [2024-10-14 17:12:07,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 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-14 17:12:07,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:07,328 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-14 17:12:07,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 17:12:07,328 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:07,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:07,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1800932855, now seen corresponding path program 1 times [2024-10-14 17:12:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:07,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150675374] [2024-10-14 17:12:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:07,385 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-14 17:12:07,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:07,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150675374] [2024-10-14 17:12:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150675374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:07,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:07,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435345416] [2024-10-14 17:12:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:07,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:07,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:07,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-14 17:12:07,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 368 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 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-14 17:12:07,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:07,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-14 17:12:07,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:08,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] thread3EXIT-->L80: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 104#L80true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, Black: 472#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:08,324 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-10-14 17:12:08,325 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-14 17:12:08,325 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-14 17:12:08,325 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-14 17:12:08,326 INFO L124 PetriNetUnfolderBase]: 199/5682 cut-off events. [2024-10-14 17:12:08,326 INFO L125 PetriNetUnfolderBase]: For 21/68 co-relation queries the response was YES. [2024-10-14 17:12:08,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6506 conditions, 5682 events. 199/5682 cut-off events. For 21/68 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 61200 event pairs, 18 based on Foata normal form. 0/5317 useless extension candidates. Maximal degree in co-relation 6206. Up to 166 conditions per place. [2024-10-14 17:12:08,382 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 10 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2024-10-14 17:12:08,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 366 transitions, 882 flow [2024-10-14 17:12:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1183 transitions. [2024-10-14 17:12:08,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9571197411003236 [2024-10-14 17:12:08,385 INFO L175 Difference]: Start difference. First operand has 365 places, 368 transitions, 864 flow. Second operand 3 states and 1183 transitions. [2024-10-14 17:12:08,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 366 transitions, 882 flow [2024-10-14 17:12:08,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 366 transitions, 881 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:08,392 INFO L231 Difference]: Finished difference. Result has 364 places, 366 transitions, 861 flow [2024-10-14 17:12:08,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=364, PETRI_TRANSITIONS=366} [2024-10-14 17:12:08,393 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-14 17:12:08,393 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 366 transitions, 861 flow [2024-10-14 17:12:08,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 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-14 17:12:08,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:08,394 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] [2024-10-14 17:12:08,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 17:12:08,395 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-14 17:12:08,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:08,395 INFO L85 PathProgramCache]: Analyzing trace with hash -326767216, now seen corresponding path program 1 times [2024-10-14 17:12:08,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:08,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309280268] [2024-10-14 17:12:08,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:08,446 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-14 17:12:08,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:08,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309280268] [2024-10-14 17:12:08,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309280268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:08,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:08,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216129186] [2024-10-14 17:12:08,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:08,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:08,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:08,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:08,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:08,459 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-14 17:12:08,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 366 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 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-14 17:12:08,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:08,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-14 17:12:08,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:08,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 164#L56-41true, 479#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 472#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:08,986 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2024-10-14 17:12:08,986 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-10-14 17:12:08,987 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-14 17:12:08,987 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-14 17:12:09,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:09,048 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,048 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,048 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,048 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,064 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:09,064 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,064 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,064 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,064 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,065 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:09,065 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,065 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,065 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,065 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,065 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:09,066 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2024-10-14 17:12:09,066 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,066 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,066 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,066 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,066 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,068 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:09,069 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,069 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,069 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,069 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-14 17:12:09,069 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-14 17:12:09,073 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-14 17:12:09,073 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2024-10-14 17:12:09,073 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-14 17:12:09,073 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event [2024-10-14 17:12:09,073 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-10-14 17:12:09,073 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-10-14 17:12:09,073 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-14 17:12:09,073 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-14 17:12:09,076 INFO L124 PetriNetUnfolderBase]: 203/4061 cut-off events. [2024-10-14 17:12:09,076 INFO L125 PetriNetUnfolderBase]: For 63/114 co-relation queries the response was YES. [2024-10-14 17:12:09,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 4061 events. 203/4061 cut-off events. For 63/114 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 41112 event pairs, 48 based on Foata normal form. 12/3785 useless extension candidates. Maximal degree in co-relation 4647. Up to 248 conditions per place. [2024-10-14 17:12:09,105 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2024-10-14 17:12:09,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 364 transitions, 877 flow [2024-10-14 17:12:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2024-10-14 17:12:09,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2024-10-14 17:12:09,108 INFO L175 Difference]: Start difference. First operand has 364 places, 366 transitions, 861 flow. Second operand 3 states and 1182 transitions. [2024-10-14 17:12:09,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 364 transitions, 877 flow [2024-10-14 17:12:09,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 364 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:09,112 INFO L231 Difference]: Finished difference. Result has 363 places, 0 transitions, 0 flow [2024-10-14 17:12:09,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=363, PETRI_TRANSITIONS=0} [2024-10-14 17:12:09,113 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -17 predicate places. [2024-10-14 17:12:09,113 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 0 transitions, 0 flow [2024-10-14 17:12:09,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 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-14 17:12:09,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2024-10-14 17:12:09,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2024-10-14 17:12:09,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2024-10-14 17:12:09,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2024-10-14 17:12:09,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2024-10-14 17:12:09,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2024-10-14 17:12:09,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2024-10-14 17:12:09,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2024-10-14 17:12:09,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2024-10-14 17:12:09,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2024-10-14 17:12:09,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2024-10-14 17:12:09,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2024-10-14 17:12:09,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2024-10-14 17:12:09,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2024-10-14 17:12:09,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2024-10-14 17:12:09,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2024-10-14 17:12:09,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2024-10-14 17:12:09,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2024-10-14 17:12:09,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2024-10-14 17:12:09,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2024-10-14 17:12:09,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2024-10-14 17:12:09,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2024-10-14 17:12:09,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2024-10-14 17:12:09,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2024-10-14 17:12:09,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2024-10-14 17:12:09,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2024-10-14 17:12:09,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2024-10-14 17:12:09,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2024-10-14 17:12:09,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2024-10-14 17:12:09,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2024-10-14 17:12:09,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2024-10-14 17:12:09,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2024-10-14 17:12:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 17:12:09,125 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:09,131 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:12:09,132 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:12:09,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:12:09 BasicIcfg [2024-10-14 17:12:09,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:12:09,138 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:12:09,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:12:09,138 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:12:09,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:56" (3/4) ... [2024-10-14 17:12:09,139 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:12:09,143 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:12:09,143 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:12:09,143 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-14 17:12:09,149 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-14 17:12:09,149 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:12:09,149 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:12:09,150 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:12:09,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:12:09,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:12:09,233 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:12:09,234 INFO L158 Benchmark]: Toolchain (without parser) took 14079.40ms. Allocated memory was 123.7MB in the beginning and 887.1MB in the end (delta: 763.4MB). Free memory was 52.8MB in the beginning and 669.6MB in the end (delta: -616.8MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2024-10-14 17:12:09,234 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:12:09,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.10ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 52.6MB in the beginning and 120.9MB in the end (delta: -68.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-14 17:12:09,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.45ms. Allocated memory is still 153.1MB. Free memory was 120.9MB in the beginning and 117.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:12:09,237 INFO L158 Benchmark]: Boogie Preprocessor took 47.83ms. Allocated memory is still 153.1MB. Free memory was 117.8MB in the beginning and 115.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:12:09,237 INFO L158 Benchmark]: RCFGBuilder took 780.29ms. Allocated memory is still 153.1MB. Free memory was 115.7MB in the beginning and 87.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 17:12:09,237 INFO L158 Benchmark]: TraceAbstraction took 12722.55ms. Allocated memory was 153.1MB in the beginning and 887.1MB in the end (delta: 734.0MB). Free memory was 86.4MB in the beginning and 675.9MB in the end (delta: -589.6MB). Peak memory consumption was 541.4MB. Max. memory is 16.1GB. [2024-10-14 17:12:09,238 INFO L158 Benchmark]: Witness Printer took 95.94ms. Allocated memory is still 887.1MB. Free memory was 675.9MB in the beginning and 669.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 17:12:09,239 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.10ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 52.6MB in the beginning and 120.9MB in the end (delta: -68.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.45ms. Allocated memory is still 153.1MB. Free memory was 120.9MB in the beginning and 117.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.83ms. Allocated memory is still 153.1MB. Free memory was 117.8MB in the beginning and 115.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 780.29ms. Allocated memory is still 153.1MB. Free memory was 115.7MB in the beginning and 87.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12722.55ms. Allocated memory was 153.1MB in the beginning and 887.1MB in the end (delta: 734.0MB). Free memory was 86.4MB in the beginning and 675.9MB in the end (delta: -589.6MB). Peak memory consumption was 541.4MB. Max. memory is 16.1GB. * Witness Printer took 95.94ms. Allocated memory is still 887.1MB. Free memory was 675.9MB in the beginning and 669.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 620 locations, 71 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.5s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 512 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 660 IncrementalHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 104 mSDtfsCounter, 660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=864occurred in iteration=21, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2446 NumberOfCodeBlocks, 2446 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2422 ConstructedInterpolants, 0 QuantifiedInterpolants, 2470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:12:09,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE