./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/weaver/unroll-cond-2.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 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:03:07,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:03:07,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:03:07,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:03:07,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:03:07,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:03:07,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:03:07,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:03:07,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:03:07,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:03:07,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:03:07,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:03:07,618 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:03:07,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:03:07,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:03:07,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:03:07,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:03:07,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:03:07,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:03:07,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:03:07,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:03:07,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:03:07,623 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:03:07,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:03:07,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:03:07,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:03:07,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:03:07,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:03:07,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:03:07,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:03:07,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:03:07,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:03:07,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:03:07,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:03:07,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:03:07,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:03:07,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:03:07,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:03:07,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:03:07,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:03:07,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:03:07,631 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 -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b [2024-11-09 07:03:07,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:03:07,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:03:07,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:03:07,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:03:07,856 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:03:07,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2024-11-09 07:03:09,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:03:09,266 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:03:09,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2024-11-09 07:03:09,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80708e00a/54183e7071a2482189c55c2a24c49f29/FLAG36ba744ea [2024-11-09 07:03:09,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80708e00a/54183e7071a2482189c55c2a24c49f29 [2024-11-09 07:03:09,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:03:09,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:03:09,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:03:09,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:03:09,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:03:09,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa0047c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09, skipping insertion in model container [2024-11-09 07:03:09,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:03:09,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:03:09,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:03:09,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:03:09,527 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:03:09,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09 WrapperNode [2024-11-09 07:03:09,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:03:09,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:03:09,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:03:09,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:03:09,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,567 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 261 [2024-11-09 07:03:09,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:03:09,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:03:09,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:03:09,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:03:09,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:03:09,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:03:09,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:03:09,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:03:09,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (1/1) ... [2024-11-09 07:03:09,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:03:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:03:09,641 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-11-09 07:03:09,645 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-11-09 07:03:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:03:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:03:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:03:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:03:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:03:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:03:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:03:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:03:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:03:09,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:03:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:03:09,686 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:03:09,769 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:03:09,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:03:10,167 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:03:10,168 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:03:10,192 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:03:10,192 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:03:10,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:03:10 BoogieIcfgContainer [2024-11-09 07:03:10,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:03:10,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:03:10,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:03:10,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:03:10,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:03:09" (1/3) ... [2024-11-09 07:03:10,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc62860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:03:10, skipping insertion in model container [2024-11-09 07:03:10,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:09" (2/3) ... [2024-11-09 07:03:10,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc62860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:03:10, skipping insertion in model container [2024-11-09 07:03:10,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:03:10" (3/3) ... [2024-11-09 07:03:10,228 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2024-11-09 07:03:10,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:03:10,245 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-09 07:03:10,245 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:03:10,378 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 07:03:10,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 343 transitions, 700 flow [2024-11-09 07:03:10,501 INFO L124 PetriNetUnfolderBase]: 19/341 cut-off events. [2024-11-09 07:03:10,502 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:03:10,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 341 events. 19/341 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 734 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2024-11-09 07:03:10,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 343 transitions, 700 flow [2024-11-09 07:03:10,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 324 transitions, 660 flow [2024-11-09 07:03:10,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:03:10,535 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;@5bb787c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:03:10,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2024-11-09 07:03:10,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:03:10,539 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-11-09 07:03:10,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:03:10,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:10,540 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] [2024-11-09 07:03:10,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:10,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash -659499856, now seen corresponding path program 1 times [2024-11-09 07:03:10,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:10,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281076201] [2024-11-09 07:03:10,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:10,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:10,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:10,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281076201] [2024-11-09 07:03:10,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281076201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:10,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013313047] [2024-11-09 07:03:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:10,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:10,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:10,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 343 [2024-11-09 07:03:10,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 324 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:10,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:10,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 343 [2024-11-09 07:03:10,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:10,887 INFO L124 PetriNetUnfolderBase]: 19/476 cut-off events. [2024-11-09 07:03:10,887 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-09 07:03:10,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 476 events. 19/476 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1764 event pairs, 5 based on Foata normal form. 11/401 useless extension candidates. Maximal degree in co-relation 383. Up to 24 conditions per place. [2024-11-09 07:03:10,894 INFO L140 encePairwiseOnDemand]: 330/343 looper letters, 10 selfloop transitions, 2 changer transitions 3/313 dead transitions. [2024-11-09 07:03:10,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 313 transitions, 662 flow [2024-11-09 07:03:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 974 transitions. [2024-11-09 07:03:10,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9465500485908649 [2024-11-09 07:03:10,911 INFO L175 Difference]: Start difference. First operand has 313 places, 324 transitions, 660 flow. Second operand 3 states and 974 transitions. [2024-11-09 07:03:10,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 313 transitions, 662 flow [2024-11-09 07:03:10,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 313 transitions, 654 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 07:03:10,924 INFO L231 Difference]: Finished difference. Result has 310 places, 310 transitions, 628 flow [2024-11-09 07:03:10,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=310, PETRI_TRANSITIONS=310} [2024-11-09 07:03:10,928 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -3 predicate places. [2024-11-09 07:03:10,931 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 310 transitions, 628 flow [2024-11-09 07:03:10,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:10,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:10,932 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:10,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:03:10,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:10,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1494811063, now seen corresponding path program 1 times [2024-11-09 07:03:10,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:10,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889810905] [2024-11-09 07:03:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:10,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:10,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:10,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889810905] [2024-11-09 07:03:10,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889810905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:10,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:10,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:10,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481353877] [2024-11-09 07:03:10,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:10,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:10,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:10,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:11,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 343 [2024-11-09 07:03:11,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 310 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:11,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:11,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 343 [2024-11-09 07:03:11,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:11,097 INFO L124 PetriNetUnfolderBase]: 20/468 cut-off events. [2024-11-09 07:03:11,098 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-09 07:03:11,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 468 events. 20/468 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1563 event pairs, 7 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 477. Up to 28 conditions per place. [2024-11-09 07:03:11,103 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 13 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2024-11-09 07:03:11,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 656 flow [2024-11-09 07:03:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2024-11-09 07:03:11,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9310009718172984 [2024-11-09 07:03:11,109 INFO L175 Difference]: Start difference. First operand has 310 places, 310 transitions, 628 flow. Second operand 3 states and 958 transitions. [2024-11-09 07:03:11,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 656 flow [2024-11-09 07:03:11,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 309 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:11,117 INFO L231 Difference]: Finished difference. Result has 306 places, 309 transitions, 626 flow [2024-11-09 07:03:11,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=306, PETRI_TRANSITIONS=309} [2024-11-09 07:03:11,118 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -7 predicate places. [2024-11-09 07:03:11,118 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 309 transitions, 626 flow [2024-11-09 07:03:11,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:11,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:11,119 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] [2024-11-09 07:03:11,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:03:11,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:11,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1037569853, now seen corresponding path program 1 times [2024-11-09 07:03:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:11,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515902205] [2024-11-09 07:03:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:11,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515902205] [2024-11-09 07:03:11,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515902205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:11,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:11,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286810036] [2024-11-09 07:03:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:11,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:11,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:11,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:11,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 343 [2024-11-09 07:03:11,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 309 transitions, 626 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-11-09 07:03:11,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:11,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 343 [2024-11-09 07:03:11,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:11,340 INFO L124 PetriNetUnfolderBase]: 66/965 cut-off events. [2024-11-09 07:03:11,340 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-09 07:03:11,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 965 events. 66/965 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4886 event pairs, 20 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 1016. Up to 77 conditions per place. [2024-11-09 07:03:11,351 INFO L140 encePairwiseOnDemand]: 336/343 looper letters, 16 selfloop transitions, 1 changer transitions 0/303 dead transitions. [2024-11-09 07:03:11,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 303 transitions, 648 flow [2024-11-09 07:03:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2024-11-09 07:03:11,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9203109815354713 [2024-11-09 07:03:11,355 INFO L175 Difference]: Start difference. First operand has 306 places, 309 transitions, 626 flow. Second operand 3 states and 947 transitions. [2024-11-09 07:03:11,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 303 transitions, 648 flow [2024-11-09 07:03:11,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 303 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:11,359 INFO L231 Difference]: Finished difference. Result has 300 places, 303 transitions, 612 flow [2024-11-09 07:03:11,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=300, PETRI_TRANSITIONS=303} [2024-11-09 07:03:11,361 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -13 predicate places. [2024-11-09 07:03:11,362 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 303 transitions, 612 flow [2024-11-09 07:03:11,363 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-11-09 07:03:11,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:11,363 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] [2024-11-09 07:03:11,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:03:11,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:11,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1644350307, now seen corresponding path program 1 times [2024-11-09 07:03:11,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:11,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704791869] [2024-11-09 07:03:11,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:11,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704791869] [2024-11-09 07:03:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704791869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:11,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:11,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:11,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792640939] [2024-11-09 07:03:11,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:11,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:11,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:11,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 343 [2024-11-09 07:03:11,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 303 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:11,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:11,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 343 [2024-11-09 07:03:11,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:11,527 INFO L124 PetriNetUnfolderBase]: 20/458 cut-off events. [2024-11-09 07:03:11,527 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-09 07:03:11,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 458 events. 20/458 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1514 event pairs, 7 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 456. Up to 26 conditions per place. [2024-11-09 07:03:11,531 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 11 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-11-09 07:03:11,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 302 transitions, 636 flow [2024-11-09 07:03:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2024-11-09 07:03:11,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.93488824101069 [2024-11-09 07:03:11,534 INFO L175 Difference]: Start difference. First operand has 300 places, 303 transitions, 612 flow. Second operand 3 states and 962 transitions. [2024-11-09 07:03:11,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 302 transitions, 636 flow [2024-11-09 07:03:11,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 302 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:03:11,538 INFO L231 Difference]: Finished difference. Result has 300 places, 302 transitions, 613 flow [2024-11-09 07:03:11,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=300, PETRI_TRANSITIONS=302} [2024-11-09 07:03:11,540 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -13 predicate places. [2024-11-09 07:03:11,540 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 302 transitions, 613 flow [2024-11-09 07:03:11,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:11,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:11,541 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] [2024-11-09 07:03:11,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:03:11,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:11,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash -312165425, now seen corresponding path program 1 times [2024-11-09 07:03:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126633652] [2024-11-09 07:03:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:11,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:12,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126633652] [2024-11-09 07:03:12,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126633652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479885743] [2024-11-09 07:03:12,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:12,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 343 [2024-11-09 07:03:12,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 302 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 298.5) internal successors, (1791), 6 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:12,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 343 [2024-11-09 07:03:12,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:12,315 INFO L124 PetriNetUnfolderBase]: 131/1251 cut-off events. [2024-11-09 07:03:12,316 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2024-11-09 07:03:12,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 1251 events. 131/1251 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6888 event pairs, 64 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1424. Up to 192 conditions per place. [2024-11-09 07:03:12,323 INFO L140 encePairwiseOnDemand]: 337/343 looper letters, 28 selfloop transitions, 5 changer transitions 0/301 dead transitions. [2024-11-09 07:03:12,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 301 transitions, 677 flow [2024-11-09 07:03:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1816 transitions. [2024-11-09 07:03:12,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8824101068999028 [2024-11-09 07:03:12,326 INFO L175 Difference]: Start difference. First operand has 300 places, 302 transitions, 613 flow. Second operand 6 states and 1816 transitions. [2024-11-09 07:03:12,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 301 transitions, 677 flow [2024-11-09 07:03:12,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:12,330 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 617 flow [2024-11-09 07:03:12,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=617, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-11-09 07:03:12,332 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -11 predicate places. [2024-11-09 07:03:12,332 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 617 flow [2024-11-09 07:03:12,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.5) internal successors, (1791), 6 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:12,334 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] [2024-11-09 07:03:12,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:03:12,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1384630540, now seen corresponding path program 1 times [2024-11-09 07:03:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:12,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627694844] [2024-11-09 07:03:12,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:12,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:12,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627694844] [2024-11-09 07:03:12,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627694844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:12,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050167844] [2024-11-09 07:03:12,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:12,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:12,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:12,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 343 [2024-11-09 07:03:12,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:12,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 343 [2024-11-09 07:03:12,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:12,454 INFO L124 PetriNetUnfolderBase]: 44/838 cut-off events. [2024-11-09 07:03:12,455 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 07:03:12,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 838 events. 44/838 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4336 event pairs, 9 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 881. Up to 45 conditions per place. [2024-11-09 07:03:12,459 INFO L140 encePairwiseOnDemand]: 338/343 looper letters, 12 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2024-11-09 07:03:12,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 301 transitions, 646 flow [2024-11-09 07:03:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-11-09 07:03:12,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9407191448007775 [2024-11-09 07:03:12,461 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 617 flow. Second operand 3 states and 968 transitions. [2024-11-09 07:03:12,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 301 transitions, 646 flow [2024-11-09 07:03:12,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 301 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:12,467 INFO L231 Difference]: Finished difference. Result has 297 places, 300 transitions, 615 flow [2024-11-09 07:03:12,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=297, PETRI_TRANSITIONS=300} [2024-11-09 07:03:12,468 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -16 predicate places. [2024-11-09 07:03:12,470 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 300 transitions, 615 flow [2024-11-09 07:03:12,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:12,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, 1, 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-11-09 07:03:12,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:03:12,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:12,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:12,471 INFO L85 PathProgramCache]: Analyzing trace with hash -661708911, now seen corresponding path program 1 times [2024-11-09 07:03:12,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:12,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383432290] [2024-11-09 07:03:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:12,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383432290] [2024-11-09 07:03:12,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383432290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:12,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906197220] [2024-11-09 07:03:12,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:12,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:12,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:12,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 343 [2024-11-09 07:03:12,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 300 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:12,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 343 [2024-11-09 07:03:12,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:12,591 INFO L124 PetriNetUnfolderBase]: 28/621 cut-off events. [2024-11-09 07:03:12,592 INFO L125 PetriNetUnfolderBase]: For 2/7 co-relation queries the response was YES. [2024-11-09 07:03:12,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 621 events. 28/621 cut-off events. For 2/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2355 event pairs, 1 based on Foata normal form. 1/533 useless extension candidates. Maximal degree in co-relation 637. Up to 20 conditions per place. [2024-11-09 07:03:12,597 INFO L140 encePairwiseOnDemand]: 336/343 looper letters, 11 selfloop transitions, 3 changer transitions 0/297 dead transitions. [2024-11-09 07:03:12,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 297 transitions, 638 flow [2024-11-09 07:03:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-11-09 07:03:12,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9329446064139941 [2024-11-09 07:03:12,600 INFO L175 Difference]: Start difference. First operand has 297 places, 300 transitions, 615 flow. Second operand 3 states and 960 transitions. [2024-11-09 07:03:12,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 297 transitions, 638 flow [2024-11-09 07:03:12,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 297 transitions, 638 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:12,605 INFO L231 Difference]: Finished difference. Result has 295 places, 296 transitions, 613 flow [2024-11-09 07:03:12,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=295, PETRI_TRANSITIONS=296} [2024-11-09 07:03:12,606 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -18 predicate places. [2024-11-09 07:03:12,606 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 296 transitions, 613 flow [2024-11-09 07:03:12,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:12,607 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-11-09 07:03:12,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:03:12,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:12,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1690398679, now seen corresponding path program 1 times [2024-11-09 07:03:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056430775] [2024-11-09 07:03:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:12,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056430775] [2024-11-09 07:03:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056430775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728405270] [2024-11-09 07:03:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:12,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:12,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 343 [2024-11-09 07:03:12,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 296 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:12,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 343 [2024-11-09 07:03:12,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:12,766 INFO L124 PetriNetUnfolderBase]: 39/539 cut-off events. [2024-11-09 07:03:12,766 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2024-11-09 07:03:12,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 539 events. 39/539 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2199 event pairs, 3 based on Foata normal form. 1/485 useless extension candidates. Maximal degree in co-relation 612. Up to 73 conditions per place. [2024-11-09 07:03:12,769 INFO L140 encePairwiseOnDemand]: 326/343 looper letters, 19 selfloop transitions, 6 changer transitions 4/287 dead transitions. [2024-11-09 07:03:12,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 287 transitions, 650 flow [2024-11-09 07:03:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2024-11-09 07:03:12,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8931000971817298 [2024-11-09 07:03:12,772 INFO L175 Difference]: Start difference. First operand has 295 places, 296 transitions, 613 flow. Second operand 3 states and 919 transitions. [2024-11-09 07:03:12,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 287 transitions, 650 flow [2024-11-09 07:03:12,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 287 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:12,776 INFO L231 Difference]: Finished difference. Result has 285 places, 282 transitions, 590 flow [2024-11-09 07:03:12,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=285, PETRI_TRANSITIONS=282} [2024-11-09 07:03:12,777 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -28 predicate places. [2024-11-09 07:03:12,777 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 282 transitions, 590 flow [2024-11-09 07:03:12,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:12,778 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] [2024-11-09 07:03:12,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:03:12,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:12,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1032504319, now seen corresponding path program 1 times [2024-11-09 07:03:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:12,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233213835] [2024-11-09 07:03:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:12,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233213835] [2024-11-09 07:03:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233213835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569835198] [2024-11-09 07:03:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:12,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 343 [2024-11-09 07:03:12,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 282 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:12,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 343 [2024-11-09 07:03:12,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:12,910 INFO L124 PetriNetUnfolderBase]: 69/1025 cut-off events. [2024-11-09 07:03:12,910 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 07:03:12,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 1025 events. 69/1025 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5261 event pairs, 7 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1124. Up to 69 conditions per place. [2024-11-09 07:03:12,916 INFO L140 encePairwiseOnDemand]: 336/343 looper letters, 14 selfloop transitions, 3 changer transitions 0/283 dead transitions. [2024-11-09 07:03:12,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 283 transitions, 628 flow [2024-11-09 07:03:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2024-11-09 07:03:12,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9358600583090378 [2024-11-09 07:03:12,918 INFO L175 Difference]: Start difference. First operand has 285 places, 282 transitions, 590 flow. Second operand 3 states and 963 transitions. [2024-11-09 07:03:12,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 283 transitions, 628 flow [2024-11-09 07:03:12,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 283 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:12,922 INFO L231 Difference]: Finished difference. Result has 278 places, 281 transitions, 591 flow [2024-11-09 07:03:12,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=278, PETRI_TRANSITIONS=281} [2024-11-09 07:03:12,923 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -35 predicate places. [2024-11-09 07:03:12,923 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 281 transitions, 591 flow [2024-11-09 07:03:12,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:12,924 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:12,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:03:12,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:12,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1863096921, now seen corresponding path program 1 times [2024-11-09 07:03:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599348534] [2024-11-09 07:03:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599348534] [2024-11-09 07:03:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599348534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:03:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929266858] [2024-11-09 07:03:12,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:03:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:03:12,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:03:13,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 343 [2024-11-09 07:03:13,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 281 transitions, 591 flow. Second operand has 4 states, 4 states have (on average 321.25) internal successors, (1285), 4 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:13,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 343 [2024-11-09 07:03:13,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:13,125 INFO L124 PetriNetUnfolderBase]: 67/1265 cut-off events. [2024-11-09 07:03:13,126 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:03:13,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 1265 events. 67/1265 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6971 event pairs, 5 based on Foata normal form. 0/1133 useless extension candidates. Maximal degree in co-relation 1344. Up to 31 conditions per place. [2024-11-09 07:03:13,132 INFO L140 encePairwiseOnDemand]: 337/343 looper letters, 13 selfloop transitions, 6 changer transitions 0/290 dead transitions. [2024-11-09 07:03:13,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 290 transitions, 651 flow [2024-11-09 07:03:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:03:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:03:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1620 transitions. [2024-11-09 07:03:13,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446064139941691 [2024-11-09 07:03:13,135 INFO L175 Difference]: Start difference. First operand has 278 places, 281 transitions, 591 flow. Second operand 5 states and 1620 transitions. [2024-11-09 07:03:13,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 290 transitions, 651 flow [2024-11-09 07:03:13,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 290 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:13,138 INFO L231 Difference]: Finished difference. Result has 285 places, 285 transitions, 629 flow [2024-11-09 07:03:13,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=629, PETRI_PLACES=285, PETRI_TRANSITIONS=285} [2024-11-09 07:03:13,139 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -28 predicate places. [2024-11-09 07:03:13,139 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 285 transitions, 629 flow [2024-11-09 07:03:13,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 321.25) internal successors, (1285), 4 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:13,140 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:13,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:03:13,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:13,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash -416324324, now seen corresponding path program 1 times [2024-11-09 07:03:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:13,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818333379] [2024-11-09 07:03:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:13,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:13,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818333379] [2024-11-09 07:03:13,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818333379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:13,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:13,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875112557] [2024-11-09 07:03:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:13,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:13,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 343 [2024-11-09 07:03:13,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 285 transitions, 629 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:13,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 343 [2024-11-09 07:03:13,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:13,727 INFO L124 PetriNetUnfolderBase]: 56/973 cut-off events. [2024-11-09 07:03:13,727 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-09 07:03:13,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 973 events. 56/973 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4761 event pairs, 4 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1073. Up to 24 conditions per place. [2024-11-09 07:03:13,733 INFO L140 encePairwiseOnDemand]: 337/343 looper letters, 15 selfloop transitions, 6 changer transitions 0/288 dead transitions. [2024-11-09 07:03:13,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 288 transitions, 681 flow [2024-11-09 07:03:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1899 transitions. [2024-11-09 07:03:13,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.922740524781341 [2024-11-09 07:03:13,737 INFO L175 Difference]: Start difference. First operand has 285 places, 285 transitions, 629 flow. Second operand 6 states and 1899 transitions. [2024-11-09 07:03:13,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 288 transitions, 681 flow [2024-11-09 07:03:13,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 681 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:13,741 INFO L231 Difference]: Finished difference. Result has 289 places, 284 transitions, 639 flow [2024-11-09 07:03:13,741 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=289, PETRI_TRANSITIONS=284} [2024-11-09 07:03:13,742 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -24 predicate places. [2024-11-09 07:03:13,742 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 284 transitions, 639 flow [2024-11-09 07:03:13,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:13,743 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:13,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:03:13,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:13,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash 806669644, now seen corresponding path program 1 times [2024-11-09 07:03:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:13,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946857062] [2024-11-09 07:03:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:13,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946857062] [2024-11-09 07:03:13,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946857062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:13,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:13,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:03:13,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306126879] [2024-11-09 07:03:13,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:13,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:03:13,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:03:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:03:13,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 343 [2024-11-09 07:03:13,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 284 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:13,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 343 [2024-11-09 07:03:13,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:14,016 INFO L124 PetriNetUnfolderBase]: 81/1315 cut-off events. [2024-11-09 07:03:14,016 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2024-11-09 07:03:14,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 1315 events. 81/1315 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6701 event pairs, 10 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1500. Up to 67 conditions per place. [2024-11-09 07:03:14,025 INFO L140 encePairwiseOnDemand]: 336/343 looper letters, 14 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2024-11-09 07:03:14,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 293 transitions, 702 flow [2024-11-09 07:03:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:03:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:03:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2024-11-09 07:03:14,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9399416909620991 [2024-11-09 07:03:14,028 INFO L175 Difference]: Start difference. First operand has 289 places, 284 transitions, 639 flow. Second operand 5 states and 1612 transitions. [2024-11-09 07:03:14,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 293 transitions, 702 flow [2024-11-09 07:03:14,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 293 transitions, 690 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:14,032 INFO L231 Difference]: Finished difference. Result has 291 places, 289 transitions, 673 flow [2024-11-09 07:03:14,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=291, PETRI_TRANSITIONS=289} [2024-11-09 07:03:14,033 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -22 predicate places. [2024-11-09 07:03:14,034 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 289 transitions, 673 flow [2024-11-09 07:03:14,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:14,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:14,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:14,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:03:14,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:14,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1242172703, now seen corresponding path program 1 times [2024-11-09 07:03:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249034160] [2024-11-09 07:03:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:14,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249034160] [2024-11-09 07:03:14,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249034160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:14,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:14,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:14,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059153154] [2024-11-09 07:03:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:14,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:14,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:14,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 343 [2024-11-09 07:03:14,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 289 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:14,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:14,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 343 [2024-11-09 07:03:14,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:14,243 INFO L124 PetriNetUnfolderBase]: 86/1838 cut-off events. [2024-11-09 07:03:14,243 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-09 07:03:14,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 1838 events. 86/1838 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 11241 event pairs, 14 based on Foata normal form. 0/1669 useless extension candidates. Maximal degree in co-relation 2088. Up to 48 conditions per place. [2024-11-09 07:03:14,256 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 9 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-11-09 07:03:14,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 289 transitions, 696 flow [2024-11-09 07:03:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2024-11-09 07:03:14,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-09 07:03:14,258 INFO L175 Difference]: Start difference. First operand has 291 places, 289 transitions, 673 flow. Second operand 3 states and 966 transitions. [2024-11-09 07:03:14,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 289 transitions, 696 flow [2024-11-09 07:03:14,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 696 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:14,264 INFO L231 Difference]: Finished difference. Result has 292 places, 288 transitions, 675 flow [2024-11-09 07:03:14,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=290, 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=675, PETRI_PLACES=292, PETRI_TRANSITIONS=288} [2024-11-09 07:03:14,265 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -21 predicate places. [2024-11-09 07:03:14,265 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 288 transitions, 675 flow [2024-11-09 07:03:14,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:14,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:14,266 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:14,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:03:14,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:14,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash -525640676, now seen corresponding path program 1 times [2024-11-09 07:03:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:14,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766305013] [2024-11-09 07:03:14,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766305013] [2024-11-09 07:03:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766305013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:14,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:14,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:03:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039659042] [2024-11-09 07:03:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:14,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:03:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:14,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:03:14,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:03:14,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 343 [2024-11-09 07:03:14,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 288 transitions, 675 flow. Second operand has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:14,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:14,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 343 [2024-11-09 07:03:14,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:14,556 INFO L124 PetriNetUnfolderBase]: 78/1307 cut-off events. [2024-11-09 07:03:14,556 INFO L125 PetriNetUnfolderBase]: For 92/93 co-relation queries the response was YES. [2024-11-09 07:03:14,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 1307 events. 78/1307 cut-off events. For 92/93 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6659 event pairs, 10 based on Foata normal form. 0/1193 useless extension candidates. Maximal degree in co-relation 1553. Up to 67 conditions per place. [2024-11-09 07:03:14,569 INFO L140 encePairwiseOnDemand]: 336/343 looper letters, 14 selfloop transitions, 7 changer transitions 0/295 dead transitions. [2024-11-09 07:03:14,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 295 transitions, 734 flow [2024-11-09 07:03:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:03:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:03:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2024-11-09 07:03:14,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9399416909620991 [2024-11-09 07:03:14,574 INFO L175 Difference]: Start difference. First operand has 292 places, 288 transitions, 675 flow. Second operand 5 states and 1612 transitions. [2024-11-09 07:03:14,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 295 transitions, 734 flow [2024-11-09 07:03:14,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 295 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:14,578 INFO L231 Difference]: Finished difference. Result has 297 places, 291 transitions, 709 flow [2024-11-09 07:03:14,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=709, PETRI_PLACES=297, PETRI_TRANSITIONS=291} [2024-11-09 07:03:14,579 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -16 predicate places. [2024-11-09 07:03:14,580 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 291 transitions, 709 flow [2024-11-09 07:03:14,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:14,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:14,581 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] [2024-11-09 07:03:14,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:03:14,581 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:14,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash -596771569, now seen corresponding path program 1 times [2024-11-09 07:03:14,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428701580] [2024-11-09 07:03:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:14,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428701580] [2024-11-09 07:03:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428701580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:14,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075281041] [2024-11-09 07:03:14,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:14,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:14,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:14,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:14,976 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 343 [2024-11-09 07:03:14,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 291 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 300.6666666666667) internal successors, (1804), 6 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:14,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:14,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 343 [2024-11-09 07:03:14,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:15,101 INFO L124 PetriNetUnfolderBase]: 104/1107 cut-off events. [2024-11-09 07:03:15,102 INFO L125 PetriNetUnfolderBase]: For 165/166 co-relation queries the response was YES. [2024-11-09 07:03:15,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 1107 events. 104/1107 cut-off events. For 165/166 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5266 event pairs, 12 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1525. Up to 80 conditions per place. [2024-11-09 07:03:15,112 INFO L140 encePairwiseOnDemand]: 325/343 looper letters, 17 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2024-11-09 07:03:15,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 292 transitions, 783 flow [2024-11-09 07:03:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1829 transitions. [2024-11-09 07:03:15,117 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8887269193391643 [2024-11-09 07:03:15,117 INFO L175 Difference]: Start difference. First operand has 297 places, 291 transitions, 709 flow. Second operand 6 states and 1829 transitions. [2024-11-09 07:03:15,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 292 transitions, 783 flow [2024-11-09 07:03:15,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 292 transitions, 783 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:15,122 INFO L231 Difference]: Finished difference. Result has 299 places, 288 transitions, 737 flow [2024-11-09 07:03:15,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=737, PETRI_PLACES=299, PETRI_TRANSITIONS=288} [2024-11-09 07:03:15,123 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -14 predicate places. [2024-11-09 07:03:15,123 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 288 transitions, 737 flow [2024-11-09 07:03:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.6666666666667) internal successors, (1804), 6 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:15,124 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:15,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:03:15,124 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:15,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:15,125 INFO L85 PathProgramCache]: Analyzing trace with hash -844027211, now seen corresponding path program 1 times [2024-11-09 07:03:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529692228] [2024-11-09 07:03:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:15,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529692228] [2024-11-09 07:03:15,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529692228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:15,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:15,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:15,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900962017] [2024-11-09 07:03:15,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:15,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:15,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:15,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:15,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:15,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 343 [2024-11-09 07:03:15,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 288 transitions, 737 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:15,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 343 [2024-11-09 07:03:15,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:15,317 INFO L124 PetriNetUnfolderBase]: 96/1301 cut-off events. [2024-11-09 07:03:15,317 INFO L125 PetriNetUnfolderBase]: For 183/184 co-relation queries the response was YES. [2024-11-09 07:03:15,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1301 events. 96/1301 cut-off events. For 183/184 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6773 event pairs, 44 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 1800. Up to 156 conditions per place. [2024-11-09 07:03:15,325 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 17 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-09 07:03:15,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 776 flow [2024-11-09 07:03:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2024-11-09 07:03:15,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.923226433430515 [2024-11-09 07:03:15,327 INFO L175 Difference]: Start difference. First operand has 299 places, 288 transitions, 737 flow. Second operand 3 states and 950 transitions. [2024-11-09 07:03:15,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 288 transitions, 776 flow [2024-11-09 07:03:15,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 288 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:15,331 INFO L231 Difference]: Finished difference. Result has 295 places, 287 transitions, 705 flow [2024-11-09 07:03:15,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=293, 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=705, PETRI_PLACES=295, PETRI_TRANSITIONS=287} [2024-11-09 07:03:15,332 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -18 predicate places. [2024-11-09 07:03:15,332 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 287 transitions, 705 flow [2024-11-09 07:03:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:15,333 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] [2024-11-09 07:03:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:03:15,333 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:15,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 618015076, now seen corresponding path program 1 times [2024-11-09 07:03:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901253632] [2024-11-09 07:03:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901253632] [2024-11-09 07:03:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901253632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:15,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:15,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417583525] [2024-11-09 07:03:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:15,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:15,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:15,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 343 [2024-11-09 07:03:15,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 287 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:15,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 343 [2024-11-09 07:03:15,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:15,512 INFO L124 PetriNetUnfolderBase]: 92/1206 cut-off events. [2024-11-09 07:03:15,513 INFO L125 PetriNetUnfolderBase]: For 139/140 co-relation queries the response was YES. [2024-11-09 07:03:15,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 1206 events. 92/1206 cut-off events. For 139/140 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5978 event pairs, 44 based on Foata normal form. 0/1134 useless extension candidates. Maximal degree in co-relation 1564. Up to 154 conditions per place. [2024-11-09 07:03:15,525 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 16 selfloop transitions, 2 changer transitions 1/287 dead transitions. [2024-11-09 07:03:15,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 287 transitions, 744 flow [2024-11-09 07:03:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2024-11-09 07:03:15,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.923226433430515 [2024-11-09 07:03:15,528 INFO L175 Difference]: Start difference. First operand has 295 places, 287 transitions, 705 flow. Second operand 3 states and 950 transitions. [2024-11-09 07:03:15,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 287 transitions, 744 flow [2024-11-09 07:03:15,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 287 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:15,535 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 703 flow [2024-11-09 07:03:15,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=292, 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=703, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2024-11-09 07:03:15,535 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -19 predicate places. [2024-11-09 07:03:15,536 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 703 flow [2024-11-09 07:03:15,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:15,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:15,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:03:15,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-09 07:03:15,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash 692527408, now seen corresponding path program 1 times [2024-11-09 07:03:15,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:15,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086135214] [2024-11-09 07:03:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:15,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:15,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:15,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086135214] [2024-11-09 07:03:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086135214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:15,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311877631] [2024-11-09 07:03:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:15,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:15,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:15,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:15,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:15,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 343 [2024-11-09 07:03:15,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:15,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 343 [2024-11-09 07:03:15,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:15,728 INFO L124 PetriNetUnfolderBase]: 95/1259 cut-off events. [2024-11-09 07:03:15,728 INFO L125 PetriNetUnfolderBase]: For 143/144 co-relation queries the response was YES. [2024-11-09 07:03:15,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 1259 events. 95/1259 cut-off events. For 143/144 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6421 event pairs, 44 based on Foata normal form. 0/1192 useless extension candidates. Maximal degree in co-relation 1635. Up to 156 conditions per place. [2024-11-09 07:03:15,733 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 0 selfloop transitions, 0 changer transitions 286/286 dead transitions. [2024-11-09 07:03:15,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 286 transitions, 742 flow [2024-11-09 07:03:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2024-11-09 07:03:15,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.923226433430515 [2024-11-09 07:03:15,735 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 703 flow. Second operand 3 states and 950 transitions. [2024-11-09 07:03:15,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 286 transitions, 742 flow [2024-11-09 07:03:15,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 286 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:15,738 INFO L231 Difference]: Finished difference. Result has 293 places, 0 transitions, 0 flow [2024-11-09 07:03:15,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=293, PETRI_TRANSITIONS=0} [2024-11-09 07:03:15,738 INFO L277 CegarLoopForPetriNet]: 313 programPoint places, -20 predicate places. [2024-11-09 07:03:15,738 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 0 transitions, 0 flow [2024-11-09 07:03:15,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2024-11-09 07:03:15,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2024-11-09 07:03:15,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2024-11-09 07:03:15,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2024-11-09 07:03:15,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2024-11-09 07:03:15,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2024-11-09 07:03:15,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2024-11-09 07:03:15,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2024-11-09 07:03:15,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2024-11-09 07:03:15,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2024-11-09 07:03:15,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2024-11-09 07:03:15,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2024-11-09 07:03:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2024-11-09 07:03:15,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2024-11-09 07:03:15,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2024-11-09 07:03:15,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2024-11-09 07:03:15,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2024-11-09 07:03:15,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2024-11-09 07:03:15,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2024-11-09 07:03:15,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2024-11-09 07:03:15,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2024-11-09 07:03:15,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2024-11-09 07:03:15,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:03:15,751 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-11-09 07:03:15,757 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:03:15,757 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:03:15,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:03:15 BasicIcfg [2024-11-09 07:03:15,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:03:15,762 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:03:15,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:03:15,762 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:03:15,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:03:10" (3/4) ... [2024-11-09 07:03:15,764 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:03:15,766 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 07:03:15,766 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 07:03:15,771 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-09 07:03:15,771 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:03:15,771 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:03:15,771 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:03:15,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:03:15,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:03:15,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:03:15,846 INFO L158 Benchmark]: Toolchain (without parser) took 6560.85ms. Allocated memory was 176.2MB in the beginning and 356.5MB in the end (delta: 180.4MB). Free memory was 118.7MB in the beginning and 266.8MB in the end (delta: -148.1MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2024-11-09 07:03:15,847 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:03:15,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.62ms. Allocated memory is still 176.2MB. Free memory was 118.7MB in the beginning and 104.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:03:15,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.89ms. Allocated memory is still 176.2MB. Free memory was 104.0MB in the beginning and 101.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:03:15,847 INFO L158 Benchmark]: Boogie Preprocessor took 39.93ms. Allocated memory is still 176.2MB. Free memory was 101.4MB in the beginning and 98.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:03:15,847 INFO L158 Benchmark]: RCFGBuilder took 584.17ms. Allocated memory is still 176.2MB. Free memory was 98.7MB in the beginning and 70.9MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 07:03:15,847 INFO L158 Benchmark]: TraceAbstraction took 5565.13ms. Allocated memory was 176.2MB in the beginning and 356.5MB in the end (delta: 180.4MB). Free memory was 70.5MB in the beginning and 273.0MB in the end (delta: -202.6MB). Peak memory consumption was 141.3MB. Max. memory is 16.1GB. [2024-11-09 07:03:15,847 INFO L158 Benchmark]: Witness Printer took 84.14ms. Allocated memory is still 356.5MB. Free memory was 273.0MB in the beginning and 266.8MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:03:15,850 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.15ms. Allocated memory is still 176.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.62ms. Allocated memory is still 176.2MB. Free memory was 118.7MB in the beginning and 104.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.89ms. Allocated memory is still 176.2MB. Free memory was 104.0MB in the beginning and 101.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.93ms. Allocated memory is still 176.2MB. Free memory was 101.4MB in the beginning and 98.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 584.17ms. Allocated memory is still 176.2MB. Free memory was 98.7MB in the beginning and 70.9MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5565.13ms. Allocated memory was 176.2MB in the beginning and 356.5MB in the end (delta: 180.4MB). Free memory was 70.5MB in the beginning and 273.0MB in the end (delta: -202.6MB). Peak memory consumption was 141.3MB. Max. memory is 16.1GB. * Witness Printer took 84.14ms. Allocated memory is still 356.5MB. Free memory was 273.0MB in the beginning and 266.8MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 60]: 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: 60]: 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: 60]: 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: 61]: 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: 61]: 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: 61]: 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: 61]: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 64]: 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: 64]: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 521 locations, 72 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: 5.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1152 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 521 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1447 IncrementalHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 235 mSDtfsCounter, 1447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=737occurred in iteration=15, InterpolantAutomatonStates: 69, 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, 1.5s InterpolantComputationTime, 1602 NumberOfCodeBlocks, 1602 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 2435 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 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:03:15,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE