./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.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 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:15:46,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:15:46,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:15:46,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:15:46,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:15:46,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:15:46,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:15:46,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:15:46,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:15:46,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:15:46,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:15:46,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:15:46,599 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:15:46,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:15:46,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:15:46,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:15:46,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:15:46,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:15:46,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:15:46,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:15:46,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:15:46,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:15:46,605 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:15:46,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:15:46,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:15:46,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:15:46,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:15:46,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:15:46,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:15:46,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:15:46,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:15:46,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:15:46,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:15:46,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:15:46,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:15:46,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:15:46,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:15:46,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:15:46,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:15:46,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:15:46,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:15:46,610 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 -> 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 [2024-10-14 17:15:46,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:15:46,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:15:46,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:15:46,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:15:46,836 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:15:46,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2024-10-14 17:15:48,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:15:48,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:15:48,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2024-10-14 17:15:48,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206aba75f/af7c2bd4ba364ae7aab39b4f28a878d3/FLAG966b1f509 [2024-10-14 17:15:48,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206aba75f/af7c2bd4ba364ae7aab39b4f28a878d3 [2024-10-14 17:15:48,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:15:48,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:15:48,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:15:48,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:15:48,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:15:48,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e58049e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48, skipping insertion in model container [2024-10-14 17:15:48,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:15:48,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:15:48,569 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:15:48,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:15:48,630 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:15:48,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48 WrapperNode [2024-10-14 17:15:48,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:15:48,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:15:48,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:15:48,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:15:48,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,683 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 399 [2024-10-14 17:15:48,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:15:48,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:15:48,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:15:48,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:15:48,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:15:48,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:15:48,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:15:48,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:15:48,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (1/1) ... [2024-10-14 17:15:48,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:15:48,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:15:48,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:15:48,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:15:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:15:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:15:48,809 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:15:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:15:48,809 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:15:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:15:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:15:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:15:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:15:48,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:15:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:15:48,811 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:15:48,893 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:15:48,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:15:49,423 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:15:49,423 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:15:49,474 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:15:49,475 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 17:15:49,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:49 BoogieIcfgContainer [2024-10-14 17:15:49,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:15:49,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:15:49,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:15:49,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:15:49,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:15:48" (1/3) ... [2024-10-14 17:15:49,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f9721f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:49, skipping insertion in model container [2024-10-14 17:15:49,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48" (2/3) ... [2024-10-14 17:15:49,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f9721f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:49, skipping insertion in model container [2024-10-14 17:15:49,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:49" (3/3) ... [2024-10-14 17:15:49,495 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2024-10-14 17:15:49,511 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:15:49,512 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 69 error locations. [2024-10-14 17:15:49,512 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:15:49,629 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 17:15:49,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 533 transitions, 1080 flow [2024-10-14 17:15:49,796 INFO L124 PetriNetUnfolderBase]: 29/531 cut-off events. [2024-10-14 17:15:49,796 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:15:49,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 531 events. 29/531 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1435 event pairs, 0 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 405. Up to 2 conditions per place. [2024-10-14 17:15:49,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 511 places, 533 transitions, 1080 flow [2024-10-14 17:15:49,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 493 places, 514 transitions, 1040 flow [2024-10-14 17:15:49,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:15:49,839 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;@1698a787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:15:49,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 132 error locations. [2024-10-14 17:15:49,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:15:49,842 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-10-14 17:15:49,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:15:49,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:49,843 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-10-14 17:15:49,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:49,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1713384665, now seen corresponding path program 1 times [2024-10-14 17:15:49,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:49,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198867002] [2024-10-14 17:15:49,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:49,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:49,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:49,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198867002] [2024-10-14 17:15:49,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198867002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:49,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:49,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:49,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282888482] [2024-10-14 17:15:49,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:50,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:50,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:50,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 533 [2024-10-14 17:15:50,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 514 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:50,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:50,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 533 [2024-10-14 17:15:50,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:50,141 INFO L124 PetriNetUnfolderBase]: 33/772 cut-off events. [2024-10-14 17:15:50,141 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-14 17:15:50,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 772 events. 33/772 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3509 event pairs, 9 based on Foata normal form. 17/641 useless extension candidates. Maximal degree in co-relation 683. Up to 36 conditions per place. [2024-10-14 17:15:50,149 INFO L140 encePairwiseOnDemand]: 516/533 looper letters, 12 selfloop transitions, 2 changer transitions 3/499 dead transitions. [2024-10-14 17:15:50,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 499 transitions, 1038 flow [2024-10-14 17:15:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1532 transitions. [2024-10-14 17:15:50,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9580988117573483 [2024-10-14 17:15:50,165 INFO L175 Difference]: Start difference. First operand has 493 places, 514 transitions, 1040 flow. Second operand 3 states and 1532 transitions. [2024-10-14 17:15:50,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 499 transitions, 1038 flow [2024-10-14 17:15:50,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 499 transitions, 1030 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 17:15:50,176 INFO L231 Difference]: Finished difference. Result has 490 places, 496 transitions, 1000 flow [2024-10-14 17:15:50,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1000, PETRI_PLACES=490, PETRI_TRANSITIONS=496} [2024-10-14 17:15:50,181 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -3 predicate places. [2024-10-14 17:15:50,181 INFO L471 AbstractCegarLoop]: Abstraction has has 490 places, 496 transitions, 1000 flow [2024-10-14 17:15:50,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:50,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:50,182 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-10-14 17:15:50,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:15:50,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:50,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:50,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2068894913, now seen corresponding path program 1 times [2024-10-14 17:15:50,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:50,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096104365] [2024-10-14 17:15:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:50,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:50,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096104365] [2024-10-14 17:15:50,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096104365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:50,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:50,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834349547] [2024-10-14 17:15:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:50,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:50,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 496 out of 533 [2024-10-14 17:15:50,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 496 transitions, 1000 flow. Second operand has 3 states, 3 states have (on average 497.3333333333333) internal successors, (1492), 3 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:50,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:50,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 496 of 533 [2024-10-14 17:15:50,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:50,422 INFO L124 PetriNetUnfolderBase]: 40/852 cut-off events. [2024-10-14 17:15:50,422 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2024-10-14 17:15:50,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 852 events. 40/852 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3724 event pairs, 15 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 881. Up to 48 conditions per place. [2024-10-14 17:15:50,430 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 17 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2024-10-14 17:15:50,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 495 transitions, 1036 flow [2024-10-14 17:15:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1508 transitions. [2024-10-14 17:15:50,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943089430894309 [2024-10-14 17:15:50,435 INFO L175 Difference]: Start difference. First operand has 490 places, 496 transitions, 1000 flow. Second operand 3 states and 1508 transitions. [2024-10-14 17:15:50,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 495 transitions, 1036 flow [2024-10-14 17:15:50,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 495 transitions, 1032 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:50,445 INFO L231 Difference]: Finished difference. Result has 486 places, 495 transitions, 998 flow [2024-10-14 17:15:50,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=998, PETRI_PLACES=486, PETRI_TRANSITIONS=495} [2024-10-14 17:15:50,446 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -7 predicate places. [2024-10-14 17:15:50,446 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 495 transitions, 998 flow [2024-10-14 17:15:50,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 497.3333333333333) internal successors, (1492), 3 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:50,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:50,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:50,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:15:50,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:50,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash -124676391, now seen corresponding path program 1 times [2024-10-14 17:15:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:50,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939593155] [2024-10-14 17:15:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:50,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:50,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939593155] [2024-10-14 17:15:50,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939593155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:50,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:50,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388573168] [2024-10-14 17:15:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:50,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:50,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:50,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:50,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 533 [2024-10-14 17:15:50,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 495 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:50,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:50,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 533 [2024-10-14 17:15:50,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:50,754 INFO L124 PetriNetUnfolderBase]: 142/1933 cut-off events. [2024-10-14 17:15:50,754 INFO L125 PetriNetUnfolderBase]: For 33/34 co-relation queries the response was YES. [2024-10-14 17:15:50,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1933 events. 142/1933 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 12016 event pairs, 44 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 2064. Up to 157 conditions per place. [2024-10-14 17:15:50,766 INFO L140 encePairwiseOnDemand]: 522/533 looper letters, 24 selfloop transitions, 1 changer transitions 0/485 dead transitions. [2024-10-14 17:15:50,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 485 transitions, 1028 flow [2024-10-14 17:15:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2024-10-14 17:15:50,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9262038774233896 [2024-10-14 17:15:50,770 INFO L175 Difference]: Start difference. First operand has 486 places, 495 transitions, 998 flow. Second operand 3 states and 1481 transitions. [2024-10-14 17:15:50,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 485 transitions, 1028 flow [2024-10-14 17:15:50,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 485 transitions, 1024 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:50,775 INFO L231 Difference]: Finished difference. Result has 476 places, 485 transitions, 976 flow [2024-10-14 17:15:50,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=976, PETRI_PLACES=476, PETRI_TRANSITIONS=485} [2024-10-14 17:15:50,777 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -17 predicate places. [2024-10-14 17:15:50,777 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 485 transitions, 976 flow [2024-10-14 17:15:50,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:50,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:50,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] [2024-10-14 17:15:50,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:15:50,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:50,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash -192862412, now seen corresponding path program 1 times [2024-10-14 17:15:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033849567] [2024-10-14 17:15:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:50,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033849567] [2024-10-14 17:15:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033849567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:50,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937580264] [2024-10-14 17:15:50,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:50,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:50,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:50,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:50,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:50,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 533 [2024-10-14 17:15:50,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 485 transitions, 976 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:50,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:50,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 533 [2024-10-14 17:15:50,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:50,985 INFO L124 PetriNetUnfolderBase]: 40/834 cut-off events. [2024-10-14 17:15:50,985 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2024-10-14 17:15:50,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 834 events. 40/834 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3589 event pairs, 15 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 852. Up to 46 conditions per place. [2024-10-14 17:15:50,993 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 15 selfloop transitions, 2 changer transitions 0/484 dead transitions. [2024-10-14 17:15:50,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 484 transitions, 1008 flow [2024-10-14 17:15:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1512 transitions. [2024-10-14 17:15:50,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9455909943714822 [2024-10-14 17:15:50,996 INFO L175 Difference]: Start difference. First operand has 476 places, 485 transitions, 976 flow. Second operand 3 states and 1512 transitions. [2024-10-14 17:15:50,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 484 transitions, 1008 flow [2024-10-14 17:15:50,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 484 transitions, 1007 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:51,002 INFO L231 Difference]: Finished difference. Result has 476 places, 484 transitions, 977 flow [2024-10-14 17:15:51,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=977, PETRI_PLACES=476, PETRI_TRANSITIONS=484} [2024-10-14 17:15:51,003 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -17 predicate places. [2024-10-14 17:15:51,003 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 484 transitions, 977 flow [2024-10-14 17:15:51,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:51,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:51,004 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-10-14 17:15:51,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:15:51,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:51,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:51,005 INFO L85 PathProgramCache]: Analyzing trace with hash 730818760, now seen corresponding path program 1 times [2024-10-14 17:15:51,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:51,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283883891] [2024-10-14 17:15:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:51,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:51,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283883891] [2024-10-14 17:15:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283883891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:51,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:51,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104237836] [2024-10-14 17:15:51,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:51,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:51,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 467 out of 533 [2024-10-14 17:15:51,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 484 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 468.5) internal successors, (2811), 6 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:51,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:51,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 467 of 533 [2024-10-14 17:15:51,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:51,853 INFO L124 PetriNetUnfolderBase]: 289/2555 cut-off events. [2024-10-14 17:15:51,853 INFO L125 PetriNetUnfolderBase]: For 60/61 co-relation queries the response was YES. [2024-10-14 17:15:51,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 2555 events. 289/2555 cut-off events. For 60/61 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17211 event pairs, 144 based on Foata normal form. 0/2068 useless extension candidates. Maximal degree in co-relation 2944. Up to 408 conditions per place. [2024-10-14 17:15:51,871 INFO L140 encePairwiseOnDemand]: 527/533 looper letters, 44 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2024-10-14 17:15:51,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 483 transitions, 1073 flow [2024-10-14 17:15:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2852 transitions. [2024-10-14 17:15:51,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8918073796122576 [2024-10-14 17:15:51,876 INFO L175 Difference]: Start difference. First operand has 476 places, 484 transitions, 977 flow. Second operand 6 states and 2852 transitions. [2024-10-14 17:15:51,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 483 transitions, 1073 flow [2024-10-14 17:15:51,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 483 transitions, 1069 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:51,881 INFO L231 Difference]: Finished difference. Result has 478 places, 483 transitions, 981 flow [2024-10-14 17:15:51,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=478, PETRI_TRANSITIONS=483} [2024-10-14 17:15:51,883 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -15 predicate places. [2024-10-14 17:15:51,884 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 483 transitions, 981 flow [2024-10-14 17:15:51,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 468.5) internal successors, (2811), 6 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:51,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:51,886 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:51,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:15:51,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:51,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:51,888 INFO L85 PathProgramCache]: Analyzing trace with hash 448766638, now seen corresponding path program 1 times [2024-10-14 17:15:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044536410] [2024-10-14 17:15:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:51,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044536410] [2024-10-14 17:15:51,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044536410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:51,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:51,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:51,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957494362] [2024-10-14 17:15:51,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:51,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:51,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:51,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:51,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 533 [2024-10-14 17:15:51,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 483 transitions, 981 flow. Second operand has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:51,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:51,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 533 [2024-10-14 17:15:51,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:52,085 INFO L124 PetriNetUnfolderBase]: 84/1574 cut-off events. [2024-10-14 17:15:52,086 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-14 17:15:52,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 1574 events. 84/1574 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9500 event pairs, 17 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1649. Up to 77 conditions per place. [2024-10-14 17:15:52,093 INFO L140 encePairwiseOnDemand]: 526/533 looper letters, 16 selfloop transitions, 2 changer transitions 0/481 dead transitions. [2024-10-14 17:15:52,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 481 transitions, 1014 flow [2024-10-14 17:15:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1514 transitions. [2024-10-14 17:15:52,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468417761100688 [2024-10-14 17:15:52,096 INFO L175 Difference]: Start difference. First operand has 478 places, 483 transitions, 981 flow. Second operand 3 states and 1514 transitions. [2024-10-14 17:15:52,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 481 transitions, 1014 flow [2024-10-14 17:15:52,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 481 transitions, 1004 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:15:52,105 INFO L231 Difference]: Finished difference. Result has 471 places, 480 transitions, 975 flow [2024-10-14 17:15:52,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=471, PETRI_TRANSITIONS=480} [2024-10-14 17:15:52,107 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -22 predicate places. [2024-10-14 17:15:52,107 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 480 transitions, 975 flow [2024-10-14 17:15:52,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:52,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:52,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:52,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:15:52,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:52,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1025065285, now seen corresponding path program 1 times [2024-10-14 17:15:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:52,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467641233] [2024-10-14 17:15:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467641233] [2024-10-14 17:15:52,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467641233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:52,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:52,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:52,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217373142] [2024-10-14 17:15:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:52,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:52,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:52,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:52,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 533 [2024-10-14 17:15:52,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 480 transitions, 975 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:52,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:52,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 533 [2024-10-14 17:15:52,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:52,287 INFO L124 PetriNetUnfolderBase]: 46/1161 cut-off events. [2024-10-14 17:15:52,288 INFO L125 PetriNetUnfolderBase]: For 2/8 co-relation queries the response was YES. [2024-10-14 17:15:52,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 1161 events. 46/1161 cut-off events. For 2/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5445 event pairs, 1 based on Foata normal form. 1/971 useless extension candidates. Maximal degree in co-relation 1177. Up to 20 conditions per place. [2024-10-14 17:15:52,296 INFO L140 encePairwiseOnDemand]: 526/533 looper letters, 11 selfloop transitions, 3 changer transitions 0/477 dead transitions. [2024-10-14 17:15:52,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 477 transitions, 998 flow [2024-10-14 17:15:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2024-10-14 17:15:52,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.949343339587242 [2024-10-14 17:15:52,299 INFO L175 Difference]: Start difference. First operand has 471 places, 480 transitions, 975 flow. Second operand 3 states and 1518 transitions. [2024-10-14 17:15:52,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 477 transitions, 998 flow [2024-10-14 17:15:52,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 477 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:52,305 INFO L231 Difference]: Finished difference. Result has 469 places, 476 transitions, 973 flow [2024-10-14 17:15:52,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=973, PETRI_PLACES=469, PETRI_TRANSITIONS=476} [2024-10-14 17:15:52,306 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -24 predicate places. [2024-10-14 17:15:52,306 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 476 transitions, 973 flow [2024-10-14 17:15:52,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:52,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:52,308 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:52,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:15:52,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:52,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash 305103512, now seen corresponding path program 1 times [2024-10-14 17:15:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:52,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183652223] [2024-10-14 17:15:52,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:52,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:52,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183652223] [2024-10-14 17:15:52,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183652223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:52,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611439366] [2024-10-14 17:15:52,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:52,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:52,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:52,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:52,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:52,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 533 [2024-10-14 17:15:52,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 476 transitions, 973 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:52,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:52,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 533 [2024-10-14 17:15:52,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:52,645 INFO L124 PetriNetUnfolderBase]: 83/1035 cut-off events. [2024-10-14 17:15:52,645 INFO L125 PetriNetUnfolderBase]: For 51/52 co-relation queries the response was YES. [2024-10-14 17:15:52,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 1035 events. 83/1035 cut-off events. For 51/52 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5395 event pairs, 7 based on Foata normal form. 1/919 useless extension candidates. Maximal degree in co-relation 1220. Up to 169 conditions per place. [2024-10-14 17:15:52,651 INFO L140 encePairwiseOnDemand]: 496/533 looper letters, 39 selfloop transitions, 14 changer transitions 4/455 dead transitions. [2024-10-14 17:15:52,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 455 transitions, 1042 flow [2024-10-14 17:15:52,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2024-10-14 17:15:52,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8736710444027517 [2024-10-14 17:15:52,654 INFO L175 Difference]: Start difference. First operand has 469 places, 476 transitions, 973 flow. Second operand 3 states and 1397 transitions. [2024-10-14 17:15:52,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 455 transitions, 1042 flow [2024-10-14 17:15:52,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 455 transitions, 1036 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:52,661 INFO L231 Difference]: Finished difference. Result has 447 places, 450 transitions, 942 flow [2024-10-14 17:15:52,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=942, PETRI_PLACES=447, PETRI_TRANSITIONS=450} [2024-10-14 17:15:52,664 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -46 predicate places. [2024-10-14 17:15:52,664 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 450 transitions, 942 flow [2024-10-14 17:15:52,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:52,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:52,666 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-10-14 17:15:52,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:15:52,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash -800036421, now seen corresponding path program 1 times [2024-10-14 17:15:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350112677] [2024-10-14 17:15:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:52,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:52,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350112677] [2024-10-14 17:15:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350112677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:52,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888090438] [2024-10-14 17:15:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:52,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:52,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:52,733 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 488 out of 533 [2024-10-14 17:15:52,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 450 transitions, 942 flow. Second operand has 3 states, 3 states have (on average 489.3333333333333) internal successors, (1468), 3 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:52,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:52,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 488 of 533 [2024-10-14 17:15:52,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:52,870 INFO L124 PetriNetUnfolderBase]: 139/2007 cut-off events. [2024-10-14 17:15:52,870 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-14 17:15:52,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 2007 events. 139/2007 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 12672 event pairs, 15 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2226. Up to 143 conditions per place. [2024-10-14 17:15:52,882 INFO L140 encePairwiseOnDemand]: 520/533 looper letters, 22 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2024-10-14 17:15:52,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 449 transitions, 996 flow [2024-10-14 17:15:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1499 transitions. [2024-10-14 17:15:52,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9374609130706691 [2024-10-14 17:15:52,885 INFO L175 Difference]: Start difference. First operand has 447 places, 450 transitions, 942 flow. Second operand 3 states and 1499 transitions. [2024-10-14 17:15:52,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 449 transitions, 996 flow [2024-10-14 17:15:52,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 449 transitions, 968 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:52,892 INFO L231 Difference]: Finished difference. Result has 436 places, 447 transitions, 933 flow [2024-10-14 17:15:52,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=436, PETRI_TRANSITIONS=447} [2024-10-14 17:15:52,894 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -57 predicate places. [2024-10-14 17:15:52,894 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 447 transitions, 933 flow [2024-10-14 17:15:52,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 489.3333333333333) internal successors, (1468), 3 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:52,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:52,895 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:52,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:15:52,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:52,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1892174689, now seen corresponding path program 1 times [2024-10-14 17:15:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:52,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212382664] [2024-10-14 17:15:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:52,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:52,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212382664] [2024-10-14 17:15:52,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212382664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:52,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:52,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:15:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942849751] [2024-10-14 17:15:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:52,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:15:52,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:52,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:15:52,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:15:53,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 533 [2024-10-14 17:15:53,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 447 transitions, 933 flow. Second operand has 4 states, 4 states have (on average 507.25) internal successors, (2029), 4 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:53,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:53,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 533 [2024-10-14 17:15:53,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:53,214 INFO L124 PetriNetUnfolderBase]: 127/2483 cut-off events. [2024-10-14 17:15:53,214 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:15:53,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 2483 events. 127/2483 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 16436 event pairs, 7 based on Foata normal form. 0/2213 useless extension candidates. Maximal degree in co-relation 2602. Up to 59 conditions per place. [2024-10-14 17:15:53,228 INFO L140 encePairwiseOnDemand]: 527/533 looper letters, 13 selfloop transitions, 6 changer transitions 0/456 dead transitions. [2024-10-14 17:15:53,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 456 transitions, 993 flow [2024-10-14 17:15:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:15:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 17:15:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2550 transitions. [2024-10-14 17:15:53,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9568480300187617 [2024-10-14 17:15:53,232 INFO L175 Difference]: Start difference. First operand has 436 places, 447 transitions, 933 flow. Second operand 5 states and 2550 transitions. [2024-10-14 17:15:53,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 456 transitions, 993 flow [2024-10-14 17:15:53,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 456 transitions, 993 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:53,238 INFO L231 Difference]: Finished difference. Result has 443 places, 451 transitions, 971 flow [2024-10-14 17:15:53,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=971, PETRI_PLACES=443, PETRI_TRANSITIONS=451} [2024-10-14 17:15:53,239 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -50 predicate places. [2024-10-14 17:15:53,240 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 451 transitions, 971 flow [2024-10-14 17:15:53,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 507.25) internal successors, (2029), 4 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:53,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:53,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:53,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:15:53,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:53,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash -420815802, now seen corresponding path program 1 times [2024-10-14 17:15:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056419413] [2024-10-14 17:15:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:53,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-10-14 17:15:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056419413] [2024-10-14 17:15:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056419413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:53,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:53,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:53,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887717624] [2024-10-14 17:15:53,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:53,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:53,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:53,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:53,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:53,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 533 [2024-10-14 17:15:53,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 451 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 500.5) internal successors, (3003), 6 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:53,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:53,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 533 [2024-10-14 17:15:53,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:54,106 INFO L124 PetriNetUnfolderBase]: 102/1913 cut-off events. [2024-10-14 17:15:54,106 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-14 17:15:54,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 1913 events. 102/1913 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11497 event pairs, 6 based on Foata normal form. 0/1717 useless extension candidates. Maximal degree in co-relation 2053. Up to 46 conditions per place. [2024-10-14 17:15:54,119 INFO L140 encePairwiseOnDemand]: 527/533 looper letters, 15 selfloop transitions, 6 changer transitions 0/454 dead transitions. [2024-10-14 17:15:54,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 454 transitions, 1023 flow [2024-10-14 17:15:54,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3015 transitions. [2024-10-14 17:15:54,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427767354596623 [2024-10-14 17:15:54,124 INFO L175 Difference]: Start difference. First operand has 443 places, 451 transitions, 971 flow. Second operand 6 states and 3015 transitions. [2024-10-14 17:15:54,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 454 transitions, 1023 flow [2024-10-14 17:15:54,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 454 transitions, 1023 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:54,130 INFO L231 Difference]: Finished difference. Result has 447 places, 450 transitions, 981 flow [2024-10-14 17:15:54,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=447, PETRI_TRANSITIONS=450} [2024-10-14 17:15:54,131 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -46 predicate places. [2024-10-14 17:15:54,131 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 450 transitions, 981 flow [2024-10-14 17:15:54,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 500.5) internal successors, (3003), 6 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:54,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:54,133 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:54,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:15:54,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:54,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash 560285647, now seen corresponding path program 1 times [2024-10-14 17:15:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:54,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971885280] [2024-10-14 17:15:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:54,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:54,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971885280] [2024-10-14 17:15:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971885280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:54,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:54,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:15:54,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875685023] [2024-10-14 17:15:54,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:54,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:15:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:54,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:15:54,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:15:54,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 533 [2024-10-14 17:15:54,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 450 transitions, 981 flow. Second operand has 4 states, 4 states have (on average 501.5) internal successors, (2006), 4 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:54,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:54,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 533 [2024-10-14 17:15:54,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:54,643 INFO L124 PetriNetUnfolderBase]: 155/2631 cut-off events. [2024-10-14 17:15:54,643 INFO L125 PetriNetUnfolderBase]: For 48/49 co-relation queries the response was YES. [2024-10-14 17:15:54,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 2631 events. 155/2631 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 16728 event pairs, 14 based on Foata normal form. 0/2357 useless extension candidates. Maximal degree in co-relation 2924. Up to 111 conditions per place. [2024-10-14 17:15:54,661 INFO L140 encePairwiseOnDemand]: 524/533 looper letters, 18 selfloop transitions, 9 changer transitions 0/461 dead transitions. [2024-10-14 17:15:54,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 461 transitions, 1060 flow [2024-10-14 17:15:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:15:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 17:15:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2528 transitions. [2024-10-14 17:15:54,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.94859287054409 [2024-10-14 17:15:54,665 INFO L175 Difference]: Start difference. First operand has 447 places, 450 transitions, 981 flow. Second operand 5 states and 2528 transitions. [2024-10-14 17:15:54,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 461 transitions, 1060 flow [2024-10-14 17:15:54,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 461 transitions, 1048 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:15:54,673 INFO L231 Difference]: Finished difference. Result has 449 places, 457 transitions, 1031 flow [2024-10-14 17:15:54,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1031, PETRI_PLACES=449, PETRI_TRANSITIONS=457} [2024-10-14 17:15:54,674 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -44 predicate places. [2024-10-14 17:15:54,675 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 457 transitions, 1031 flow [2024-10-14 17:15:54,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 501.5) internal successors, (2006), 4 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:54,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:54,676 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:54,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:15:54,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:54,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2075711415, now seen corresponding path program 1 times [2024-10-14 17:15:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:54,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189390579] [2024-10-14 17:15:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:54,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:54,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:54,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189390579] [2024-10-14 17:15:54,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189390579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:54,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:54,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:54,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163445721] [2024-10-14 17:15:54,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:54,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:54,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:54,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:54,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:54,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 533 [2024-10-14 17:15:54,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 457 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:54,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:54,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 533 [2024-10-14 17:15:54,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:55,033 INFO L124 PetriNetUnfolderBase]: 176/3706 cut-off events. [2024-10-14 17:15:55,033 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-14 17:15:55,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4114 conditions, 3706 events. 176/3706 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 27702 event pairs, 18 based on Foata normal form. 0/3331 useless extension candidates. Maximal degree in co-relation 4068. Up to 91 conditions per place. [2024-10-14 17:15:55,050 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 9 selfloop transitions, 2 changer transitions 0/457 dead transitions. [2024-10-14 17:15:55,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 457 transitions, 1054 flow [2024-10-14 17:15:55,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1524 transitions. [2024-10-14 17:15:55,053 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530956848030019 [2024-10-14 17:15:55,053 INFO L175 Difference]: Start difference. First operand has 449 places, 457 transitions, 1031 flow. Second operand 3 states and 1524 transitions. [2024-10-14 17:15:55,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 457 transitions, 1054 flow [2024-10-14 17:15:55,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 457 transitions, 1054 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:55,059 INFO L231 Difference]: Finished difference. Result has 450 places, 456 transitions, 1033 flow [2024-10-14 17:15:55,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=450, PETRI_TRANSITIONS=456} [2024-10-14 17:15:55,060 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -43 predicate places. [2024-10-14 17:15:55,060 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 456 transitions, 1033 flow [2024-10-14 17:15:55,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:55,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:55,061 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:55,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:15:55,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:55,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:55,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1076224993, now seen corresponding path program 1 times [2024-10-14 17:15:55,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:55,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715119779] [2024-10-14 17:15:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:55,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:55,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715119779] [2024-10-14 17:15:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715119779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:55,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:15:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595909380] [2024-10-14 17:15:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:55,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:15:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:55,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:15:55,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:15:55,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 533 [2024-10-14 17:15:55,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 456 transitions, 1033 flow. Second operand has 4 states, 4 states have (on average 501.5) internal successors, (2006), 4 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:55,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:55,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 533 [2024-10-14 17:15:55,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:55,507 INFO L124 PetriNetUnfolderBase]: 152/2619 cut-off events. [2024-10-14 17:15:55,508 INFO L125 PetriNetUnfolderBase]: For 148/149 co-relation queries the response was YES. [2024-10-14 17:15:55,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 2619 events. 152/2619 cut-off events. For 148/149 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 16617 event pairs, 14 based on Foata normal form. 0/2363 useless extension candidates. Maximal degree in co-relation 2997. Up to 111 conditions per place. [2024-10-14 17:15:55,521 INFO L140 encePairwiseOnDemand]: 524/533 looper letters, 18 selfloop transitions, 9 changer transitions 0/463 dead transitions. [2024-10-14 17:15:55,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 463 transitions, 1104 flow [2024-10-14 17:15:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:15:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 17:15:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2528 transitions. [2024-10-14 17:15:55,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.94859287054409 [2024-10-14 17:15:55,525 INFO L175 Difference]: Start difference. First operand has 450 places, 456 transitions, 1033 flow. Second operand 5 states and 2528 transitions. [2024-10-14 17:15:55,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 463 transitions, 1104 flow [2024-10-14 17:15:55,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 463 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:55,530 INFO L231 Difference]: Finished difference. Result has 455 places, 459 transitions, 1075 flow [2024-10-14 17:15:55,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1075, PETRI_PLACES=455, PETRI_TRANSITIONS=459} [2024-10-14 17:15:55,531 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -38 predicate places. [2024-10-14 17:15:55,531 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 459 transitions, 1075 flow [2024-10-14 17:15:55,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 501.5) internal successors, (2006), 4 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:55,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:55,533 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-10-14 17:15:55,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:15:55,533 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:55,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1188871015, now seen corresponding path program 1 times [2024-10-14 17:15:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:55,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676885550] [2024-10-14 17:15:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:55,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676885550] [2024-10-14 17:15:55,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676885550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:55,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:55,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102148297] [2024-10-14 17:15:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:55,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:56,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 533 [2024-10-14 17:15:56,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 459 transitions, 1075 flow. Second operand has 6 states, 6 states have (on average 458.6666666666667) internal successors, (2752), 6 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:56,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:56,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 533 [2024-10-14 17:15:56,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:56,282 INFO L124 PetriNetUnfolderBase]: 226/2195 cut-off events. [2024-10-14 17:15:56,283 INFO L125 PetriNetUnfolderBase]: For 305/306 co-relation queries the response was YES. [2024-10-14 17:15:56,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 2195 events. 226/2195 cut-off events. For 305/306 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 13277 event pairs, 24 based on Foata normal form. 0/2037 useless extension candidates. Maximal degree in co-relation 2997. Up to 176 conditions per place. [2024-10-14 17:15:56,299 INFO L140 encePairwiseOnDemand]: 491/533 looper letters, 21 selfloop transitions, 39 changer transitions 0/456 dead transitions. [2024-10-14 17:15:56,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 456 transitions, 1193 flow [2024-10-14 17:15:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2805 transitions. [2024-10-14 17:15:56,304 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8771106941838649 [2024-10-14 17:15:56,304 INFO L175 Difference]: Start difference. First operand has 455 places, 459 transitions, 1075 flow. Second operand 6 states and 2805 transitions. [2024-10-14 17:15:56,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 456 transitions, 1193 flow [2024-10-14 17:15:56,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 456 transitions, 1193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:56,310 INFO L231 Difference]: Finished difference. Result has 453 places, 452 transitions, 1139 flow [2024-10-14 17:15:56,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1139, PETRI_PLACES=453, PETRI_TRANSITIONS=452} [2024-10-14 17:15:56,311 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -40 predicate places. [2024-10-14 17:15:56,311 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 452 transitions, 1139 flow [2024-10-14 17:15:56,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 458.6666666666667) internal successors, (2752), 6 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:56,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:56,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:56,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:15:56,312 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:56,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:56,313 INFO L85 PathProgramCache]: Analyzing trace with hash -867347854, now seen corresponding path program 1 times [2024-10-14 17:15:56,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:56,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163908602] [2024-10-14 17:15:56,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:56,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:56,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163908602] [2024-10-14 17:15:56,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163908602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:56,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:56,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:56,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903691703] [2024-10-14 17:15:56,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:56,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:56,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:56,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:56,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 533 [2024-10-14 17:15:56,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 452 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:56,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:56,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 533 [2024-10-14 17:15:56,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:56,708 INFO L124 PetriNetUnfolderBase]: 198/2493 cut-off events. [2024-10-14 17:15:56,708 INFO L125 PetriNetUnfolderBase]: For 315/316 co-relation queries the response was YES. [2024-10-14 17:15:56,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 2493 events. 198/2493 cut-off events. For 315/316 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 15793 event pairs, 92 based on Foata normal form. 0/2302 useless extension candidates. Maximal degree in co-relation 3388. Up to 332 conditions per place. [2024-10-14 17:15:56,724 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 33 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2024-10-14 17:15:56,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1210 flow [2024-10-14 17:15:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2024-10-14 17:15:56,728 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-10-14 17:15:56,728 INFO L175 Difference]: Start difference. First operand has 453 places, 452 transitions, 1139 flow. Second operand 3 states and 1476 transitions. [2024-10-14 17:15:56,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1210 flow [2024-10-14 17:15:56,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 452 transitions, 1132 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:15:56,735 INFO L231 Difference]: Finished difference. Result has 449 places, 451 transitions, 1063 flow [2024-10-14 17:15:56,735 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1063, PETRI_PLACES=449, PETRI_TRANSITIONS=451} [2024-10-14 17:15:56,736 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -44 predicate places. [2024-10-14 17:15:56,736 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 451 transitions, 1063 flow [2024-10-14 17:15:56,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:56,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:56,738 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] [2024-10-14 17:15:56,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:15:56,738 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err44ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:56,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1963899716, now seen corresponding path program 1 times [2024-10-14 17:15:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:56,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915426218] [2024-10-14 17:15:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:56,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:56,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:56,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915426218] [2024-10-14 17:15:56,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915426218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:56,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:56,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:56,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092055743] [2024-10-14 17:15:56,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:56,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:56,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:56,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:56,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:56,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 533 [2024-10-14 17:15:56,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 451 transitions, 1063 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:56,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:56,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 533 [2024-10-14 17:15:56,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:57,077 INFO L124 PetriNetUnfolderBase]: 193/2380 cut-off events. [2024-10-14 17:15:57,077 INFO L125 PetriNetUnfolderBase]: For 231/232 co-relation queries the response was YES. [2024-10-14 17:15:57,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3049 conditions, 2380 events. 193/2380 cut-off events. For 231/232 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14899 event pairs, 92 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 2997. Up to 329 conditions per place. [2024-10-14 17:15:57,095 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 33 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2024-10-14 17:15:57,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 1134 flow [2024-10-14 17:15:57,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2024-10-14 17:15:57,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-10-14 17:15:57,097 INFO L175 Difference]: Start difference. First operand has 449 places, 451 transitions, 1063 flow. Second operand 3 states and 1476 transitions. [2024-10-14 17:15:57,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 1134 flow [2024-10-14 17:15:57,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:57,103 INFO L231 Difference]: Finished difference. Result has 448 places, 450 transitions, 1061 flow [2024-10-14 17:15:57,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=448, PETRI_TRANSITIONS=450} [2024-10-14 17:15:57,104 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -45 predicate places. [2024-10-14 17:15:57,104 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 450 transitions, 1061 flow [2024-10-14 17:15:57,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:57,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:57,105 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-10-14 17:15:57,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:15:57,105 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:57,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash 913799717, now seen corresponding path program 1 times [2024-10-14 17:15:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190756640] [2024-10-14 17:15:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:57,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:57,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190756640] [2024-10-14 17:15:57,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190756640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:57,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:57,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:57,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468187405] [2024-10-14 17:15:57,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:57,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:57,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:57,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:57,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 533 [2024-10-14 17:15:57,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 450 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:57,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:57,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 533 [2024-10-14 17:15:57,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:57,413 INFO L124 PetriNetUnfolderBase]: 194/2380 cut-off events. [2024-10-14 17:15:57,413 INFO L125 PetriNetUnfolderBase]: For 233/234 co-relation queries the response was YES. [2024-10-14 17:15:57,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3051 conditions, 2380 events. 194/2380 cut-off events. For 233/234 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14952 event pairs, 92 based on Foata normal form. 0/2200 useless extension candidates. Maximal degree in co-relation 2999. Up to 330 conditions per place. [2024-10-14 17:15:57,424 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 33 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2024-10-14 17:15:57,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 450 transitions, 1132 flow [2024-10-14 17:15:57,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2024-10-14 17:15:57,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-10-14 17:15:57,427 INFO L175 Difference]: Start difference. First operand has 448 places, 450 transitions, 1061 flow. Second operand 3 states and 1476 transitions. [2024-10-14 17:15:57,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 450 transitions, 1132 flow [2024-10-14 17:15:57,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 450 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:57,432 INFO L231 Difference]: Finished difference. Result has 447 places, 449 transitions, 1059 flow [2024-10-14 17:15:57,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=447, PETRI_TRANSITIONS=449} [2024-10-14 17:15:57,433 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -46 predicate places. [2024-10-14 17:15:57,433 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 449 transitions, 1059 flow [2024-10-14 17:15:57,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:57,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:57,434 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] [2024-10-14 17:15:57,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:15:57,434 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err52ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:57,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1108970903, now seen corresponding path program 1 times [2024-10-14 17:15:57,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:57,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006431959] [2024-10-14 17:15:57,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:57,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006431959] [2024-10-14 17:15:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006431959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:57,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033448496] [2024-10-14 17:15:57,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:57,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:57,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 533 [2024-10-14 17:15:57,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 449 transitions, 1059 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:57,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:57,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 533 [2024-10-14 17:15:57,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:57,730 INFO L124 PetriNetUnfolderBase]: 190/2313 cut-off events. [2024-10-14 17:15:57,731 INFO L125 PetriNetUnfolderBase]: For 232/233 co-relation queries the response was YES. [2024-10-14 17:15:57,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2977 conditions, 2313 events. 190/2313 cut-off events. For 232/233 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14296 event pairs, 92 based on Foata normal form. 0/2139 useless extension candidates. Maximal degree in co-relation 2925. Up to 328 conditions per place. [2024-10-14 17:15:57,746 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 32 selfloop transitions, 2 changer transitions 1/449 dead transitions. [2024-10-14 17:15:57,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 449 transitions, 1130 flow [2024-10-14 17:15:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2024-10-14 17:15:57,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-10-14 17:15:57,748 INFO L175 Difference]: Start difference. First operand has 447 places, 449 transitions, 1059 flow. Second operand 3 states and 1476 transitions. [2024-10-14 17:15:57,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 449 transitions, 1130 flow [2024-10-14 17:15:57,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 449 transitions, 1126 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:57,754 INFO L231 Difference]: Finished difference. Result has 446 places, 448 transitions, 1057 flow [2024-10-14 17:15:57,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=446, PETRI_TRANSITIONS=448} [2024-10-14 17:15:57,755 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -47 predicate places. [2024-10-14 17:15:57,755 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 448 transitions, 1057 flow [2024-10-14 17:15:57,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:57,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:57,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:57,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:15:57,757 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:57,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 889422746, now seen corresponding path program 1 times [2024-10-14 17:15:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382770206] [2024-10-14 17:15:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382770206] [2024-10-14 17:15:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382770206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:57,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:57,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:57,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265680793] [2024-10-14 17:15:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:57,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:57,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:57,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:57,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 533 [2024-10-14 17:15:57,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 448 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:57,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:57,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 533 [2024-10-14 17:15:57,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:58,102 INFO L124 PetriNetUnfolderBase]: 197/2443 cut-off events. [2024-10-14 17:15:58,102 INFO L125 PetriNetUnfolderBase]: For 233/234 co-relation queries the response was YES. [2024-10-14 17:15:58,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 2443 events. 197/2443 cut-off events. For 233/234 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 15206 event pairs, 92 based on Foata normal form. 0/2270 useless extension candidates. Maximal degree in co-relation 3073. Up to 332 conditions per place. [2024-10-14 17:15:58,117 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 33 selfloop transitions, 2 changer transitions 0/448 dead transitions. [2024-10-14 17:15:58,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 448 transitions, 1128 flow [2024-10-14 17:15:58,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2024-10-14 17:15:58,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-10-14 17:15:58,119 INFO L175 Difference]: Start difference. First operand has 446 places, 448 transitions, 1057 flow. Second operand 3 states and 1476 transitions. [2024-10-14 17:15:58,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 448 transitions, 1128 flow [2024-10-14 17:15:58,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 448 transitions, 1124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:58,125 INFO L231 Difference]: Finished difference. Result has 445 places, 447 transitions, 1055 flow [2024-10-14 17:15:58,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1055, PETRI_PLACES=445, PETRI_TRANSITIONS=447} [2024-10-14 17:15:58,126 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -48 predicate places. [2024-10-14 17:15:58,126 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 447 transitions, 1055 flow [2024-10-14 17:15:58,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:58,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:58,126 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:58,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:15:58,126 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:58,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash 39305617, now seen corresponding path program 1 times [2024-10-14 17:15:58,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:58,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113022935] [2024-10-14 17:15:58,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:58,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113022935] [2024-10-14 17:15:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113022935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:58,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:58,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766953465] [2024-10-14 17:15:58,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:58,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:58,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:58,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:58,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 533 [2024-10-14 17:15:58,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 447 transitions, 1055 flow. Second operand has 3 states, 3 states have (on average 484.6666666666667) internal successors, (1454), 3 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:58,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:58,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 533 [2024-10-14 17:15:58,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:58,452 INFO L124 PetriNetUnfolderBase]: 196/2404 cut-off events. [2024-10-14 17:15:58,452 INFO L125 PetriNetUnfolderBase]: For 233/234 co-relation queries the response was YES. [2024-10-14 17:15:58,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3087 conditions, 2404 events. 196/2404 cut-off events. For 233/234 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 14985 event pairs, 92 based on Foata normal form. 0/2237 useless extension candidates. Maximal degree in co-relation 3035. Up to 332 conditions per place. [2024-10-14 17:15:58,466 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 33 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2024-10-14 17:15:58,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 447 transitions, 1126 flow [2024-10-14 17:15:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2024-10-14 17:15:58,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-10-14 17:15:58,468 INFO L175 Difference]: Start difference. First operand has 445 places, 447 transitions, 1055 flow. Second operand 3 states and 1476 transitions. [2024-10-14 17:15:58,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 447 transitions, 1126 flow [2024-10-14 17:15:58,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 447 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:58,474 INFO L231 Difference]: Finished difference. Result has 444 places, 446 transitions, 1053 flow [2024-10-14 17:15:58,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=444, PETRI_TRANSITIONS=446} [2024-10-14 17:15:58,475 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -49 predicate places. [2024-10-14 17:15:58,475 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 446 transitions, 1053 flow [2024-10-14 17:15:58,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 484.6666666666667) internal successors, (1454), 3 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:58,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:58,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:58,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:15:58,476 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2024-10-14 17:15:58,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash 140091816, now seen corresponding path program 1 times [2024-10-14 17:15:58,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:58,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099234375] [2024-10-14 17:15:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:58,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099234375] [2024-10-14 17:15:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099234375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:58,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:58,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:58,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446583559] [2024-10-14 17:15:58,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:58,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:58,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:58,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:58,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 533 [2024-10-14 17:15:58,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 446 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:58,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:58,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 533 [2024-10-14 17:15:58,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:58,793 INFO L124 PetriNetUnfolderBase]: 195/2365 cut-off events. [2024-10-14 17:15:58,794 INFO L125 PetriNetUnfolderBase]: For 233/234 co-relation queries the response was YES. [2024-10-14 17:15:58,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 2365 events. 195/2365 cut-off events. For 233/234 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 14634 event pairs, 92 based on Foata normal form. 0/2204 useless extension candidates. Maximal degree in co-relation 2996. Up to 332 conditions per place. [2024-10-14 17:15:58,806 INFO L140 encePairwiseOnDemand]: 530/533 looper letters, 0 selfloop transitions, 0 changer transitions 446/446 dead transitions. [2024-10-14 17:15:58,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 446 transitions, 1124 flow [2024-10-14 17:15:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2024-10-14 17:15:58,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-10-14 17:15:58,809 INFO L175 Difference]: Start difference. First operand has 444 places, 446 transitions, 1053 flow. Second operand 3 states and 1476 transitions. [2024-10-14 17:15:58,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 446 transitions, 1124 flow [2024-10-14 17:15:58,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 446 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:58,813 INFO L231 Difference]: Finished difference. Result has 443 places, 0 transitions, 0 flow [2024-10-14 17:15:58,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=443, PETRI_TRANSITIONS=0} [2024-10-14 17:15:58,814 INFO L277 CegarLoopForPetriNet]: 493 programPoint places, -50 predicate places. [2024-10-14 17:15:58,814 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 0 transitions, 0 flow [2024-10-14 17:15:58,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (131 of 132 remaining) [2024-10-14 17:15:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (130 of 132 remaining) [2024-10-14 17:15:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 132 remaining) [2024-10-14 17:15:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (128 of 132 remaining) [2024-10-14 17:15:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (127 of 132 remaining) [2024-10-14 17:15:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (126 of 132 remaining) [2024-10-14 17:15:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (125 of 132 remaining) [2024-10-14 17:15:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (124 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (123 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (122 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (121 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (120 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (119 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (118 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (117 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err45ASSERT_VIOLATIONDATA_RACE (116 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (115 of 132 remaining) [2024-10-14 17:15:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (114 of 132 remaining) [2024-10-14 17:15:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (113 of 132 remaining) [2024-10-14 17:15:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err46ASSERT_VIOLATIONDATA_RACE (112 of 132 remaining) [2024-10-14 17:15:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (111 of 132 remaining) [2024-10-14 17:15:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (110 of 132 remaining) [2024-10-14 17:15:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (109 of 132 remaining) [2024-10-14 17:15:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err47ASSERT_VIOLATIONDATA_RACE (108 of 132 remaining) [2024-10-14 17:15:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (107 of 132 remaining) [2024-10-14 17:15:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (106 of 132 remaining) [2024-10-14 17:15:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err48ASSERT_VIOLATIONDATA_RACE (105 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (104 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (103 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (102 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err49ASSERT_VIOLATIONDATA_RACE (101 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (99 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err50ASSERT_VIOLATIONDATA_RACE (98 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (97 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err43ASSERT_VIOLATIONDATA_RACE (96 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (95 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err51ASSERT_VIOLATIONDATA_RACE (94 of 132 remaining) [2024-10-14 17:15:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err44ASSERT_VIOLATIONDATA_RACE (93 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (92 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err52ASSERT_VIOLATIONDATA_RACE (91 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (90 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (89 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (88 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (87 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (86 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (85 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (84 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (83 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (82 of 132 remaining) [2024-10-14 17:15:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (81 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (80 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (79 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (78 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (77 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (76 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (75 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (74 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (73 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (72 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (71 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (70 of 132 remaining) [2024-10-14 17:15:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (69 of 132 remaining) [2024-10-14 17:15:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (68 of 132 remaining) [2024-10-14 17:15:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (67 of 132 remaining) [2024-10-14 17:15:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (66 of 132 remaining) [2024-10-14 17:15:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 132 remaining) [2024-10-14 17:15:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (64 of 132 remaining) [2024-10-14 17:15:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (63 of 132 remaining) [2024-10-14 17:15:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (62 of 132 remaining) [2024-10-14 17:15:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 132 remaining) [2024-10-14 17:15:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (60 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (59 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (58 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (57 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (56 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (55 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (54 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (53 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (52 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (51 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (50 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (49 of 132 remaining) [2024-10-14 17:15:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (48 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (47 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (46 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err45ASSERT_VIOLATIONDATA_RACE (45 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (44 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (42 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err46ASSERT_VIOLATIONDATA_RACE (41 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (40 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (39 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err47ASSERT_VIOLATIONDATA_RACE (37 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (36 of 132 remaining) [2024-10-14 17:15:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err48ASSERT_VIOLATIONDATA_RACE (34 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (33 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (32 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (31 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err49ASSERT_VIOLATIONDATA_RACE (30 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (28 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err50ASSERT_VIOLATIONDATA_RACE (27 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (26 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err43ASSERT_VIOLATIONDATA_RACE (25 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (24 of 132 remaining) [2024-10-14 17:15:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err51ASSERT_VIOLATIONDATA_RACE (23 of 132 remaining) [2024-10-14 17:15:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err44ASSERT_VIOLATIONDATA_RACE (22 of 132 remaining) [2024-10-14 17:15:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (21 of 132 remaining) [2024-10-14 17:15:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err52ASSERT_VIOLATIONDATA_RACE (20 of 132 remaining) [2024-10-14 17:15:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (19 of 132 remaining) [2024-10-14 17:15:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (18 of 132 remaining) [2024-10-14 17:15:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (17 of 132 remaining) [2024-10-14 17:15:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (16 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (15 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (13 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (12 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (11 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (10 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (9 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (8 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (7 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (6 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (5 of 132 remaining) [2024-10-14 17:15:58,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (4 of 132 remaining) [2024-10-14 17:15:58,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (3 of 132 remaining) [2024-10-14 17:15:58,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (2 of 132 remaining) [2024-10-14 17:15:58,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (1 of 132 remaining) [2024-10-14 17:15:58,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (0 of 132 remaining) [2024-10-14 17:15:58,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 17:15:58,830 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:58,837 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:15:58,838 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:15:58,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:15:58 BasicIcfg [2024-10-14 17:15:58,843 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:15:58,843 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:15:58,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:15:58,843 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:15:58,844 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:49" (3/4) ... [2024-10-14 17:15:58,845 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:15:58,848 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:15:58,848 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:15:58,852 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-14 17:15:58,852 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:15:58,852 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:15:58,852 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:15:58,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:15:58,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:15:58,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:15:58,925 INFO L158 Benchmark]: Toolchain (without parser) took 10556.06ms. Allocated memory was 186.6MB in the beginning and 597.7MB in the end (delta: 411.0MB). Free memory was 156.6MB in the beginning and 393.1MB in the end (delta: -236.5MB). Peak memory consumption was 175.5MB. Max. memory is 16.1GB. [2024-10-14 17:15:58,926 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:15:58,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.17ms. Allocated memory is still 186.6MB. Free memory was 156.6MB in the beginning and 142.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 17:15:58,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.40ms. Allocated memory is still 186.6MB. Free memory was 142.1MB in the beginning and 139.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:15:58,926 INFO L158 Benchmark]: Boogie Preprocessor took 45.90ms. Allocated memory is still 186.6MB. Free memory was 139.1MB in the beginning and 135.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:15:58,926 INFO L158 Benchmark]: RCFGBuilder took 747.35ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 148.0MB in the end (delta: -12.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-14 17:15:58,927 INFO L158 Benchmark]: TraceAbstraction took 9363.19ms. Allocated memory was 186.6MB in the beginning and 597.7MB in the end (delta: 411.0MB). Free memory was 146.6MB in the beginning and 398.3MB in the end (delta: -251.8MB). Peak memory consumption was 357.5MB. Max. memory is 16.1GB. [2024-10-14 17:15:58,927 INFO L158 Benchmark]: Witness Printer took 81.84ms. Allocated memory is still 597.7MB. Free memory was 398.3MB in the beginning and 393.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:15:58,928 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.16ms. Allocated memory is still 123.7MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.17ms. Allocated memory is still 186.6MB. Free memory was 156.6MB in the beginning and 142.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.40ms. Allocated memory is still 186.6MB. Free memory was 142.1MB in the beginning and 139.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.90ms. Allocated memory is still 186.6MB. Free memory was 139.1MB in the beginning and 135.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 747.35ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 148.0MB in the end (delta: -12.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9363.19ms. Allocated memory was 186.6MB in the beginning and 597.7MB in the end (delta: 411.0MB). Free memory was 146.6MB in the beginning and 398.3MB in the end (delta: -251.8MB). Peak memory consumption was 357.5MB. Max. memory is 16.1GB. * Witness Printer took 81.84ms. Allocated memory is still 597.7MB. Free memory was 398.3MB in the beginning and 393.1MB in the end (delta: 5.2MB). 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: 73]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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: 79]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 67]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: 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, 881 locations, 132 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: 9.2s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3141 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1198 mSDsluCounter, 519 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3398 IncrementalHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 414 mSDtfsCounter, 3398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=15, InterpolantAutomatonStates: 81, 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.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2225 NumberOfCodeBlocks, 2225 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2203 ConstructedInterpolants, 0 QuantifiedInterpolants, 3062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 69 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:15:58,955 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