./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:57:13,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:57:13,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:57:13,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:57:13,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:57:13,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:57:13,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:57:13,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:57:13,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:57:13,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:57:13,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:57:13,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:57:13,800 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:57:13,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:57:13,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:57:13,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:57:13,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:57:13,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:57:13,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:57:13,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:57:13,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:57:13,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:57:13,805 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:57:13,805 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:57:13,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:57:13,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:57:13,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:57:13,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:57:13,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:57:13,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:57:13,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:57:13,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:13,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:57:13,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:57:13,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:57:13,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:57:13,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:57:13,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:57:13,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:57:13,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:57:13,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:57:13,810 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-13 09:57:14,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:57:14,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:57:14,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:57:14,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:57:14,153 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:57:14,154 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-13 09:57:15,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:57:15,811 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:57:15,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2024-10-13 09:57:15,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d780c53/e95205c3b4004dd0b6947340e06dcbd0/FLAG8be659ab8 [2024-10-13 09:57:16,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d780c53/e95205c3b4004dd0b6947340e06dcbd0 [2024-10-13 09:57:16,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:57:16,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:57:16,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:16,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:57:16,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:57:16,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2c6efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16, skipping insertion in model container [2024-10-13 09:57:16,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:57:16,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:16,481 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:57:16,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:16,549 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:57:16,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16 WrapperNode [2024-10-13 09:57:16,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:16,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:16,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:57:16,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:57:16,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,618 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 308 [2024-10-13 09:57:16,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:16,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:57:16,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:57:16,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:57:16,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:57:16,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:57:16,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:57:16,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:57:16,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (1/1) ... [2024-10-13 09:57:16,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:16,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:57:16,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:57:16,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:57:16,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:57:16,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:57:16,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:57:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:57:16,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:57:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:57:16,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:57:16,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:57:16,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:57:16,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:57:16,762 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:57:16,937 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:57:16,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:57:17,416 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:57:17,416 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:57:17,445 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:57:17,445 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 09:57:17,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:17 BoogieIcfgContainer [2024-10-13 09:57:17,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:57:17,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:57:17,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:57:17,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:57:17,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:16" (1/3) ... [2024-10-13 09:57:17,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92a4c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:17, skipping insertion in model container [2024-10-13 09:57:17,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:16" (2/3) ... [2024-10-13 09:57:17,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92a4c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:17, skipping insertion in model container [2024-10-13 09:57:17,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:17" (3/3) ... [2024-10-13 09:57:17,452 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2024-10-13 09:57:17,466 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:57:17,466 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-13 09:57:17,467 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:57:17,586 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:57:17,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 412 transitions, 845 flow [2024-10-13 09:57:17,821 INFO L124 PetriNetUnfolderBase]: 21/409 cut-off events. [2024-10-13 09:57:17,821 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:17,837 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-13 09:57:17,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 412 transitions, 845 flow [2024-10-13 09:57:17,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 389 transitions, 796 flow [2024-10-13 09:57:17,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:57:17,877 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;@2c4d12ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:57:17,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-10-13 09:57:17,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:57:17,885 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-13 09:57:17,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:57:17,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:17,886 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:17,887 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-13 09:57:17,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash 795979492, now seen corresponding path program 1 times [2024-10-13 09:57:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:17,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449282292] [2024-10-13 09:57:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:18,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:18,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449282292] [2024-10-13 09:57:18,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449282292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:18,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:18,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312387903] [2024-10-13 09:57:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:18,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:18,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:18,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-13 09:57:18,195 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-13 09:57:18,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:18,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-13 09:57:18,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:18,433 INFO L124 PetriNetUnfolderBase]: 35/716 cut-off events. [2024-10-13 09:57:18,433 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2024-10-13 09:57:18,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 716 events. 35/716 cut-off events. For 17/19 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-13 09:57:18,451 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 11 selfloop transitions, 2 changer transitions 1/381 dead transitions. [2024-10-13 09:57:18,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 381 transitions, 806 flow [2024-10-13 09:57:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-13 09:57:18,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-13 09:57:18,479 INFO L175 Difference]: Start difference. First operand has 380 places, 389 transitions, 796 flow. Second operand 3 states and 1185 transitions. [2024-10-13 09:57:18,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 381 transitions, 806 flow [2024-10-13 09:57:18,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 794 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 09:57:18,494 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 770 flow [2024-10-13 09:57:18,497 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-13 09:57:18,501 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -5 predicate places. [2024-10-13 09:57:18,503 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 770 flow [2024-10-13 09:57:18,504 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-13 09:57:18,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:18,505 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:18,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:57:18,506 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-13 09:57:18,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash 213531984, now seen corresponding path program 1 times [2024-10-13 09:57:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:18,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193722722] [2024-10-13 09:57:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:18,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:18,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193722722] [2024-10-13 09:57:18,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193722722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:18,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:18,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:18,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761909519] [2024-10-13 09:57:18,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:18,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:18,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:18,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:18,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-13 09:57:18,615 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-13 09:57:18,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:18,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-13 09:57:18,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:18,734 INFO L124 PetriNetUnfolderBase]: 25/551 cut-off events. [2024-10-13 09:57:18,735 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-13 09:57:18,742 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-13 09:57:18,746 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2024-10-13 09:57:18,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 794 flow [2024-10-13 09:57:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-13 09:57:18,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-13 09:57:18,751 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 770 flow. Second operand 3 states and 1178 transitions. [2024-10-13 09:57:18,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 794 flow [2024-10-13 09:57:18,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:18,761 INFO L231 Difference]: Finished difference. Result has 373 places, 379 transitions, 768 flow [2024-10-13 09:57:18,761 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-13 09:57:18,762 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2024-10-13 09:57:18,762 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 379 transitions, 768 flow [2024-10-13 09:57:18,763 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-13 09:57:18,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:18,764 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:18,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:57:18,764 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-13 09:57:18,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:18,765 INFO L85 PathProgramCache]: Analyzing trace with hash -144288898, now seen corresponding path program 1 times [2024-10-13 09:57:18,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:18,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218884645] [2024-10-13 09:57:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:18,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218884645] [2024-10-13 09:57:18,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218884645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:18,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:18,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132132606] [2024-10-13 09:57:18,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:18,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:18,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:18,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:18,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-13 09:57:18,949 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-13 09:57:18,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:18,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-13 09:57:18,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:19,043 INFO L124 PetriNetUnfolderBase]: 23/470 cut-off events. [2024-10-13 09:57:19,044 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-13 09:57:19,050 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-13 09:57:19,054 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-10-13 09:57:19,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 378 transitions, 792 flow [2024-10-13 09:57:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-13 09:57:19,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-13 09:57:19,059 INFO L175 Difference]: Start difference. First operand has 373 places, 379 transitions, 768 flow. Second operand 3 states and 1178 transitions. [2024-10-13 09:57:19,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 378 transitions, 792 flow [2024-10-13 09:57:19,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 378 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:19,066 INFO L231 Difference]: Finished difference. Result has 372 places, 378 transitions, 766 flow [2024-10-13 09:57:19,067 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-13 09:57:19,068 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -8 predicate places. [2024-10-13 09:57:19,068 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 378 transitions, 766 flow [2024-10-13 09:57:19,069 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-13 09:57:19,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:19,070 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:19,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:57:19,071 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-13 09:57:19,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1587522512, now seen corresponding path program 1 times [2024-10-13 09:57:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:19,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162750385] [2024-10-13 09:57:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:19,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:19,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162750385] [2024-10-13 09:57:19,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162750385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:19,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:19,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:19,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682748473] [2024-10-13 09:57:19,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:19,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:19,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:19,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:19,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-13 09:57:19,169 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-13 09:57:19,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:19,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-13 09:57:19,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:19,295 INFO L124 PetriNetUnfolderBase]: 43/846 cut-off events. [2024-10-13 09:57:19,295 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:19,307 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-13 09:57:19,313 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-10-13 09:57:19,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 377 transitions, 790 flow [2024-10-13 09:57:19,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-13 09:57:19,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-13 09:57:19,317 INFO L175 Difference]: Start difference. First operand has 372 places, 378 transitions, 766 flow. Second operand 3 states and 1178 transitions. [2024-10-13 09:57:19,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 377 transitions, 790 flow [2024-10-13 09:57:19,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 377 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:19,346 INFO L231 Difference]: Finished difference. Result has 371 places, 377 transitions, 764 flow [2024-10-13 09:57:19,347 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-13 09:57:19,348 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2024-10-13 09:57:19,348 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 377 transitions, 764 flow [2024-10-13 09:57:19,349 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-13 09:57:19,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:19,350 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:19,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:57:19,350 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-13 09:57:19,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1746765296, now seen corresponding path program 1 times [2024-10-13 09:57:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913156631] [2024-10-13 09:57:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:19,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:19,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913156631] [2024-10-13 09:57:19,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913156631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:19,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:19,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902890540] [2024-10-13 09:57:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:19,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:19,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:19,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-13 09:57:19,424 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-13 09:57:19,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:19,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-13 09:57:19,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:19,517 INFO L124 PetriNetUnfolderBase]: 32/602 cut-off events. [2024-10-13 09:57:19,518 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:57:19,525 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-13 09:57:19,529 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-10-13 09:57:19,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 376 transitions, 790 flow [2024-10-13 09:57:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2024-10-13 09:57:19,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2024-10-13 09:57:19,532 INFO L175 Difference]: Start difference. First operand has 371 places, 377 transitions, 764 flow. Second operand 3 states and 1176 transitions. [2024-10-13 09:57:19,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 376 transitions, 790 flow [2024-10-13 09:57:19,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 376 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:19,539 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 762 flow [2024-10-13 09:57:19,540 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-13 09:57:19,542 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2024-10-13 09:57:19,543 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 762 flow [2024-10-13 09:57:19,544 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-13 09:57:19,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:19,544 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:19,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:57:19,545 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-13 09:57:19,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 639497774, now seen corresponding path program 1 times [2024-10-13 09:57:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875729768] [2024-10-13 09:57:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875729768] [2024-10-13 09:57:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875729768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:19,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771178202] [2024-10-13 09:57:19,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:19,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:19,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:19,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:19,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2024-10-13 09:57:19,643 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-13 09:57:19,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:19,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2024-10-13 09:57:19,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:19,807 INFO L124 PetriNetUnfolderBase]: 64/971 cut-off events. [2024-10-13 09:57:19,808 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-13 09:57:19,815 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-13 09:57:19,820 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2024-10-13 09:57:19,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 375 transitions, 790 flow [2024-10-13 09:57:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2024-10-13 09:57:19,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2024-10-13 09:57:19,823 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 762 flow. Second operand 3 states and 1174 transitions. [2024-10-13 09:57:19,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 375 transitions, 790 flow [2024-10-13 09:57:19,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:19,830 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 760 flow [2024-10-13 09:57:19,831 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-13 09:57:19,833 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2024-10-13 09:57:19,833 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 760 flow [2024-10-13 09:57:19,834 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-13 09:57:19,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:19,835 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-13 09:57:19,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:57:19,835 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-13 09:57:19,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash -447938175, now seen corresponding path program 1 times [2024-10-13 09:57:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:19,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286234462] [2024-10-13 09:57:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:19,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286234462] [2024-10-13 09:57:19,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286234462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:19,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:19,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827905979] [2024-10-13 09:57:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:19,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:19,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-13 09:57:19,930 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-13 09:57:19,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:19,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-13 09:57:19,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:20,030 INFO L124 PetriNetUnfolderBase]: 35/709 cut-off events. [2024-10-13 09:57:20,030 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-10-13 09:57:20,040 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-13 09:57:20,046 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2024-10-13 09:57:20,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 784 flow [2024-10-13 09:57:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-13 09:57:20,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-13 09:57:20,049 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 760 flow. Second operand 3 states and 1178 transitions. [2024-10-13 09:57:20,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 784 flow [2024-10-13 09:57:20,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:20,055 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 758 flow [2024-10-13 09:57:20,056 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-13 09:57:20,057 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2024-10-13 09:57:20,057 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 758 flow [2024-10-13 09:57:20,058 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-13 09:57:20,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:20,058 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-13 09:57:20,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:57:20,058 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-13 09:57:20,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1577847982, now seen corresponding path program 1 times [2024-10-13 09:57:20,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:20,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363347622] [2024-10-13 09:57:20,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:20,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:20,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-13 09:57:20,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:20,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363347622] [2024-10-13 09:57:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363347622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:20,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:20,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836593816] [2024-10-13 09:57:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:20,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:20,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-13 09:57:20,137 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-13 09:57:20,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:20,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-13 09:57:20,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:20,262 INFO L124 PetriNetUnfolderBase]: 36/713 cut-off events. [2024-10-13 09:57:20,262 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-13 09:57:20,269 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-13 09:57:20,276 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-10-13 09:57:20,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 784 flow [2024-10-13 09:57:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2024-10-13 09:57:20,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2024-10-13 09:57:20,282 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 758 flow. Second operand 3 states and 1176 transitions. [2024-10-13 09:57:20,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 784 flow [2024-10-13 09:57:20,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:20,289 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 756 flow [2024-10-13 09:57:20,289 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-13 09:57:20,290 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2024-10-13 09:57:20,290 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 756 flow [2024-10-13 09:57:20,291 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-13 09:57:20,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:20,291 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-13 09:57:20,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:57:20,292 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-13 09:57:20,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1051413800, now seen corresponding path program 1 times [2024-10-13 09:57:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:20,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884328745] [2024-10-13 09:57:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:20,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:20,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884328745] [2024-10-13 09:57:20,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884328745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:20,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:20,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:20,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475017575] [2024-10-13 09:57:20,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:20,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:20,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:20,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:20,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2024-10-13 09:57:20,399 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-13 09:57:20,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:20,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2024-10-13 09:57:20,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:20,503 INFO L124 PetriNetUnfolderBase]: 40/564 cut-off events. [2024-10-13 09:57:20,503 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2024-10-13 09:57:20,510 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-13 09:57:20,514 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-13 09:57:20,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 784 flow [2024-10-13 09:57:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2024-10-13 09:57:20,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2024-10-13 09:57:20,517 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 756 flow. Second operand 3 states and 1174 transitions. [2024-10-13 09:57:20,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 784 flow [2024-10-13 09:57:20,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:20,523 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 754 flow [2024-10-13 09:57:20,523 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-13 09:57:20,524 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2024-10-13 09:57:20,524 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 754 flow [2024-10-13 09:57:20,525 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-13 09:57:20,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:20,525 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-13 09:57:20,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:57:20,525 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-13 09:57:20,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:20,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1398066235, now seen corresponding path program 1 times [2024-10-13 09:57:20,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:20,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15771465] [2024-10-13 09:57:20,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:20,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:20,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:20,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15771465] [2024-10-13 09:57:20,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15771465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:20,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:20,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854285950] [2024-10-13 09:57:20,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:20,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:20,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:20,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:20,592 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-13 09:57:20,594 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-13 09:57:20,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:20,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-13 09:57:20,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:20,751 INFO L124 PetriNetUnfolderBase]: 76/1238 cut-off events. [2024-10-13 09:57:20,751 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:57:20,759 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-13 09:57:20,764 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2024-10-13 09:57:20,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 374 transitions, 790 flow [2024-10-13 09:57:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2024-10-13 09:57:20,768 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2024-10-13 09:57:20,768 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 754 flow. Second operand 3 states and 1187 transitions. [2024-10-13 09:57:20,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 374 transitions, 790 flow [2024-10-13 09:57:20,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:20,775 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 760 flow [2024-10-13 09:57:20,775 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-13 09:57:20,776 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-13 09:57:20,776 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 760 flow [2024-10-13 09:57:20,777 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-13 09:57:20,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:20,777 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-13 09:57:20,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:57:20,778 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-13 09:57:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1492401106, now seen corresponding path program 1 times [2024-10-13 09:57:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:20,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283306365] [2024-10-13 09:57:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283306365] [2024-10-13 09:57:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283306365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:20,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:20,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013089008] [2024-10-13 09:57:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:20,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:20,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:20,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-13 09:57:20,854 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-13 09:57:20,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:20,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-13 09:57:20,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:21,004 INFO L124 PetriNetUnfolderBase]: 69/1058 cut-off events. [2024-10-13 09:57:21,005 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:57:21,020 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-13 09:57:21,029 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 15 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2024-10-13 09:57:21,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 374 transitions, 802 flow [2024-10-13 09:57:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2024-10-13 09:57:21,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2024-10-13 09:57:21,032 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 760 flow. Second operand 3 states and 1182 transitions. [2024-10-13 09:57:21,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 374 transitions, 802 flow [2024-10-13 09:57:21,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:21,039 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 775 flow [2024-10-13 09:57:21,039 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-13 09:57:21,040 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-13 09:57:21,040 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 775 flow [2024-10-13 09:57:21,042 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-13 09:57:21,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:21,042 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:21,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:57:21,042 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-13 09:57:21,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1381044782, now seen corresponding path program 1 times [2024-10-13 09:57:21,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:21,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836967815] [2024-10-13 09:57:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:21,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:21,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836967815] [2024-10-13 09:57:21,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836967815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:21,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:21,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:21,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508817734] [2024-10-13 09:57:21,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:21,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:21,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:21,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:21,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-13 09:57:21,101 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-13 09:57:21,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:21,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-13 09:57:21,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:21,292 INFO L124 PetriNetUnfolderBase]: 70/1296 cut-off events. [2024-10-13 09:57:21,292 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2024-10-13 09:57:21,307 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-13 09:57:21,313 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-10-13 09:57:21,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 377 transitions, 826 flow [2024-10-13 09:57:21,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-13 09:57:21,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2024-10-13 09:57:21,317 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 775 flow. Second operand 3 states and 1190 transitions. [2024-10-13 09:57:21,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 377 transitions, 826 flow [2024-10-13 09:57:21,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 377 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:21,322 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 785 flow [2024-10-13 09:57:21,323 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-13 09:57:21,324 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2024-10-13 09:57:21,324 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 785 flow [2024-10-13 09:57:21,325 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-13 09:57:21,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:21,325 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-13 09:57:21,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:57:21,326 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-13 09:57:21,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1644657233, now seen corresponding path program 1 times [2024-10-13 09:57:21,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:21,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872944611] [2024-10-13 09:57:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:21,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872944611] [2024-10-13 09:57:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872944611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484071819] [2024-10-13 09:57:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:21,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:21,376 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 412 [2024-10-13 09:57:21,377 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-13 09:57:21,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:21,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 412 [2024-10-13 09:57:21,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:21,519 INFO L124 PetriNetUnfolderBase]: 57/1056 cut-off events. [2024-10-13 09:57:21,519 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2024-10-13 09:57:21,533 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-13 09:57:21,539 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-10-13 09:57:21,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 373 transitions, 815 flow [2024-10-13 09:57:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2024-10-13 09:57:21,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2024-10-13 09:57:21,542 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 785 flow. Second operand 3 states and 1187 transitions. [2024-10-13 09:57:21,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 373 transitions, 815 flow [2024-10-13 09:57:21,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:21,547 INFO L231 Difference]: Finished difference. Result has 367 places, 371 transitions, 787 flow [2024-10-13 09:57:21,548 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-13 09:57:21,549 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2024-10-13 09:57:21,549 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 371 transitions, 787 flow [2024-10-13 09:57:21,550 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-13 09:57:21,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:21,550 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-13 09:57:21,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:57:21,550 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-13 09:57:21,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -375103681, now seen corresponding path program 1 times [2024-10-13 09:57:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551808293] [2024-10-13 09:57:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:21,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551808293] [2024-10-13 09:57:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551808293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:21,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703669294] [2024-10-13 09:57:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:21,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:21,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2024-10-13 09:57:21,623 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-13 09:57:21,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:21,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2024-10-13 09:57:21,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:22,119 INFO L124 PetriNetUnfolderBase]: 344/3908 cut-off events. [2024-10-13 09:57:22,119 INFO L125 PetriNetUnfolderBase]: For 62/74 co-relation queries the response was YES. [2024-10-13 09:57:22,143 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-13 09:57:22,158 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 17 selfloop transitions, 4 changer transitions 0/373 dead transitions. [2024-10-13 09:57:22,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 373 transitions, 835 flow [2024-10-13 09:57:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1177 transitions. [2024-10-13 09:57:22,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9522653721682848 [2024-10-13 09:57:22,162 INFO L175 Difference]: Start difference. First operand has 367 places, 371 transitions, 787 flow. Second operand 3 states and 1177 transitions. [2024-10-13 09:57:22,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 373 transitions, 835 flow [2024-10-13 09:57:22,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:22,168 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 803 flow [2024-10-13 09:57:22,168 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-13 09:57:22,169 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-13 09:57:22,169 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 803 flow [2024-10-13 09:57:22,170 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-13 09:57:22,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:22,170 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-13 09:57:22,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:57:22,171 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-13 09:57:22,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1214327577, now seen corresponding path program 1 times [2024-10-13 09:57:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822658613] [2024-10-13 09:57:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:22,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:22,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822658613] [2024-10-13 09:57:22,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822658613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:22,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:22,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935931426] [2024-10-13 09:57:22,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:22,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:22,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:22,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:22,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:22,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-13 09:57:22,228 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-13 09:57:22,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:22,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-13 09:57:22,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:22,683 INFO L124 PetriNetUnfolderBase]: 167/2950 cut-off events. [2024-10-13 09:57:22,683 INFO L125 PetriNetUnfolderBase]: For 23/34 co-relation queries the response was YES. [2024-10-13 09:57:22,713 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-13 09:57:22,724 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 18 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2024-10-13 09:57:22,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 376 transitions, 860 flow [2024-10-13 09:57:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-13 09:57:22,728 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-13 09:57:22,728 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 803 flow. Second operand 3 states and 1185 transitions. [2024-10-13 09:57:22,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 376 transitions, 860 flow [2024-10-13 09:57:22,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 376 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:22,735 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 818 flow [2024-10-13 09:57:22,736 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-13 09:57:22,737 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-13 09:57:22,738 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 818 flow [2024-10-13 09:57:22,739 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-13 09:57:22,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:22,739 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-13 09:57:22,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:57:22,739 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-13 09:57:22,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -475719494, now seen corresponding path program 1 times [2024-10-13 09:57:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:22,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562414006] [2024-10-13 09:57:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562414006] [2024-10-13 09:57:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562414006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:22,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:22,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569718931] [2024-10-13 09:57:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:22,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:22,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:22,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:22,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-13 09:57:22,799 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-13 09:57:22,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:22,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-13 09:57:22,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,228 INFO L124 PetriNetUnfolderBase]: 114/2582 cut-off events. [2024-10-13 09:57:23,229 INFO L125 PetriNetUnfolderBase]: For 12/18 co-relation queries the response was YES. [2024-10-13 09:57:23,260 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-13 09:57:23,269 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-10-13 09:57:23,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 376 transitions, 869 flow [2024-10-13 09:57:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-13 09:57:23,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2024-10-13 09:57:23,272 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 818 flow. Second operand 3 states and 1190 transitions. [2024-10-13 09:57:23,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 376 transitions, 869 flow [2024-10-13 09:57:23,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:23,278 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 828 flow [2024-10-13 09:57:23,278 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-13 09:57:23,279 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-13 09:57:23,279 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 828 flow [2024-10-13 09:57:23,280 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-13 09:57:23,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,280 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:23,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:57:23,280 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-13 09:57:23,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1624830416, now seen corresponding path program 1 times [2024-10-13 09:57:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264297670] [2024-10-13 09:57:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:23,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:23,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264297670] [2024-10-13 09:57:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264297670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:23,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134383188] [2024-10-13 09:57:23,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:23,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:23,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:23,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-13 09:57:23,337 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-13 09:57:23,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:23,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-13 09:57:23,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,839 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-13 09:57:23,840 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2024-10-13 09:57:23,840 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-13 09:57:23,840 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-13 09:57:23,840 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-13 09:57:23,872 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-13 09:57:23,873 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2024-10-13 09:57:23,873 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-13 09:57:23,873 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-13 09:57:23,873 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-13 09:57:23,873 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-13 09:57:23,873 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-10-13 09:57:23,874 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-13 09:57:23,874 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-13 09:57:23,874 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-10-13 09:57:23,879 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-13 09:57:23,879 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-13 09:57:23,880 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-13 09:57:23,880 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-13 09:57:23,880 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-13 09:57:23,901 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-13 09:57:23,902 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-10-13 09:57:23,902 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-10-13 09:57:23,902 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-10-13 09:57:23,902 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-10-13 09:57:23,943 INFO L124 PetriNetUnfolderBase]: 227/3804 cut-off events. [2024-10-13 09:57:23,944 INFO L125 PetriNetUnfolderBase]: For 44/113 co-relation queries the response was YES. [2024-10-13 09:57:23,989 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-13 09:57:24,004 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-13 09:57:24,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 372 transitions, 860 flow [2024-10-13 09:57:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-13 09:57:24,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-13 09:57:24,008 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 828 flow. Second operand 3 states and 1185 transitions. [2024-10-13 09:57:24,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 372 transitions, 860 flow [2024-10-13 09:57:24,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:24,014 INFO L231 Difference]: Finished difference. Result has 366 places, 370 transitions, 830 flow [2024-10-13 09:57:24,014 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-13 09:57:24,015 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2024-10-13 09:57:24,015 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 370 transitions, 830 flow [2024-10-13 09:57:24,016 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-13 09:57:24,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,016 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-13 09:57:24,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:57:24,017 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-13 09:57:24,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1899868835, now seen corresponding path program 1 times [2024-10-13 09:57:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103916158] [2024-10-13 09:57:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103916158] [2024-10-13 09:57:24,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103916158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623442230] [2024-10-13 09:57:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-13 09:57:24,067 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-13 09:57:24,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-13 09:57:24,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,511 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-13 09:57:24,511 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2024-10-13 09:57:24,511 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-10-13 09:57:24,511 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2024-10-13 09:57:24,512 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-10-13 09:57:24,517 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-13 09:57:24,517 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2024-10-13 09:57:24,517 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-10-13 09:57:24,517 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-10-13 09:57:24,518 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2024-10-13 09:57:24,538 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-13 09:57:24,539 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2024-10-13 09:57:24,539 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2024-10-13 09:57:24,539 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2024-10-13 09:57:24,539 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2024-10-13 09:57:24,539 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2024-10-13 09:57:24,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[][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-13 09:57:24,540 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is not cut-off event [2024-10-13 09:57:24,540 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is not cut-off event [2024-10-13 09:57:24,540 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2024-10-13 09:57:24,540 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2024-10-13 09:57:24,541 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is not cut-off event [2024-10-13 09:57:24,564 INFO L124 PetriNetUnfolderBase]: 126/3370 cut-off events. [2024-10-13 09:57:24,564 INFO L125 PetriNetUnfolderBase]: For 43/80 co-relation queries the response was YES. [2024-10-13 09:57:24,613 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-13 09:57:24,625 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2024-10-13 09:57:24,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 375 transitions, 881 flow [2024-10-13 09:57:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-13 09:57:24,628 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2024-10-13 09:57:24,629 INFO L175 Difference]: Start difference. First operand has 366 places, 370 transitions, 830 flow. Second operand 3 states and 1190 transitions. [2024-10-13 09:57:24,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 375 transitions, 881 flow [2024-10-13 09:57:24,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 375 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:24,636 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 836 flow [2024-10-13 09:57:24,637 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-13 09:57:24,637 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-13 09:57:24,638 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 836 flow [2024-10-13 09:57:24,638 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-13 09:57:24,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,638 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-13 09:57:24,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:57:24,639 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-13 09:57:24,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1355541654, now seen corresponding path program 1 times [2024-10-13 09:57:24,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022636313] [2024-10-13 09:57:24,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:24,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022636313] [2024-10-13 09:57:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022636313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962096632] [2024-10-13 09:57:24,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2024-10-13 09:57:24,714 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-13 09:57:24,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2024-10-13 09:57:24,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,874 INFO L124 PetriNetUnfolderBase]: 456/7770 cut-off events. [2024-10-13 09:57:25,875 INFO L125 PetriNetUnfolderBase]: For 134/150 co-relation queries the response was YES. [2024-10-13 09:57:25,931 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-13 09:57:25,950 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 19 selfloop transitions, 4 changer transitions 0/374 dead transitions. [2024-10-13 09:57:25,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 374 transitions, 894 flow [2024-10-13 09:57:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2024-10-13 09:57:25,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9538834951456311 [2024-10-13 09:57:25,954 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 836 flow. Second operand 3 states and 1179 transitions. [2024-10-13 09:57:25,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 374 transitions, 894 flow [2024-10-13 09:57:25,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 374 transitions, 894 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:25,960 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 856 flow [2024-10-13 09:57:25,960 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-13 09:57:25,961 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-13 09:57:25,961 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 856 flow [2024-10-13 09:57:25,961 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-13 09:57:25,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,962 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-13 09:57:25,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:57:25,962 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-13 09:57:25,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash 136961259, now seen corresponding path program 1 times [2024-10-13 09:57:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700337984] [2024-10-13 09:57:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:26,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700337984] [2024-10-13 09:57:26,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700337984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228060193] [2024-10-13 09:57:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-13 09:57:26,019 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-13 09:57:26,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-13 09:57:26,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,433 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-13 09:57:26,433 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2024-10-13 09:57:26,433 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-13 09:57:26,433 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-13 09:57:26,433 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-13 09:57:26,472 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-13 09:57:26,472 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,472 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-13 09:57:26,472 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,472 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,473 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-13 09:57:26,473 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-10-13 09:57:26,473 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-13 09:57:26,473 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,473 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,473 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,474 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-13 09:57:26,474 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-10-13 09:57:26,474 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-13 09:57:26,474 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,474 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,474 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-13 09:57:26,474 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,474 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-13 09:57:26,474 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,474 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,474 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-13 09:57:26,475 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-13 09:57:26,475 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2024-10-13 09:57:26,475 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-13 09:57:26,475 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,475 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,475 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-13 09:57:26,475 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,476 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-13 09:57:26,476 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,477 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-13 09:57:26,477 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,477 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-13 09:57:26,477 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-13 09:57:26,477 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,477 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-13 09:57:26,479 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-13 09:57:26,479 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-13 09:57:26,479 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:26,479 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:26,479 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-13 09:57:26,480 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-13 09:57:26,480 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-10-13 09:57:26,480 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:26,480 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:26,480 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:26,480 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-13 09:57:26,483 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-13 09:57:26,483 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2024-10-13 09:57:26,483 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-13 09:57:26,483 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-13 09:57:26,483 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-13 09:57:26,484 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-13 09:57:26,484 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-10-13 09:57:26,484 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-13 09:57:26,484 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-13 09:57:26,484 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-10-13 09:57:26,484 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-13 09:57:26,489 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-13 09:57:26,489 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-10-13 09:57:26,489 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,489 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-13 09:57:26,489 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,489 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-13 09:57:26,489 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-10-13 09:57:26,489 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,489 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-13 09:57:26,489 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-13 09:57:26,489 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-13 09:57:26,490 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-13 09:57:26,490 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is not cut-off event [2024-10-13 09:57:26,490 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2024-10-13 09:57:26,490 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-13 09:57:26,490 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-13 09:57:26,490 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-10-13 09:57:26,490 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-10-13 09:57:26,491 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-13 09:57:26,491 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2024-10-13 09:57:26,491 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:26,491 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:26,491 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:26,491 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-10-13 09:57:26,491 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-13 09:57:26,492 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-13 09:57:26,492 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2024-10-13 09:57:26,493 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-13 09:57:26,493 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-13 09:57:26,493 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-10-13 09:57:26,493 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-13 09:57:26,493 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-13 09:57:26,497 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-13 09:57:26,498 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is not cut-off event [2024-10-13 09:57:26,498 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-13 09:57:26,498 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is not cut-off event [2024-10-13 09:57:26,498 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-13 09:57:26,498 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-13 09:57:26,498 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2024-10-13 09:57:26,506 INFO L124 PetriNetUnfolderBase]: 368/4189 cut-off events. [2024-10-13 09:57:26,506 INFO L125 PetriNetUnfolderBase]: For 239/376 co-relation queries the response was YES. [2024-10-13 09:57:26,539 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-13 09:57:26,549 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-10-13 09:57:26,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 371 transitions, 888 flow [2024-10-13 09:57:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-13 09:57:26,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-13 09:57:26,553 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 856 flow. Second operand 3 states and 1185 transitions. [2024-10-13 09:57:26,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 371 transitions, 888 flow [2024-10-13 09:57:26,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,559 INFO L231 Difference]: Finished difference. Result has 365 places, 369 transitions, 858 flow [2024-10-13 09:57:26,560 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-13 09:57:26,560 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-13 09:57:26,560 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 369 transitions, 858 flow [2024-10-13 09:57:26,561 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-13 09:57:26,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,561 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-13 09:57:26,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:57:26,561 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-13 09:57:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash 239459324, now seen corresponding path program 1 times [2024-10-13 09:57:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347007633] [2024-10-13 09:57:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:26,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347007633] [2024-10-13 09:57:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347007633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781680872] [2024-10-13 09:57:26,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-13 09:57:26,611 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-13 09:57:26,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-13 09:57:26,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,195 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-13 09:57:27,195 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2024-10-13 09:57:27,195 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-10-13 09:57:27,195 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2024-10-13 09:57:27,195 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-10-13 09:57:27,262 INFO L124 PetriNetUnfolderBase]: 240/5812 cut-off events. [2024-10-13 09:57:27,262 INFO L125 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2024-10-13 09:57:27,297 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-13 09:57:27,311 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 15 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-10-13 09:57:27,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 373 transitions, 904 flow [2024-10-13 09:57:27,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2024-10-13 09:57:27,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2024-10-13 09:57:27,314 INFO L175 Difference]: Start difference. First operand has 365 places, 369 transitions, 858 flow. Second operand 3 states and 1189 transitions. [2024-10-13 09:57:27,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 373 transitions, 904 flow [2024-10-13 09:57:27,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:27,326 INFO L231 Difference]: Finished difference. Result has 364 places, 369 transitions, 864 flow [2024-10-13 09:57:27,326 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-13 09:57:27,327 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-13 09:57:27,327 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 369 transitions, 864 flow [2024-10-13 09:57:27,328 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-13 09:57:27,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,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] [2024-10-13 09:57:27,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:57:27,328 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-13 09:57:27,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1141967850, now seen corresponding path program 1 times [2024-10-13 09:57:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75310780] [2024-10-13 09:57:27,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,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-13 09:57:27,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75310780] [2024-10-13 09:57:27,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75310780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109759562] [2024-10-13 09:57:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 412 [2024-10-13 09:57:27,395 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-13 09:57:27,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 412 [2024-10-13 09:57:27,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:28,136 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-13 09:57:28,136 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-10-13 09:57:28,136 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-13 09:57:28,136 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-13 09:57:28,136 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-10-13 09:57:28,141 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-13 09:57:28,141 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-10-13 09:57:28,141 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-13 09:57:28,141 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-13 09:57:28,141 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-13 09:57:28,142 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-13 09:57:28,143 INFO L124 PetriNetUnfolderBase]: 193/5368 cut-off events. [2024-10-13 09:57:28,144 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2024-10-13 09:57:28,182 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-13 09:57:28,196 INFO L140 encePairwiseOnDemand]: 410/412 looper letters, 8 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2024-10-13 09:57:28,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 368 transitions, 880 flow [2024-10-13 09:57:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2024-10-13 09:57:28,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2024-10-13 09:57:28,200 INFO L175 Difference]: Start difference. First operand has 364 places, 369 transitions, 864 flow. Second operand 3 states and 1189 transitions. [2024-10-13 09:57:28,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 368 transitions, 880 flow [2024-10-13 09:57:28,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 368 transitions, 880 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:28,207 INFO L231 Difference]: Finished difference. Result has 365 places, 368 transitions, 864 flow [2024-10-13 09:57:28,208 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-13 09:57:28,208 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-13 09:57:28,208 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 368 transitions, 864 flow [2024-10-13 09:57:28,209 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-13 09:57:28,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:28,209 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:28,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 09:57:28,210 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-13 09:57:28,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1800932855, now seen corresponding path program 1 times [2024-10-13 09:57:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:28,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455615795] [2024-10-13 09:57:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:28,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:28,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455615795] [2024-10-13 09:57:28,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455615795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:28,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:28,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:28,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711353772] [2024-10-13 09:57:28,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:28,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:28,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:28,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:28,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-13 09:57:28,288 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-13 09:57:28,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:28,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-13 09:57:28,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:29,228 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-13 09:57:29,229 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-10-13 09:57:29,229 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-13 09:57:29,229 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-13 09:57:29,229 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-13 09:57:29,231 INFO L124 PetriNetUnfolderBase]: 199/5682 cut-off events. [2024-10-13 09:57:29,232 INFO L125 PetriNetUnfolderBase]: For 21/68 co-relation queries the response was YES. [2024-10-13 09:57:29,296 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-13 09:57:29,310 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 10 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2024-10-13 09:57:29,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 366 transitions, 882 flow [2024-10-13 09:57:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1183 transitions. [2024-10-13 09:57:29,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9571197411003236 [2024-10-13 09:57:29,314 INFO L175 Difference]: Start difference. First operand has 365 places, 368 transitions, 864 flow. Second operand 3 states and 1183 transitions. [2024-10-13 09:57:29,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 366 transitions, 882 flow [2024-10-13 09:57:29,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 366 transitions, 881 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:29,321 INFO L231 Difference]: Finished difference. Result has 364 places, 366 transitions, 861 flow [2024-10-13 09:57:29,322 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-13 09:57:29,322 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-13 09:57:29,323 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 366 transitions, 861 flow [2024-10-13 09:57:29,323 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-13 09:57:29,323 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:29,324 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-13 09:57:29,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 09:57:29,324 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-13 09:57:29,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash -326767216, now seen corresponding path program 1 times [2024-10-13 09:57:29,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:29,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827788509] [2024-10-13 09:57:29,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827788509] [2024-10-13 09:57:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827788509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:29,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447154293] [2024-10-13 09:57:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:29,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:29,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:29,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:29,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-13 09:57:29,398 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-13 09:57:29,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:29,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-13 09:57:29,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:29,786 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-13 09:57:29,786 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2024-10-13 09:57:29,786 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-10-13 09:57:29,786 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-13 09:57:29,786 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-13 09:57:29,824 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-13 09:57:29,824 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,824 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,824 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,824 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,835 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-13 09:57:29,836 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,836 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,836 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,836 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,836 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,836 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-13 09:57:29,836 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,836 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,836 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,836 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,836 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-13 09:57:29,836 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2024-10-13 09:57:29,836 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,837 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,837 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,837 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,837 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,838 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-13 09:57:29,838 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,838 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,838 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,838 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-13 09:57:29,838 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-13 09:57:29,841 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-13 09:57:29,841 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2024-10-13 09:57:29,841 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-13 09:57:29,842 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event [2024-10-13 09:57:29,842 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-10-13 09:57:29,842 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-10-13 09:57:29,842 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-13 09:57:29,842 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-13 09:57:29,844 INFO L124 PetriNetUnfolderBase]: 203/4061 cut-off events. [2024-10-13 09:57:29,844 INFO L125 PetriNetUnfolderBase]: For 63/114 co-relation queries the response was YES. [2024-10-13 09:57:29,880 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-13 09:57:29,882 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2024-10-13 09:57:29,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 364 transitions, 877 flow [2024-10-13 09:57:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2024-10-13 09:57:29,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2024-10-13 09:57:29,885 INFO L175 Difference]: Start difference. First operand has 364 places, 366 transitions, 861 flow. Second operand 3 states and 1182 transitions. [2024-10-13 09:57:29,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 364 transitions, 877 flow [2024-10-13 09:57:29,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 364 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:29,889 INFO L231 Difference]: Finished difference. Result has 363 places, 0 transitions, 0 flow [2024-10-13 09:57:29,890 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-13 09:57:29,890 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -17 predicate places. [2024-10-13 09:57:29,890 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 0 transitions, 0 flow [2024-10-13 09:57:29,891 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-13 09:57:29,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2024-10-13 09:57:29,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2024-10-13 09:57:29,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2024-10-13 09:57:29,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2024-10-13 09:57:29,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2024-10-13 09:57:29,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2024-10-13 09:57:29,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2024-10-13 09:57:29,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2024-10-13 09:57:29,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2024-10-13 09:57:29,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2024-10-13 09:57:29,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2024-10-13 09:57:29,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2024-10-13 09:57:29,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2024-10-13 09:57:29,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2024-10-13 09:57:29,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2024-10-13 09:57:29,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2024-10-13 09:57:29,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2024-10-13 09:57:29,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2024-10-13 09:57:29,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2024-10-13 09:57:29,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2024-10-13 09:57:29,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2024-10-13 09:57:29,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2024-10-13 09:57:29,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2024-10-13 09:57:29,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2024-10-13 09:57:29,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 09:57:29,901 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-13 09:57:29,907 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:57:29,907 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:57:29,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:57:29 BasicIcfg [2024-10-13 09:57:29,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:57:29,913 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:57:29,913 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:57:29,913 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:57:29,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:17" (3/4) ... [2024-10-13 09:57:29,915 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:57:29,919 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:57:29,919 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:57:29,919 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-13 09:57:29,924 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-13 09:57:29,924 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 09:57:29,925 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 09:57:29,925 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:57:30,018 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:57:30,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:57:30,019 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:57:30,020 INFO L158 Benchmark]: Toolchain (without parser) took 13822.54ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 133.6MB in the beginning and 942.7MB in the end (delta: -809.1MB). Peak memory consumption was 228.0MB. Max. memory is 16.1GB. [2024-10-13 09:57:30,020 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:57:30,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.44ms. Allocated memory is still 180.4MB. Free memory was 133.6MB in the beginning and 119.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 09:57:30,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.92ms. Allocated memory is still 180.4MB. Free memory was 119.0MB in the beginning and 116.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 09:57:30,022 INFO L158 Benchmark]: Boogie Preprocessor took 45.67ms. Allocated memory is still 180.4MB. Free memory was 116.3MB in the beginning and 114.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:57:30,022 INFO L158 Benchmark]: RCFGBuilder took 779.86ms. Allocated memory is still 180.4MB. Free memory was 114.8MB in the beginning and 125.1MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 09:57:30,022 INFO L158 Benchmark]: TraceAbstraction took 12465.30ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 124.1MB in the beginning and 949.0MB in the end (delta: -824.9MB). Peak memory consumption was 715.4MB. Max. memory is 16.1GB. [2024-10-13 09:57:30,022 INFO L158 Benchmark]: Witness Printer took 105.87ms. Allocated memory is still 1.2GB. Free memory was 949.0MB in the beginning and 942.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 09:57:30,024 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 100.7MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.44ms. Allocated memory is still 180.4MB. Free memory was 133.6MB in the beginning and 119.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.92ms. Allocated memory is still 180.4MB. Free memory was 119.0MB in the beginning and 116.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.67ms. Allocated memory is still 180.4MB. Free memory was 116.3MB in the beginning and 114.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 779.86ms. Allocated memory is still 180.4MB. Free memory was 114.8MB in the beginning and 125.1MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12465.30ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 124.1MB in the beginning and 949.0MB in the end (delta: -824.9MB). Peak memory consumption was 715.4MB. Max. memory is 16.1GB. * Witness Printer took 105.87ms. Allocated memory is still 1.2GB. Free memory was 949.0MB in the beginning and 942.7MB 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.3s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, 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-13 09:57:30,049 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