./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-simpl-str-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-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 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:12:18,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:12:18,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:12:18,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:12:18,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:12:18,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:12:18,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:12:18,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:12:18,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:12:18,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:12:18,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:12:18,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:12:18,525 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:12:18,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:12:18,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:12:18,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:12:18,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:12:18,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:12:18,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:12:18,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:12:18,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:12:18,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:12:18,532 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:12:18,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:12:18,532 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:12:18,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:12:18,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:12:18,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:12:18,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:12:18,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:12:18,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:12:18,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:12:18,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:12:18,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:12:18,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:12:18,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:12:18,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:12:18,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:12:18,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:12:18,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:12:18,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:12:18,537 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 -> 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 [2024-10-14 17:12:18,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:12:18,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:12:18,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:12:18,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:12:18,848 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:12:18,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2024-10-14 17:12:20,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:12:20,654 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:12:20,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2024-10-14 17:12:20,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140538938/9663062574ee4cd8b164aa04bef22c6a/FLAG1a5230f87 [2024-10-14 17:12:20,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140538938/9663062574ee4cd8b164aa04bef22c6a [2024-10-14 17:12:20,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:12:20,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:12:20,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:12:20,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:12:20,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:12:20,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:20" (1/1) ... [2024-10-14 17:12:20,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d7a5abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:20, skipping insertion in model container [2024-10-14 17:12:20,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:20" (1/1) ... [2024-10-14 17:12:20,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:12:20,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:21,003 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:12:21,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:21,093 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:12:21,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21 WrapperNode [2024-10-14 17:12:21,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:12:21,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:21,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:12:21,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:12:21,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,145 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 239 [2024-10-14 17:12:21,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:21,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:12:21,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:12:21,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:12:21,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:12:21,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:12:21,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:12:21,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:12:21,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (1/1) ... [2024-10-14 17:12:21,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:12:21,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:12:21,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:12:21,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:12:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:12:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:12:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:12:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:12:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:12:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:12:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:12:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:12:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:12:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:12:21,283 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:12:21,389 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:12:21,390 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:12:21,766 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:12:21,766 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:12:21,790 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:12:21,790 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 17:12:21,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:21 BoogieIcfgContainer [2024-10-14 17:12:21,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:12:21,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:12:21,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:12:21,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:12:21,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:12:20" (1/3) ... [2024-10-14 17:12:21,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3588f240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:21, skipping insertion in model container [2024-10-14 17:12:21,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:21" (2/3) ... [2024-10-14 17:12:21,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3588f240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:21, skipping insertion in model container [2024-10-14 17:12:21,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:21" (3/3) ... [2024-10-14 17:12:21,798 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2024-10-14 17:12:21,810 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:12:21,810 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-14 17:12:21,810 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:12:21,912 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:12:21,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 325 transitions, 671 flow [2024-10-14 17:12:22,088 INFO L124 PetriNetUnfolderBase]: 15/322 cut-off events. [2024-10-14 17:12:22,089 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:12:22,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 322 events. 15/322 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 741 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2024-10-14 17:12:22,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 325 transitions, 671 flow [2024-10-14 17:12:22,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 302 transitions, 622 flow [2024-10-14 17:12:22,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:12:22,138 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;@2c025d19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:12:22,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-14 17:12:22,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:12:22,161 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-14 17:12:22,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:12:22,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:22,162 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] [2024-10-14 17:12:22,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:22,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash 182671358, now seen corresponding path program 1 times [2024-10-14 17:12:22,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:22,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569875829] [2024-10-14 17:12:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:22,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:22,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:22,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569875829] [2024-10-14 17:12:22,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569875829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:22,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:22,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040623945] [2024-10-14 17:12:22,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:22,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:22,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:22,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:22,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-10-14 17:12:22,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:22,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:22,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-10-14 17:12:22,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:22,651 INFO L124 PetriNetUnfolderBase]: 25/649 cut-off events. [2024-10-14 17:12:22,651 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-14 17:12:22,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 649 events. 25/649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3260 event pairs, 7 based on Foata normal form. 22/566 useless extension candidates. Maximal degree in co-relation 514. Up to 25 conditions per place. [2024-10-14 17:12:22,667 INFO L140 encePairwiseOnDemand]: 315/325 looper letters, 11 selfloop transitions, 2 changer transitions 1/294 dead transitions. [2024-10-14 17:12:22,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 294 transitions, 632 flow [2024-10-14 17:12:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-10-14 17:12:22,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-10-14 17:12:22,689 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 622 flow. Second operand 3 states and 924 transitions. [2024-10-14 17:12:22,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 294 transitions, 632 flow [2024-10-14 17:12:22,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 294 transitions, 620 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 17:12:22,700 INFO L231 Difference]: Finished difference. Result has 294 places, 293 transitions, 596 flow [2024-10-14 17:12:22,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=294, PETRI_TRANSITIONS=293} [2024-10-14 17:12:22,711 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -5 predicate places. [2024-10-14 17:12:22,712 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 293 transitions, 596 flow [2024-10-14 17:12:22,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:22,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:22,713 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] [2024-10-14 17:12:22,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:12:22,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:22,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:22,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1666545074, now seen corresponding path program 1 times [2024-10-14 17:12:22,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:22,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794612035] [2024-10-14 17:12:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:22,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794612035] [2024-10-14 17:12:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794612035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:22,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:22,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:22,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644490705] [2024-10-14 17:12:22,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:22,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:22,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:22,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:22,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-10-14 17:12:22,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:22,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:22,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-10-14 17:12:22,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:22,976 INFO L124 PetriNetUnfolderBase]: 21/551 cut-off events. [2024-10-14 17:12:22,977 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-10-14 17:12:22,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 551 events. 21/551 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2526 event pairs, 7 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 555. Up to 25 conditions per place. [2024-10-14 17:12:22,986 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-10-14 17:12:22,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 620 flow [2024-10-14 17:12:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2024-10-14 17:12:22,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2024-10-14 17:12:22,991 INFO L175 Difference]: Start difference. First operand has 294 places, 293 transitions, 596 flow. Second operand 3 states and 917 transitions. [2024-10-14 17:12:22,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 620 flow [2024-10-14 17:12:22,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 292 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:22,997 INFO L231 Difference]: Finished difference. Result has 292 places, 292 transitions, 594 flow [2024-10-14 17:12:23,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=292, PETRI_TRANSITIONS=292} [2024-10-14 17:12:23,001 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -7 predicate places. [2024-10-14 17:12:23,001 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 292 transitions, 594 flow [2024-10-14 17:12:23,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:23,002 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] [2024-10-14 17:12:23,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:12:23,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:23,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2079277513, now seen corresponding path program 1 times [2024-10-14 17:12:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:23,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596212747] [2024-10-14 17:12:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:23,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:23,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:23,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596212747] [2024-10-14 17:12:23,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596212747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:23,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:23,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265360486] [2024-10-14 17:12:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:23,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:23,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-10-14 17:12:23,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 292 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:23,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-10-14 17:12:23,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:23,213 INFO L124 PetriNetUnfolderBase]: 20/460 cut-off events. [2024-10-14 17:12:23,216 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:12:23,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 460 events. 20/460 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1954 event pairs, 8 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 460. Up to 29 conditions per place. [2024-10-14 17:12:23,225 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-10-14 17:12:23,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 291 transitions, 620 flow [2024-10-14 17:12:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2024-10-14 17:12:23,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2024-10-14 17:12:23,229 INFO L175 Difference]: Start difference. First operand has 292 places, 292 transitions, 594 flow. Second operand 3 states and 915 transitions. [2024-10-14 17:12:23,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 291 transitions, 620 flow [2024-10-14 17:12:23,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 291 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:23,234 INFO L231 Difference]: Finished difference. Result has 291 places, 291 transitions, 592 flow [2024-10-14 17:12:23,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=291, PETRI_TRANSITIONS=291} [2024-10-14 17:12:23,236 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -8 predicate places. [2024-10-14 17:12:23,237 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 291 transitions, 592 flow [2024-10-14 17:12:23,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:23,239 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] [2024-10-14 17:12:23,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:12:23,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:23,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1640872581, now seen corresponding path program 1 times [2024-10-14 17:12:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:23,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717740714] [2024-10-14 17:12:23,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:23,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:23,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717740714] [2024-10-14 17:12:23,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717740714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:23,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:23,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:23,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911573434] [2024-10-14 17:12:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:23,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:23,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:23,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-10-14 17:12:23,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 291 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:23,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-10-14 17:12:23,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:23,448 INFO L124 PetriNetUnfolderBase]: 15/424 cut-off events. [2024-10-14 17:12:23,449 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-14 17:12:23,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 424 events. 15/424 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1661 event pairs, 5 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 407. Up to 22 conditions per place. [2024-10-14 17:12:23,455 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-10-14 17:12:23,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 290 transitions, 616 flow [2024-10-14 17:12:23,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2024-10-14 17:12:23,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2024-10-14 17:12:23,459 INFO L175 Difference]: Start difference. First operand has 291 places, 291 transitions, 592 flow. Second operand 3 states and 917 transitions. [2024-10-14 17:12:23,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 290 transitions, 616 flow [2024-10-14 17:12:23,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 290 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:23,466 INFO L231 Difference]: Finished difference. Result has 290 places, 290 transitions, 590 flow [2024-10-14 17:12:23,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=290, PETRI_TRANSITIONS=290} [2024-10-14 17:12:23,469 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2024-10-14 17:12:23,469 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 290 transitions, 590 flow [2024-10-14 17:12:23,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:23,471 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] [2024-10-14 17:12:23,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:12:23,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:23,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2125481100, now seen corresponding path program 1 times [2024-10-14 17:12:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:23,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115734361] [2024-10-14 17:12:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:23,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115734361] [2024-10-14 17:12:23,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115734361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:23,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:23,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:23,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079783309] [2024-10-14 17:12:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:23,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:23,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:23,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 325 [2024-10-14 17:12:23,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 290 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:23,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 325 [2024-10-14 17:12:23,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:23,702 INFO L124 PetriNetUnfolderBase]: 42/733 cut-off events. [2024-10-14 17:12:23,702 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-14 17:12:23,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 733 events. 42/733 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3774 event pairs, 20 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 736. Up to 50 conditions per place. [2024-10-14 17:12:23,712 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-10-14 17:12:23,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 289 transitions, 618 flow [2024-10-14 17:12:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2024-10-14 17:12:23,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9364102564102564 [2024-10-14 17:12:23,716 INFO L175 Difference]: Start difference. First operand has 290 places, 290 transitions, 590 flow. Second operand 3 states and 913 transitions. [2024-10-14 17:12:23,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 289 transitions, 618 flow [2024-10-14 17:12:23,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 289 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:23,721 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 588 flow [2024-10-14 17:12:23,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2024-10-14 17:12:23,722 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2024-10-14 17:12:23,722 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 588 flow [2024-10-14 17:12:23,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:23,725 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] [2024-10-14 17:12:23,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:12:23,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:23,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash 372904994, now seen corresponding path program 1 times [2024-10-14 17:12:23,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:23,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419579168] [2024-10-14 17:12:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419579168] [2024-10-14 17:12:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419579168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:23,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:23,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:23,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678427316] [2024-10-14 17:12:23,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:23,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:23,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:23,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:23,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:23,796 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-10-14 17:12:23,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:23,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-10-14 17:12:23,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:23,859 INFO L124 PetriNetUnfolderBase]: 15/361 cut-off events. [2024-10-14 17:12:23,860 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-10-14 17:12:23,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 361 events. 15/361 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1268 event pairs, 7 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 330. Up to 25 conditions per place. [2024-10-14 17:12:23,865 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-10-14 17:12:23,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 288 transitions, 612 flow [2024-10-14 17:12:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2024-10-14 17:12:23,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2024-10-14 17:12:23,868 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 588 flow. Second operand 3 states and 917 transitions. [2024-10-14 17:12:23,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 288 transitions, 612 flow [2024-10-14 17:12:23,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 288 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:23,873 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 586 flow [2024-10-14 17:12:23,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2024-10-14 17:12:23,875 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-10-14 17:12:23,875 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 586 flow [2024-10-14 17:12:23,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:23,876 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] [2024-10-14 17:12:23,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:12:23,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:23,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 91897490, now seen corresponding path program 1 times [2024-10-14 17:12:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:23,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004136796] [2024-10-14 17:12:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004136796] [2024-10-14 17:12:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004136796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:23,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:23,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:23,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461719050] [2024-10-14 17:12:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:23,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:23,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:23,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-14 17:12:23,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:23,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:23,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-14 17:12:23,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:24,088 INFO L124 PetriNetUnfolderBase]: 46/884 cut-off events. [2024-10-14 17:12:24,090 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:12:24,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 884 events. 46/884 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5573 event pairs, 12 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 875. Up to 43 conditions per place. [2024-10-14 17:12:24,101 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-10-14 17:12:24,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 290 transitions, 622 flow [2024-10-14 17:12:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-10-14 17:12:24,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2024-10-14 17:12:24,104 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 586 flow. Second operand 3 states and 926 transitions. [2024-10-14 17:12:24,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 290 transitions, 622 flow [2024-10-14 17:12:24,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:24,111 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 592 flow [2024-10-14 17:12:24,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2024-10-14 17:12:24,112 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-10-14 17:12:24,113 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 592 flow [2024-10-14 17:12:24,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:24,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:24,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:24,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:12:24,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:24,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1824695897, now seen corresponding path program 1 times [2024-10-14 17:12:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289791445] [2024-10-14 17:12:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:24,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:24,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289791445] [2024-10-14 17:12:24,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289791445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:24,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:24,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984223390] [2024-10-14 17:12:24,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:24,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:24,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-10-14 17:12:24,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:24,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:24,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-10-14 17:12:24,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:24,317 INFO L124 PetriNetUnfolderBase]: 45/803 cut-off events. [2024-10-14 17:12:24,318 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:12:24,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 803 events. 45/803 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4856 event pairs, 10 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 733. Up to 49 conditions per place. [2024-10-14 17:12:24,331 INFO L140 encePairwiseOnDemand]: 319/325 looper letters, 15 selfloop transitions, 3 changer transitions 0/290 dead transitions. [2024-10-14 17:12:24,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 290 transitions, 634 flow [2024-10-14 17:12:24,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2024-10-14 17:12:24,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2024-10-14 17:12:24,334 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 592 flow. Second operand 3 states and 921 transitions. [2024-10-14 17:12:24,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 290 transitions, 634 flow [2024-10-14 17:12:24,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 634 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:24,339 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 607 flow [2024-10-14 17:12:24,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2024-10-14 17:12:24,340 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-10-14 17:12:24,340 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 607 flow [2024-10-14 17:12:24,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:24,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:24,342 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] [2024-10-14 17:12:24,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:12:24,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:24,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1855236869, now seen corresponding path program 1 times [2024-10-14 17:12:24,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:24,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082145797] [2024-10-14 17:12:24,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:24,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:24,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082145797] [2024-10-14 17:12:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082145797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:24,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:24,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:24,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112732556] [2024-10-14 17:12:24,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:24,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:24,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:24,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:24,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-14 17:12:24,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:24,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:24,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-14 17:12:24,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:24,581 INFO L124 PetriNetUnfolderBase]: 38/959 cut-off events. [2024-10-14 17:12:24,581 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2024-10-14 17:12:24,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 959 events. 38/959 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5918 event pairs, 4 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 847. Up to 53 conditions per place. [2024-10-14 17:12:24,599 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-10-14 17:12:24,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 293 transitions, 658 flow [2024-10-14 17:12:24,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2024-10-14 17:12:24,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2024-10-14 17:12:24,603 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 607 flow. Second operand 3 states and 929 transitions. [2024-10-14 17:12:24,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 293 transitions, 658 flow [2024-10-14 17:12:24,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 293 transitions, 658 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:24,610 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 617 flow [2024-10-14 17:12:24,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2024-10-14 17:12:24,612 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-10-14 17:12:24,612 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 617 flow [2024-10-14 17:12:24,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:24,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:24,614 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] [2024-10-14 17:12:24,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:12:24,614 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:24,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash -471178849, now seen corresponding path program 1 times [2024-10-14 17:12:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:24,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201524907] [2024-10-14 17:12:24,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:24,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:24,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201524907] [2024-10-14 17:12:24,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201524907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:24,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:24,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255641564] [2024-10-14 17:12:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:24,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:24,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:24,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-14 17:12:24,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:24,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:24,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-14 17:12:24,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:24,868 INFO L124 PetriNetUnfolderBase]: 33/1027 cut-off events. [2024-10-14 17:12:24,868 INFO L125 PetriNetUnfolderBase]: For 15/25 co-relation queries the response was YES. [2024-10-14 17:12:24,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1027 events. 33/1027 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5838 event pairs, 4 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 965. Up to 51 conditions per place. [2024-10-14 17:12:24,881 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-10-14 17:12:24,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 293 transitions, 668 flow [2024-10-14 17:12:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2024-10-14 17:12:24,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2024-10-14 17:12:24,884 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 617 flow. Second operand 3 states and 929 transitions. [2024-10-14 17:12:24,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 293 transitions, 668 flow [2024-10-14 17:12:24,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 293 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:24,889 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 627 flow [2024-10-14 17:12:24,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2024-10-14 17:12:24,890 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2024-10-14 17:12:24,890 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 627 flow [2024-10-14 17:12:24,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:24,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:24,891 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] [2024-10-14 17:12:24,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:12:24,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1134306589, now seen corresponding path program 1 times [2024-10-14 17:12:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166329675] [2024-10-14 17:12:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:24,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:24,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166329675] [2024-10-14 17:12:24,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166329675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:24,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:24,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:24,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886515638] [2024-10-14 17:12:24,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:24,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:24,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:24,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:24,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:24,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 325 [2024-10-14 17:12:24,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:24,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:24,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 325 [2024-10-14 17:12:24,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:25,090 INFO L124 PetriNetUnfolderBase]: 34/997 cut-off events. [2024-10-14 17:12:25,090 INFO L125 PetriNetUnfolderBase]: For 4/17 co-relation queries the response was YES. [2024-10-14 17:12:25,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 997 events. 34/997 cut-off events. For 4/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5841 event pairs, 8 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 965. Up to 38 conditions per place. [2024-10-14 17:12:25,106 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-10-14 17:12:25,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 657 flow [2024-10-14 17:12:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-10-14 17:12:25,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2024-10-14 17:12:25,109 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 627 flow. Second operand 3 states and 926 transitions. [2024-10-14 17:12:25,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 657 flow [2024-10-14 17:12:25,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:25,149 INFO L231 Difference]: Finished difference. Result has 290 places, 287 transitions, 629 flow [2024-10-14 17:12:25,150 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=290, PETRI_TRANSITIONS=287} [2024-10-14 17:12:25,150 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2024-10-14 17:12:25,150 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 287 transitions, 629 flow [2024-10-14 17:12:25,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:25,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:25,151 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] [2024-10-14 17:12:25,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:12:25,152 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:25,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2083931817, now seen corresponding path program 1 times [2024-10-14 17:12:25,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:25,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083639143] [2024-10-14 17:12:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083639143] [2024-10-14 17:12:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083639143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:25,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:25,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:25,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314349192] [2024-10-14 17:12:25,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:25,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:25,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:25,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:25,204 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 325 [2024-10-14 17:12:25,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 287 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:25,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:25,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 325 [2024-10-14 17:12:25,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:25,604 INFO L124 PetriNetUnfolderBase]: 226/2802 cut-off events. [2024-10-14 17:12:25,604 INFO L125 PetriNetUnfolderBase]: For 71/221 co-relation queries the response was YES. [2024-10-14 17:12:25,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 2802 events. 226/2802 cut-off events. For 71/221 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 25428 event pairs, 100 based on Foata normal form. 1/2502 useless extension candidates. Maximal degree in co-relation 2762. Up to 329 conditions per place. [2024-10-14 17:12:25,629 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 17 selfloop transitions, 4 changer transitions 0/289 dead transitions. [2024-10-14 17:12:25,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 677 flow [2024-10-14 17:12:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2024-10-14 17:12:25,632 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2024-10-14 17:12:25,632 INFO L175 Difference]: Start difference. First operand has 290 places, 287 transitions, 629 flow. Second operand 3 states and 916 transitions. [2024-10-14 17:12:25,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 677 flow [2024-10-14 17:12:25,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:25,638 INFO L231 Difference]: Finished difference. Result has 287 places, 287 transitions, 645 flow [2024-10-14 17:12:25,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=287, PETRI_TRANSITIONS=287} [2024-10-14 17:12:25,641 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-10-14 17:12:25,641 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 287 transitions, 645 flow [2024-10-14 17:12:25,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:25,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:25,642 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] [2024-10-14 17:12:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:12:25,642 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:25,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2005244654, now seen corresponding path program 1 times [2024-10-14 17:12:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082622798] [2024-10-14 17:12:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:25,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:25,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082622798] [2024-10-14 17:12:25,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082622798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:25,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:25,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:25,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137804143] [2024-10-14 17:12:25,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:25,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:25,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-14 17:12:25,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 287 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:25,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:25,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-14 17:12:25,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:26,102 INFO L124 PetriNetUnfolderBase]: 108/2656 cut-off events. [2024-10-14 17:12:26,103 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2024-10-14 17:12:26,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 2656 events. 108/2656 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 23423 event pairs, 14 based on Foata normal form. 0/2405 useless extension candidates. Maximal degree in co-relation 2473. Up to 164 conditions per place. [2024-10-14 17:12:26,132 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 15 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-10-14 17:12:26,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 291 transitions, 691 flow [2024-10-14 17:12:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-10-14 17:12:26,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2024-10-14 17:12:26,136 INFO L175 Difference]: Start difference. First operand has 287 places, 287 transitions, 645 flow. Second operand 3 states and 928 transitions. [2024-10-14 17:12:26,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 291 transitions, 691 flow [2024-10-14 17:12:26,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 291 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:26,143 INFO L231 Difference]: Finished difference. Result has 288 places, 287 transitions, 655 flow [2024-10-14 17:12:26,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=287} [2024-10-14 17:12:26,144 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-10-14 17:12:26,144 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 287 transitions, 655 flow [2024-10-14 17:12:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:26,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:26,145 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] [2024-10-14 17:12:26,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:12:26,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:26,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash -684237204, now seen corresponding path program 1 times [2024-10-14 17:12:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312752400] [2024-10-14 17:12:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:26,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:26,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312752400] [2024-10-14 17:12:26,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312752400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:26,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:26,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:26,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921759843] [2024-10-14 17:12:26,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:26,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:26,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:26,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:26,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:26,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-14 17:12:26,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 287 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:26,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:26,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-14 17:12:26,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:26,491 INFO L124 PetriNetUnfolderBase]: 97/2277 cut-off events. [2024-10-14 17:12:26,492 INFO L125 PetriNetUnfolderBase]: For 24/60 co-relation queries the response was YES. [2024-10-14 17:12:26,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2277 events. 97/2277 cut-off events. For 24/60 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 19422 event pairs, 18 based on Foata normal form. 2/2073 useless extension candidates. Maximal degree in co-relation 2097. Up to 73 conditions per place. [2024-10-14 17:12:26,515 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-10-14 17:12:26,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 288 transitions, 687 flow [2024-10-14 17:12:26,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-10-14 17:12:26,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-10-14 17:12:26,518 INFO L175 Difference]: Start difference. First operand has 288 places, 287 transitions, 655 flow. Second operand 3 states and 924 transitions. [2024-10-14 17:12:26,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 288 transitions, 687 flow [2024-10-14 17:12:26,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 687 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:26,524 INFO L231 Difference]: Finished difference. Result has 289 places, 286 transitions, 657 flow [2024-10-14 17:12:26,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=289, PETRI_TRANSITIONS=286} [2024-10-14 17:12:26,525 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2024-10-14 17:12:26,525 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 286 transitions, 657 flow [2024-10-14 17:12:26,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:26,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:26,526 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] [2024-10-14 17:12:26,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:12:26,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:26,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1908473204, now seen corresponding path program 1 times [2024-10-14 17:12:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945210602] [2024-10-14 17:12:26,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:26,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:26,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945210602] [2024-10-14 17:12:26,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945210602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:26,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:26,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067767539] [2024-10-14 17:12:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:26,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:26,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:26,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:26,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-14 17:12:26,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 286 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:26,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:26,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-14 17:12:26,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:26,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L55-25-->L55-26: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet12#1][181], [Black: 349#true, 368#true, 24#L55-26true, Black: 353#true, 362#(= |#race~length_4~0| 0), 70#L76true, 366#(= |#race~to_int_5~0| 0), Black: 360#true, 343#(= |#race~length_0~0| 0), Black: 364#true, 347#(= |#race~length_2~0| 0), Black: 341#true, 351#(= |#race~to_int_1~0| 0), 371#true, Black: 345#true, 355#(= |#race~to_int_3~0| 0)]) [2024-10-14 17:12:26,828 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2024-10-14 17:12:26,828 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is not cut-off event [2024-10-14 17:12:26,828 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-10-14 17:12:26,829 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-10-14 17:12:26,832 INFO L124 PetriNetUnfolderBase]: 131/1723 cut-off events. [2024-10-14 17:12:26,832 INFO L125 PetriNetUnfolderBase]: For 86/123 co-relation queries the response was YES. [2024-10-14 17:12:26,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1723 events. 131/1723 cut-off events. For 86/123 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14175 event pairs, 36 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1885. Up to 169 conditions per place. [2024-10-14 17:12:26,845 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-10-14 17:12:26,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 287 transitions, 689 flow [2024-10-14 17:12:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-10-14 17:12:26,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-10-14 17:12:26,849 INFO L175 Difference]: Start difference. First operand has 289 places, 286 transitions, 657 flow. Second operand 3 states and 924 transitions. [2024-10-14 17:12:26,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 287 transitions, 689 flow [2024-10-14 17:12:26,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 287 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:26,854 INFO L231 Difference]: Finished difference. Result has 288 places, 285 transitions, 655 flow [2024-10-14 17:12:26,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=285} [2024-10-14 17:12:26,855 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-10-14 17:12:26,856 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 285 transitions, 655 flow [2024-10-14 17:12:26,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:26,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:26,857 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] [2024-10-14 17:12:26,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:12:26,857 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:26,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:26,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2108863995, now seen corresponding path program 1 times [2024-10-14 17:12:26,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:26,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046745225] [2024-10-14 17:12:26,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:26,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:26,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:26,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046745225] [2024-10-14 17:12:26,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046745225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:26,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:26,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:26,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709706434] [2024-10-14 17:12:26,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:26,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:26,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:26,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:26,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:26,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2024-10-14 17:12:26,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 285 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:26,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:26,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2024-10-14 17:12:26,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:27,214 INFO L124 PetriNetUnfolderBase]: 68/2037 cut-off events. [2024-10-14 17:12:27,214 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2024-10-14 17:12:27,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 2037 events. 68/2037 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 16336 event pairs, 4 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2046. Up to 66 conditions per place. [2024-10-14 17:12:27,226 INFO L140 encePairwiseOnDemand]: 323/325 looper letters, 8 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2024-10-14 17:12:27,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 284 transitions, 671 flow [2024-10-14 17:12:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-10-14 17:12:27,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2024-10-14 17:12:27,229 INFO L175 Difference]: Start difference. First operand has 288 places, 285 transitions, 655 flow. Second operand 3 states and 928 transitions. [2024-10-14 17:12:27,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 284 transitions, 671 flow [2024-10-14 17:12:27,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:27,235 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 651 flow [2024-10-14 17:12:27,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2024-10-14 17:12:27,236 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-10-14 17:12:27,236 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 651 flow [2024-10-14 17:12:27,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:27,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:27,237 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] [2024-10-14 17:12:27,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:12:27,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1653121731, now seen corresponding path program 1 times [2024-10-14 17:12:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:27,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770915166] [2024-10-14 17:12:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770915166] [2024-10-14 17:12:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770915166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:27,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:27,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:27,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288404697] [2024-10-14 17:12:27,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:27,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:27,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:27,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:27,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:27,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-14 17:12:27,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:27,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:27,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-14 17:12:27,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:27,560 INFO L124 PetriNetUnfolderBase]: 70/2113 cut-off events. [2024-10-14 17:12:27,561 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2024-10-14 17:12:27,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 2113 events. 70/2113 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17249 event pairs, 9 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 2290. Up to 70 conditions per place. [2024-10-14 17:12:27,584 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2024-10-14 17:12:27,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 282 transitions, 669 flow [2024-10-14 17:12:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 922 transitions. [2024-10-14 17:12:27,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456410256410256 [2024-10-14 17:12:27,587 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 651 flow. Second operand 3 states and 922 transitions. [2024-10-14 17:12:27,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 282 transitions, 669 flow [2024-10-14 17:12:27,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 282 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:27,592 INFO L231 Difference]: Finished difference. Result has 286 places, 282 transitions, 648 flow [2024-10-14 17:12:27,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=286, PETRI_TRANSITIONS=282} [2024-10-14 17:12:27,593 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -13 predicate places. [2024-10-14 17:12:27,593 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 282 transitions, 648 flow [2024-10-14 17:12:27,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:27,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:27,595 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] [2024-10-14 17:12:27,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:12:27,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:27,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:27,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1638243199, now seen corresponding path program 1 times [2024-10-14 17:12:27,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:27,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216097091] [2024-10-14 17:12:27,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:27,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216097091] [2024-10-14 17:12:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216097091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772802993] [2024-10-14 17:12:27,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:27,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:27,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-14 17:12:27,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 282 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:27,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:27,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-14 17:12:27,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:27,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([854] L55-26-->L55-27: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_8~0=|v_#race~result_8~0_1|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_8~0][187], [Black: 349#true, Black: 353#true, 362#(= |#race~length_4~0| 0), 70#L76true, 366#(= |#race~to_int_5~0| 0), Black: 360#true, 343#(= |#race~length_0~0| 0), Black: 364#true, 347#(= |#race~length_2~0| 0), Black: 341#true, 380#true, 351#(= |#race~to_int_1~0| 0), 377#true, Black: 345#true, 89#L55-27true, 355#(= |#race~to_int_3~0| 0)]) [2024-10-14 17:12:27,918 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-10-14 17:12:27,918 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-14 17:12:27,919 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-14 17:12:27,919 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-14 17:12:27,924 INFO L124 PetriNetUnfolderBase]: 68/1516 cut-off events. [2024-10-14 17:12:27,924 INFO L125 PetriNetUnfolderBase]: For 20/36 co-relation queries the response was YES. [2024-10-14 17:12:27,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1516 events. 68/1516 cut-off events. For 20/36 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11442 event pairs, 18 based on Foata normal form. 5/1415 useless extension candidates. Maximal degree in co-relation 1719. Up to 89 conditions per place. [2024-10-14 17:12:27,940 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 0 selfloop transitions, 0 changer transitions 280/280 dead transitions. [2024-10-14 17:12:27,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 280 transitions, 664 flow [2024-10-14 17:12:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2024-10-14 17:12:27,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2024-10-14 17:12:27,944 INFO L175 Difference]: Start difference. First operand has 286 places, 282 transitions, 648 flow. Second operand 3 states and 921 transitions. [2024-10-14 17:12:27,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 280 transitions, 664 flow [2024-10-14 17:12:27,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:27,949 INFO L231 Difference]: Finished difference. Result has 285 places, 0 transitions, 0 flow [2024-10-14 17:12:27,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=285, PETRI_TRANSITIONS=0} [2024-10-14 17:12:27,950 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -14 predicate places. [2024-10-14 17:12:27,950 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 0 transitions, 0 flow [2024-10-14 17:12:27,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:27,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-10-14 17:12:27,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-10-14 17:12:27,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-10-14 17:12:27,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-10-14 17:12:27,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-10-14 17:12:27,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-10-14 17:12:27,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-10-14 17:12:27,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-10-14 17:12:27,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-10-14 17:12:27,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-10-14 17:12:27,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-10-14 17:12:27,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-10-14 17:12:27,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-10-14 17:12:27,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-10-14 17:12:27,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-10-14 17:12:27,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-10-14 17:12:27,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-10-14 17:12:27,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-10-14 17:12:27,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-10-14 17:12:27,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-10-14 17:12:27,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-10-14 17:12:27,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-10-14 17:12:27,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-10-14 17:12:27,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-10-14 17:12:27,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-10-14 17:12:27,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-10-14 17:12:27,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-10-14 17:12:27,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-10-14 17:12:27,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-10-14 17:12:27,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 50 remaining) [2024-10-14 17:12:27,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-10-14 17:12:27,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-10-14 17:12:27,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-10-14 17:12:27,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-10-14 17:12:27,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-10-14 17:12:27,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-10-14 17:12:27,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-10-14 17:12:27,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-10-14 17:12:27,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-10-14 17:12:27,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-10-14 17:12:27,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-10-14 17:12:27,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-10-14 17:12:27,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-10-14 17:12:27,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-10-14 17:12:27,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-10-14 17:12:27,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-10-14 17:12:27,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-10-14 17:12:27,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-10-14 17:12:27,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-10-14 17:12:27,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-10-14 17:12:27,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:12:27,966 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:27,974 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:12:27,974 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:12:27,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:12:27 BasicIcfg [2024-10-14 17:12:27,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:12:27,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:12:27,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:12:27,981 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:12:27,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:21" (3/4) ... [2024-10-14 17:12:27,983 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:12:27,986 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:12:27,987 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:12:27,987 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-14 17:12:27,993 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-14 17:12:27,994 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:12:27,994 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:12:27,994 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:12:28,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:12:28,094 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:12:28,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:12:28,095 INFO L158 Benchmark]: Toolchain (without parser) took 7412.67ms. Allocated memory was 161.5MB in the beginning and 469.8MB in the end (delta: 308.3MB). Free memory was 105.9MB in the beginning and 320.4MB in the end (delta: -214.5MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2024-10-14 17:12:28,095 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:12:28,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.64ms. Allocated memory is still 161.5MB. Free memory was 105.5MB in the beginning and 133.3MB in the end (delta: -27.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:12:28,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.36ms. Allocated memory is still 161.5MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:12:28,096 INFO L158 Benchmark]: Boogie Preprocessor took 36.76ms. Allocated memory is still 161.5MB. Free memory was 131.2MB in the beginning and 129.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:12:28,097 INFO L158 Benchmark]: RCFGBuilder took 607.66ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 105.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 17:12:28,097 INFO L158 Benchmark]: TraceAbstraction took 6187.29ms. Allocated memory was 161.5MB in the beginning and 469.8MB in the end (delta: 308.3MB). Free memory was 104.6MB in the beginning and 325.6MB in the end (delta: -221.0MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2024-10-14 17:12:28,098 INFO L158 Benchmark]: Witness Printer took 114.13ms. Allocated memory is still 469.8MB. Free memory was 325.6MB in the beginning and 320.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 17:12:28,099 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.24ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.64ms. Allocated memory is still 161.5MB. Free memory was 105.5MB in the beginning and 133.3MB in the end (delta: -27.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.36ms. Allocated memory is still 161.5MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.76ms. Allocated memory is still 161.5MB. Free memory was 131.2MB in the beginning and 129.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 607.66ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 105.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6187.29ms. Allocated memory was 161.5MB in the beginning and 469.8MB in the end (delta: 308.3MB). Free memory was 104.6MB in the beginning and 325.6MB in the end (delta: -221.0MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 114.13ms. Allocated memory is still 469.8MB. Free memory was 325.6MB in the beginning and 320.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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, 488 locations, 50 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: 6.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 87 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=657occurred in iteration=14, InterpolantAutomatonStates: 54, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1477 NumberOfCodeBlocks, 1477 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:12:28,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE