./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/popl20-bad-ring-nondet.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 01186d000498d57447d1d7ea86dd893215c56febea2169abeb96f12030a58ea4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:16:19,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:16:19,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:16:19,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:16:19,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:16:19,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:16:19,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:16:19,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:16:19,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:16:19,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:16:19,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:16:19,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:16:19,877 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:16:19,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:16:19,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:16:19,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:16:19,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:16:19,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:16:19,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:16:19,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:16:19,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:16:19,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:16:19,884 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:16:19,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:16:19,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:16:19,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:16:19,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:16:19,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:16:19,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:16:19,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:16:19,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:16:19,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:19,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:16:19,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:16:19,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:16:19,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:16:19,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:16:19,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:16:19,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:16:19,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:16:19,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:16:19,890 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-clean/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-clean/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 -> 01186d000498d57447d1d7ea86dd893215c56febea2169abeb96f12030a58ea4 [2024-10-11 17:16:20,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:16:20,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:16:20,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:16:20,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:16:20,145 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:16:20,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c [2024-10-11 17:16:21,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:16:21,774 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:16:21,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c [2024-10-11 17:16:21,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c3dda260a/170c071aef7442f5918fa553220bc2f8/FLAGb0fe0840f [2024-10-11 17:16:22,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c3dda260a/170c071aef7442f5918fa553220bc2f8 [2024-10-11 17:16:22,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:16:22,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:16:22,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:22,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:16:22,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:16:22,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1e5977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22, skipping insertion in model container [2024-10-11 17:16:22,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:16:22,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:22,422 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:16:22,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:22,481 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:16:22,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22 WrapperNode [2024-10-11 17:16:22,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:22,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:22,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:16:22,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:16:22,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,531 INFO L138 Inliner]: procedures = 24, calls = 49, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 613 [2024-10-11 17:16:22,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:22,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:16:22,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:16:22,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:16:22,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:16:22,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:16:22,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:16:22,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:16:22,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:22,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:16:22,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:16:22,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:16:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:16:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:16:22,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:16:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:16:22,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:16:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:16:22,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:16:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:16:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:16:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:16:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:16:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:16:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:16:22,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:16:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:16:22,670 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:16:22,798 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:16:22,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:16:23,587 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:16:23,588 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:16:24,147 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:16:24,149 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 17:16:24,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:24 BoogieIcfgContainer [2024-10-11 17:16:24,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:16:24,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:16:24,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:16:24,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:16:24,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:16:22" (1/3) ... [2024-10-11 17:16:24,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28defb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:24, skipping insertion in model container [2024-10-11 17:16:24,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (2/3) ... [2024-10-11 17:16:24,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28defb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:24, skipping insertion in model container [2024-10-11 17:16:24,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:24" (3/3) ... [2024-10-11 17:16:24,161 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2024-10-11 17:16:24,181 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:16:24,182 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 90 error locations. [2024-10-11 17:16:24,182 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:16:24,372 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:16:24,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 471 places, 487 transitions, 995 flow [2024-10-11 17:16:24,570 INFO L124 PetriNetUnfolderBase]: 26/484 cut-off events. [2024-10-11 17:16:24,570 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:16:24,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 484 events. 26/484 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 782 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 432. Up to 3 conditions per place. [2024-10-11 17:16:24,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 471 places, 487 transitions, 995 flow [2024-10-11 17:16:24,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 452 places, 467 transitions, 952 flow [2024-10-11 17:16:24,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:16:24,610 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;@1b42dd06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:16:24,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2024-10-11 17:16:24,616 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:16:24,617 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-10-11 17:16:24,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:16:24,618 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:24,618 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] [2024-10-11 17:16:24,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:24,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash 944550757, now seen corresponding path program 1 times [2024-10-11 17:16:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5383403] [2024-10-11 17:16:24,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:24,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:24,902 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-11 17:16:24,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:24,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5383403] [2024-10-11 17:16:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5383403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:24,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:24,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:24,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105785416] [2024-10-11 17:16:24,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:24,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:24,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:24,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:25,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 487 [2024-10-11 17:16:25,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 467 transitions, 952 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:25,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:25,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 487 [2024-10-11 17:16:25,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:25,289 INFO L124 PetriNetUnfolderBase]: 152/817 cut-off events. [2024-10-11 17:16:25,289 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-10-11 17:16:25,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 817 events. 152/817 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3095 event pairs, 92 based on Foata normal form. 90/808 useless extension candidates. Maximal degree in co-relation 706. Up to 219 conditions per place. [2024-10-11 17:16:25,330 INFO L140 encePairwiseOnDemand]: 410/487 looper letters, 19 selfloop transitions, 2 changer transitions 7/392 dead transitions. [2024-10-11 17:16:25,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 392 transitions, 844 flow [2024-10-11 17:16:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2024-10-11 17:16:25,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8624229979466119 [2024-10-11 17:16:25,347 INFO L175 Difference]: Start difference. First operand has 452 places, 467 transitions, 952 flow. Second operand 3 states and 1260 transitions. [2024-10-11 17:16:25,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 392 transitions, 844 flow [2024-10-11 17:16:25,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 392 transitions, 832 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:16:25,356 INFO L231 Difference]: Finished difference. Result has 389 places, 385 transitions, 780 flow [2024-10-11 17:16:25,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=389, PETRI_TRANSITIONS=385} [2024-10-11 17:16:25,361 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -63 predicate places. [2024-10-11 17:16:25,361 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 385 transitions, 780 flow [2024-10-11 17:16:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:25,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:25,362 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] [2024-10-11 17:16:25,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:16:25,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1141289306, now seen corresponding path program 1 times [2024-10-11 17:16:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642562686] [2024-10-11 17:16:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:25,404 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-11 17:16:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642562686] [2024-10-11 17:16:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642562686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553605210] [2024-10-11 17:16:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:25,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:25,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:25,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 487 [2024-10-11 17:16:25,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 385 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:25,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:25,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 487 [2024-10-11 17:16:25,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:25,615 INFO L124 PetriNetUnfolderBase]: 152/809 cut-off events. [2024-10-11 17:16:25,616 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:25,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 809 events. 152/809 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3420 event pairs, 92 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 1016. Up to 219 conditions per place. [2024-10-11 17:16:25,623 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 19 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2024-10-11 17:16:25,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 384 transitions, 820 flow [2024-10-11 17:16:25,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1186 transitions. [2024-10-11 17:16:25,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.811772758384668 [2024-10-11 17:16:25,626 INFO L175 Difference]: Start difference. First operand has 389 places, 385 transitions, 780 flow. Second operand 3 states and 1186 transitions. [2024-10-11 17:16:25,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 384 transitions, 820 flow [2024-10-11 17:16:25,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 384 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:25,636 INFO L231 Difference]: Finished difference. Result has 381 places, 384 transitions, 778 flow [2024-10-11 17:16:25,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=381, PETRI_TRANSITIONS=384} [2024-10-11 17:16:25,637 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -71 predicate places. [2024-10-11 17:16:25,637 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 384 transitions, 778 flow [2024-10-11 17:16:25,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:25,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:25,638 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:16:25,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:25,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1724449037, now seen corresponding path program 1 times [2024-10-11 17:16:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099011460] [2024-10-11 17:16:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:25,682 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-11 17:16:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:25,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099011460] [2024-10-11 17:16:25,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099011460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:25,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:25,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227692761] [2024-10-11 17:16:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:25,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:25,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:25,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:25,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 487 [2024-10-11 17:16:25,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 384 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:25,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:25,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 487 [2024-10-11 17:16:25,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:25,802 INFO L124 PetriNetUnfolderBase]: 127/724 cut-off events. [2024-10-11 17:16:25,802 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:25,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 724 events. 127/724 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2549 event pairs, 74 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 883. Up to 183 conditions per place. [2024-10-11 17:16:25,807 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 18 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-10-11 17:16:25,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 383 transitions, 816 flow [2024-10-11 17:16:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2024-10-11 17:16:25,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.813141683778234 [2024-10-11 17:16:25,831 INFO L175 Difference]: Start difference. First operand has 381 places, 384 transitions, 778 flow. Second operand 3 states and 1188 transitions. [2024-10-11 17:16:25,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 383 transitions, 816 flow [2024-10-11 17:16:25,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 383 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:25,837 INFO L231 Difference]: Finished difference. Result has 380 places, 383 transitions, 776 flow [2024-10-11 17:16:25,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=380, PETRI_TRANSITIONS=383} [2024-10-11 17:16:25,847 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -72 predicate places. [2024-10-11 17:16:25,847 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 383 transitions, 776 flow [2024-10-11 17:16:25,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:25,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:25,848 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] [2024-10-11 17:16:25,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:16:25,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:25,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1583434362, now seen corresponding path program 1 times [2024-10-11 17:16:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:25,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901397031] [2024-10-11 17:16:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:25,975 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-11 17:16:25,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:25,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901397031] [2024-10-11 17:16:25,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901397031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:25,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:25,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51512880] [2024-10-11 17:16:25,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:25,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:25,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:25,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:26,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 487 [2024-10-11 17:16:26,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 383 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:26,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:26,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 487 [2024-10-11 17:16:26,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:26,363 INFO L124 PetriNetUnfolderBase]: 127/723 cut-off events. [2024-10-11 17:16:26,364 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:26,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 723 events. 127/723 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2554 event pairs, 74 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 874. Up to 183 conditions per place. [2024-10-11 17:16:26,368 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 18 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2024-10-11 17:16:26,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 382 transitions, 814 flow [2024-10-11 17:16:26,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2024-10-11 17:16:26,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.813141683778234 [2024-10-11 17:16:26,371 INFO L175 Difference]: Start difference. First operand has 380 places, 383 transitions, 776 flow. Second operand 3 states and 1188 transitions. [2024-10-11 17:16:26,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 382 transitions, 814 flow [2024-10-11 17:16:26,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 382 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:26,377 INFO L231 Difference]: Finished difference. Result has 379 places, 382 transitions, 774 flow [2024-10-11 17:16:26,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=379, PETRI_TRANSITIONS=382} [2024-10-11 17:16:26,379 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -73 predicate places. [2024-10-11 17:16:26,380 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 774 flow [2024-10-11 17:16:26,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:26,381 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:26,381 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] [2024-10-11 17:16:26,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:16:26,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:26,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1551840002, now seen corresponding path program 1 times [2024-10-11 17:16:26,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747893852] [2024-10-11 17:16:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:26,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:26,437 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-11 17:16:26,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:26,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747893852] [2024-10-11 17:16:26,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747893852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:26,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:26,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292561783] [2024-10-11 17:16:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:26,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:26,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:26,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:26,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 487 [2024-10-11 17:16:26,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 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-11 17:16:26,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:26,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 487 [2024-10-11 17:16:26,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:26,585 INFO L124 PetriNetUnfolderBase]: 187/960 cut-off events. [2024-10-11 17:16:26,585 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:26,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 960 events. 187/960 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4601 event pairs, 110 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 1192. Up to 264 conditions per place. [2024-10-11 17:16:26,590 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 18 selfloop transitions, 1 changer transitions 0/380 dead transitions. [2024-10-11 17:16:26,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 380 transitions, 808 flow [2024-10-11 17:16:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2024-10-11 17:16:26,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8151950718685832 [2024-10-11 17:16:26,592 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 774 flow. Second operand 3 states and 1191 transitions. [2024-10-11 17:16:26,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 380 transitions, 808 flow [2024-10-11 17:16:26,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 380 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:26,599 INFO L231 Difference]: Finished difference. Result has 377 places, 380 transitions, 768 flow [2024-10-11 17:16:26,601 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=377, PETRI_TRANSITIONS=380} [2024-10-11 17:16:26,601 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -75 predicate places. [2024-10-11 17:16:26,602 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 380 transitions, 768 flow [2024-10-11 17:16:26,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 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-11 17:16:26,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:26,603 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-11 17:16:26,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:16:26,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:26,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:26,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1156261316, now seen corresponding path program 1 times [2024-10-11 17:16:26,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:26,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12058222] [2024-10-11 17:16:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:27,084 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-11 17:16:27,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:27,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12058222] [2024-10-11 17:16:27,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12058222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:27,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:27,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67391729] [2024-10-11 17:16:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:27,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:27,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:27,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 487 [2024-10-11 17:16:27,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 380 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 352.5) internal successors, (2115), 6 states have internal predecessors, (2115), 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-11 17:16:27,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:27,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 487 [2024-10-11 17:16:27,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:27,535 INFO L124 PetriNetUnfolderBase]: 244/1267 cut-off events. [2024-10-11 17:16:27,536 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:27,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 1267 events. 244/1267 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6294 event pairs, 128 based on Foata normal form. 0/1069 useless extension candidates. Maximal degree in co-relation 1600. Up to 348 conditions per place. [2024-10-11 17:16:27,541 INFO L140 encePairwiseOnDemand]: 469/487 looper letters, 42 selfloop transitions, 15 changer transitions 0/377 dead transitions. [2024-10-11 17:16:27,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 377 transitions, 876 flow [2024-10-11 17:16:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2166 transitions. [2024-10-11 17:16:27,545 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7412731006160165 [2024-10-11 17:16:27,545 INFO L175 Difference]: Start difference. First operand has 377 places, 380 transitions, 768 flow. Second operand 6 states and 2166 transitions. [2024-10-11 17:16:27,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 377 transitions, 876 flow [2024-10-11 17:16:27,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 377 transitions, 875 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:27,549 INFO L231 Difference]: Finished difference. Result has 378 places, 377 transitions, 791 flow [2024-10-11 17:16:27,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=378, PETRI_TRANSITIONS=377} [2024-10-11 17:16:27,551 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -74 predicate places. [2024-10-11 17:16:27,552 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 377 transitions, 791 flow [2024-10-11 17:16:27,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 352.5) internal successors, (2115), 6 states have internal predecessors, (2115), 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-11 17:16:27,553 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:27,553 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-11 17:16:27,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:16:27,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:27,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash -202322262, now seen corresponding path program 1 times [2024-10-11 17:16:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907399857] [2024-10-11 17:16:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:27,598 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-11 17:16:27,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:27,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907399857] [2024-10-11 17:16:27,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907399857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:27,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:27,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996895771] [2024-10-11 17:16:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:27,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:27,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:27,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:27,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 487 [2024-10-11 17:16:27,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 377 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:27,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:27,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 487 [2024-10-11 17:16:27,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:27,756 INFO L124 PetriNetUnfolderBase]: 173/1232 cut-off events. [2024-10-11 17:16:27,757 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:27,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 1232 events. 173/1232 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6257 event pairs, 74 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 1440. Up to 219 conditions per place. [2024-10-11 17:16:27,790 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 18 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-10-11 17:16:27,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 376 transitions, 829 flow [2024-10-11 17:16:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2024-10-11 17:16:27,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.813141683778234 [2024-10-11 17:16:27,793 INFO L175 Difference]: Start difference. First operand has 378 places, 377 transitions, 791 flow. Second operand 3 states and 1188 transitions. [2024-10-11 17:16:27,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 376 transitions, 829 flow [2024-10-11 17:16:27,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 376 transitions, 799 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:16:27,798 INFO L231 Difference]: Finished difference. Result has 374 places, 376 transitions, 763 flow [2024-10-11 17:16:27,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=374, PETRI_TRANSITIONS=376} [2024-10-11 17:16:27,800 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -78 predicate places. [2024-10-11 17:16:27,801 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 376 transitions, 763 flow [2024-10-11 17:16:27,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:27,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:27,802 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:27,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:16:27,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:27,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash -542056259, now seen corresponding path program 1 times [2024-10-11 17:16:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844520986] [2024-10-11 17:16:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:27,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:27,847 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-11 17:16:27,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:27,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844520986] [2024-10-11 17:16:27,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844520986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:27,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:27,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873371371] [2024-10-11 17:16:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:27,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:27,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 487 [2024-10-11 17:16:27,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 376 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:27,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:27,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 487 [2024-10-11 17:16:27,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:27,979 INFO L124 PetriNetUnfolderBase]: 151/754 cut-off events. [2024-10-11 17:16:27,979 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:27,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 754 events. 151/754 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2675 event pairs, 73 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 916. Up to 202 conditions per place. [2024-10-11 17:16:27,983 INFO L140 encePairwiseOnDemand]: 485/487 looper letters, 16 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2024-10-11 17:16:27,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 375 transitions, 795 flow [2024-10-11 17:16:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2024-10-11 17:16:27,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8193018480492813 [2024-10-11 17:16:27,986 INFO L175 Difference]: Start difference. First operand has 374 places, 376 transitions, 763 flow. Second operand 3 states and 1197 transitions. [2024-10-11 17:16:27,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 375 transitions, 795 flow [2024-10-11 17:16:27,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 375 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:27,990 INFO L231 Difference]: Finished difference. Result has 373 places, 375 transitions, 759 flow [2024-10-11 17:16:27,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=373, PETRI_TRANSITIONS=375} [2024-10-11 17:16:27,992 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -79 predicate places. [2024-10-11 17:16:27,993 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 375 transitions, 759 flow [2024-10-11 17:16:27,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:27,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:27,994 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] [2024-10-11 17:16:27,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:16:27,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:27,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1389404503, now seen corresponding path program 1 times [2024-10-11 17:16:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:27,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801392961] [2024-10-11 17:16:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:28,041 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-11 17:16:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801392961] [2024-10-11 17:16:28,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801392961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027461998] [2024-10-11 17:16:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:28,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:28,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 487 [2024-10-11 17:16:28,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 375 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:28,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:28,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 487 [2024-10-11 17:16:28,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:28,169 INFO L124 PetriNetUnfolderBase]: 151/753 cut-off events. [2024-10-11 17:16:28,169 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:28,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 753 events. 151/753 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2671 event pairs, 73 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 916. Up to 204 conditions per place. [2024-10-11 17:16:28,173 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 17 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2024-10-11 17:16:28,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 374 transitions, 795 flow [2024-10-11 17:16:28,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-11 17:16:28,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8145106091718002 [2024-10-11 17:16:28,175 INFO L175 Difference]: Start difference. First operand has 373 places, 375 transitions, 759 flow. Second operand 3 states and 1190 transitions. [2024-10-11 17:16:28,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 374 transitions, 795 flow [2024-10-11 17:16:28,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 374 transitions, 794 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:28,179 INFO L231 Difference]: Finished difference. Result has 373 places, 374 transitions, 760 flow [2024-10-11 17:16:28,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=373, PETRI_TRANSITIONS=374} [2024-10-11 17:16:28,181 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -79 predicate places. [2024-10-11 17:16:28,181 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 374 transitions, 760 flow [2024-10-11 17:16:28,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:28,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:16:28,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:16:28,184 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:28,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1340013418, now seen corresponding path program 1 times [2024-10-11 17:16:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:28,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091860384] [2024-10-11 17:16:28,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:28,219 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-11 17:16:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:28,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091860384] [2024-10-11 17:16:28,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091860384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:28,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:28,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838093346] [2024-10-11 17:16:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:28,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:28,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:28,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:28,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 487 [2024-10-11 17:16:28,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 374 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:28,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:28,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 487 [2024-10-11 17:16:28,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:28,329 INFO L124 PetriNetUnfolderBase]: 151/752 cut-off events. [2024-10-11 17:16:28,329 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:28,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 752 events. 151/752 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2670 event pairs, 73 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 915. Up to 202 conditions per place. [2024-10-11 17:16:28,334 INFO L140 encePairwiseOnDemand]: 485/487 looper letters, 16 selfloop transitions, 1 changer transitions 0/373 dead transitions. [2024-10-11 17:16:28,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 373 transitions, 792 flow [2024-10-11 17:16:28,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2024-10-11 17:16:28,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8193018480492813 [2024-10-11 17:16:28,337 INFO L175 Difference]: Start difference. First operand has 373 places, 374 transitions, 760 flow. Second operand 3 states and 1197 transitions. [2024-10-11 17:16:28,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 373 transitions, 792 flow [2024-10-11 17:16:28,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 373 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:28,341 INFO L231 Difference]: Finished difference. Result has 372 places, 373 transitions, 756 flow [2024-10-11 17:16:28,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=372, PETRI_TRANSITIONS=373} [2024-10-11 17:16:28,343 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -80 predicate places. [2024-10-11 17:16:28,343 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 373 transitions, 756 flow [2024-10-11 17:16:28,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:28,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:28,344 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] [2024-10-11 17:16:28,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:16:28,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:28,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1539281297, now seen corresponding path program 1 times [2024-10-11 17:16:28,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:28,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905653860] [2024-10-11 17:16:28,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:28,425 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-11 17:16:28,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:28,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905653860] [2024-10-11 17:16:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905653860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:28,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:28,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098306872] [2024-10-11 17:16:28,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:28,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:28,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:28,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 487 [2024-10-11 17:16:28,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 373 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:28,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:28,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 487 [2024-10-11 17:16:28,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:28,558 INFO L124 PetriNetUnfolderBase]: 151/751 cut-off events. [2024-10-11 17:16:28,558 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:28,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 751 events. 151/751 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2665 event pairs, 73 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 915. Up to 204 conditions per place. [2024-10-11 17:16:28,562 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 17 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-11 17:16:28,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 372 transitions, 792 flow [2024-10-11 17:16:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-11 17:16:28,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8145106091718002 [2024-10-11 17:16:28,564 INFO L175 Difference]: Start difference. First operand has 372 places, 373 transitions, 756 flow. Second operand 3 states and 1190 transitions. [2024-10-11 17:16:28,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 372 transitions, 792 flow [2024-10-11 17:16:28,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 372 transitions, 791 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:28,569 INFO L231 Difference]: Finished difference. Result has 372 places, 372 transitions, 757 flow [2024-10-11 17:16:28,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=757, PETRI_PLACES=372, PETRI_TRANSITIONS=372} [2024-10-11 17:16:28,570 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -80 predicate places. [2024-10-11 17:16:28,570 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 372 transitions, 757 flow [2024-10-11 17:16:28,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:28,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:28,571 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] [2024-10-11 17:16:28,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:16:28,572 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:28,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash -484482871, now seen corresponding path program 1 times [2024-10-11 17:16:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109603489] [2024-10-11 17:16:28,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:28,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:28,608 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-11 17:16:28,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:28,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109603489] [2024-10-11 17:16:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109603489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:28,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:28,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:28,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239428186] [2024-10-11 17:16:28,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:28,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:28,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:28,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:28,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:28,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 487 [2024-10-11 17:16:28,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 372 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:28,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:28,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 487 [2024-10-11 17:16:28,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:28,725 INFO L124 PetriNetUnfolderBase]: 151/750 cut-off events. [2024-10-11 17:16:28,725 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:28,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 750 events. 151/750 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2673 event pairs, 73 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 917. Up to 205 conditions per place. [2024-10-11 17:16:28,729 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 18 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-10-11 17:16:28,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 371 transitions, 795 flow [2024-10-11 17:16:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2024-10-11 17:16:28,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.813141683778234 [2024-10-11 17:16:28,733 INFO L175 Difference]: Start difference. First operand has 372 places, 372 transitions, 757 flow. Second operand 3 states and 1188 transitions. [2024-10-11 17:16:28,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 371 transitions, 795 flow [2024-10-11 17:16:28,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 371 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:28,737 INFO L231 Difference]: Finished difference. Result has 371 places, 371 transitions, 755 flow [2024-10-11 17:16:28,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=371, PETRI_TRANSITIONS=371} [2024-10-11 17:16:28,739 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -81 predicate places. [2024-10-11 17:16:28,739 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 371 transitions, 755 flow [2024-10-11 17:16:28,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:28,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:28,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:16:28,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:16:28,740 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:28,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1255669784, now seen corresponding path program 1 times [2024-10-11 17:16:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168232460] [2024-10-11 17:16:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:28,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:28,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168232460] [2024-10-11 17:16:28,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168232460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:28,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:28,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:28,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970051029] [2024-10-11 17:16:28,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:28,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:28,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:28,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:28,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 487 [2024-10-11 17:16:28,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 371 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:28,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:28,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 487 [2024-10-11 17:16:28,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:28,908 INFO L124 PetriNetUnfolderBase]: 151/749 cut-off events. [2024-10-11 17:16:28,908 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:28,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 749 events. 151/749 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2667 event pairs, 73 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 916. Up to 205 conditions per place. [2024-10-11 17:16:28,912 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 18 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2024-10-11 17:16:28,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 370 transitions, 793 flow [2024-10-11 17:16:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2024-10-11 17:16:28,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.813141683778234 [2024-10-11 17:16:28,915 INFO L175 Difference]: Start difference. First operand has 371 places, 371 transitions, 755 flow. Second operand 3 states and 1188 transitions. [2024-10-11 17:16:28,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 370 transitions, 793 flow [2024-10-11 17:16:28,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:28,920 INFO L231 Difference]: Finished difference. Result has 370 places, 370 transitions, 753 flow [2024-10-11 17:16:28,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=370, PETRI_TRANSITIONS=370} [2024-10-11 17:16:28,921 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -82 predicate places. [2024-10-11 17:16:28,921 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 370 transitions, 753 flow [2024-10-11 17:16:28,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:28,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:28,922 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] [2024-10-11 17:16:28,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:16:28,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:28,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash 11436703, now seen corresponding path program 1 times [2024-10-11 17:16:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490073541] [2024-10-11 17:16:28,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:28,966 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-11 17:16:28,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:28,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490073541] [2024-10-11 17:16:28,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490073541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:28,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:28,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:28,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617812574] [2024-10-11 17:16:28,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:28,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:28,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:28,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:28,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:28,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 487 [2024-10-11 17:16:28,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 370 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:28,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:28,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 487 [2024-10-11 17:16:28,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:29,082 INFO L124 PetriNetUnfolderBase]: 151/748 cut-off events. [2024-10-11 17:16:29,082 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:29,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 748 events. 151/748 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2663 event pairs, 73 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 915. Up to 205 conditions per place. [2024-10-11 17:16:29,087 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 18 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-10-11 17:16:29,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 791 flow [2024-10-11 17:16:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2024-10-11 17:16:29,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.813141683778234 [2024-10-11 17:16:29,090 INFO L175 Difference]: Start difference. First operand has 370 places, 370 transitions, 753 flow. Second operand 3 states and 1188 transitions. [2024-10-11 17:16:29,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 791 flow [2024-10-11 17:16:29,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 369 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:29,095 INFO L231 Difference]: Finished difference. Result has 369 places, 369 transitions, 751 flow [2024-10-11 17:16:29,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=369, PETRI_TRANSITIONS=369} [2024-10-11 17:16:29,096 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -83 predicate places. [2024-10-11 17:16:29,096 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 369 transitions, 751 flow [2024-10-11 17:16:29,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-11 17:16:29,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:29,097 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:29,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:16:29,097 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:29,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash 761916835, now seen corresponding path program 1 times [2024-10-11 17:16:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:29,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369641815] [2024-10-11 17:16:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:29,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:29,133 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-11 17:16:29,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:29,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369641815] [2024-10-11 17:16:29,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369641815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:29,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:29,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:29,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036426957] [2024-10-11 17:16:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:29,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:29,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:29,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:29,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 487 [2024-10-11 17:16:29,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 369 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:29,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:29,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 487 [2024-10-11 17:16:29,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:29,302 INFO L124 PetriNetUnfolderBase]: 164/831 cut-off events. [2024-10-11 17:16:29,302 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:16:29,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 831 events. 164/831 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3036 event pairs, 46 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 1002. Up to 160 conditions per place. [2024-10-11 17:16:29,307 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-10-11 17:16:29,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 377 transitions, 821 flow [2024-10-11 17:16:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2024-10-11 17:16:29,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8254620123203286 [2024-10-11 17:16:29,311 INFO L175 Difference]: Start difference. First operand has 369 places, 369 transitions, 751 flow. Second operand 3 states and 1206 transitions. [2024-10-11 17:16:29,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 377 transitions, 821 flow [2024-10-11 17:16:29,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 377 transitions, 817 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:29,318 INFO L231 Difference]: Finished difference. Result has 369 places, 369 transitions, 755 flow [2024-10-11 17:16:29,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=369, PETRI_TRANSITIONS=369} [2024-10-11 17:16:29,320 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -83 predicate places. [2024-10-11 17:16:29,320 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 369 transitions, 755 flow [2024-10-11 17:16:29,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:29,321 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:29,321 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] [2024-10-11 17:16:29,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:16:29,321 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:29,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1767362838, now seen corresponding path program 1 times [2024-10-11 17:16:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494443921] [2024-10-11 17:16:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:29,371 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-11 17:16:29,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:29,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494443921] [2024-10-11 17:16:29,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494443921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:29,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:29,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801554441] [2024-10-11 17:16:29,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:29,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:29,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:29,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:29,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 487 [2024-10-11 17:16:29,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 369 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:29,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:29,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 487 [2024-10-11 17:16:29,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:29,542 INFO L124 PetriNetUnfolderBase]: 225/990 cut-off events. [2024-10-11 17:16:29,543 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-10-11 17:16:29,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 990 events. 225/990 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4569 event pairs, 127 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1374. Up to 318 conditions per place. [2024-10-11 17:16:29,548 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 21 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-10-11 17:16:29,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 368 transitions, 799 flow [2024-10-11 17:16:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2024-10-11 17:16:29,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.810403832991102 [2024-10-11 17:16:29,551 INFO L175 Difference]: Start difference. First operand has 369 places, 369 transitions, 755 flow. Second operand 3 states and 1184 transitions. [2024-10-11 17:16:29,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 368 transitions, 799 flow [2024-10-11 17:16:29,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 368 transitions, 797 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:29,556 INFO L231 Difference]: Finished difference. Result has 369 places, 368 transitions, 755 flow [2024-10-11 17:16:29,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=369, PETRI_TRANSITIONS=368} [2024-10-11 17:16:29,557 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -83 predicate places. [2024-10-11 17:16:29,557 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 368 transitions, 755 flow [2024-10-11 17:16:29,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:29,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:29,558 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] [2024-10-11 17:16:29,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:16:29,558 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash -496023765, now seen corresponding path program 1 times [2024-10-11 17:16:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:29,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849999456] [2024-10-11 17:16:29,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:29,593 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-11 17:16:29,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:29,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849999456] [2024-10-11 17:16:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849999456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:29,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721798349] [2024-10-11 17:16:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:29,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:29,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:29,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 487 [2024-10-11 17:16:29,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 368 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:29,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:29,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 487 [2024-10-11 17:16:29,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:29,734 INFO L124 PetriNetUnfolderBase]: 161/965 cut-off events. [2024-10-11 17:16:29,735 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-10-11 17:16:29,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 965 events. 161/965 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3907 event pairs, 30 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1177. Up to 125 conditions per place. [2024-10-11 17:16:29,739 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 26 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-10-11 17:16:29,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 377 transitions, 835 flow [2024-10-11 17:16:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2024-10-11 17:16:29,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8254620123203286 [2024-10-11 17:16:29,742 INFO L175 Difference]: Start difference. First operand has 369 places, 368 transitions, 755 flow. Second operand 3 states and 1206 transitions. [2024-10-11 17:16:29,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 377 transitions, 835 flow [2024-10-11 17:16:29,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 377 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:29,746 INFO L231 Difference]: Finished difference. Result has 369 places, 368 transitions, 759 flow [2024-10-11 17:16:29,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=369, PETRI_TRANSITIONS=368} [2024-10-11 17:16:29,747 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -83 predicate places. [2024-10-11 17:16:29,747 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 368 transitions, 759 flow [2024-10-11 17:16:29,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:29,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:29,748 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] [2024-10-11 17:16:29,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:16:29,748 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:29,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash 21277470, now seen corresponding path program 1 times [2024-10-11 17:16:29,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:29,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579699322] [2024-10-11 17:16:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:29,784 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-11 17:16:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579699322] [2024-10-11 17:16:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579699322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174646920] [2024-10-11 17:16:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:29,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:29,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:29,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:29,793 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 487 [2024-10-11 17:16:29,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 368 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:29,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:29,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 487 [2024-10-11 17:16:29,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:29,960 INFO L124 PetriNetUnfolderBase]: 152/763 cut-off events. [2024-10-11 17:16:29,960 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-11 17:16:29,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 763 events. 152/763 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2782 event pairs, 73 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 1025. Up to 214 conditions per place. [2024-10-11 17:16:29,973 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 19 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-10-11 17:16:29,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 367 transitions, 799 flow [2024-10-11 17:16:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-11 17:16:29,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8145106091718002 [2024-10-11 17:16:29,975 INFO L175 Difference]: Start difference. First operand has 369 places, 368 transitions, 759 flow. Second operand 3 states and 1190 transitions. [2024-10-11 17:16:29,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 367 transitions, 799 flow [2024-10-11 17:16:29,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 367 transitions, 797 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:29,988 INFO L231 Difference]: Finished difference. Result has 369 places, 367 transitions, 759 flow [2024-10-11 17:16:29,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=369, PETRI_TRANSITIONS=367} [2024-10-11 17:16:29,989 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -83 predicate places. [2024-10-11 17:16:29,989 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 367 transitions, 759 flow [2024-10-11 17:16:29,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:29,989 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:29,990 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] [2024-10-11 17:16:29,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:16:29,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:29,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1776343927, now seen corresponding path program 1 times [2024-10-11 17:16:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:29,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498306847] [2024-10-11 17:16:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:30,066 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-11 17:16:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498306847] [2024-10-11 17:16:30,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498306847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:30,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:30,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:30,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789927841] [2024-10-11 17:16:30,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:30,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:30,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:30,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:30,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 487 [2024-10-11 17:16:30,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 367 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:30,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:30,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 487 [2024-10-11 17:16:30,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:30,399 INFO L124 PetriNetUnfolderBase]: 236/1238 cut-off events. [2024-10-11 17:16:30,399 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-10-11 17:16:30,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 1238 events. 236/1238 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6410 event pairs, 73 based on Foata normal form. 0/1084 useless extension candidates. Maximal degree in co-relation 1645. Up to 212 conditions per place. [2024-10-11 17:16:30,407 INFO L140 encePairwiseOnDemand]: 483/487 looper letters, 29 selfloop transitions, 3 changer transitions 0/379 dead transitions. [2024-10-11 17:16:30,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 379 transitions, 860 flow [2024-10-11 17:16:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2024-10-11 17:16:30,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8268309377138946 [2024-10-11 17:16:30,411 INFO L175 Difference]: Start difference. First operand has 369 places, 367 transitions, 759 flow. Second operand 3 states and 1208 transitions. [2024-10-11 17:16:30,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 379 transitions, 860 flow [2024-10-11 17:16:30,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 379 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:30,417 INFO L231 Difference]: Finished difference. Result has 369 places, 367 transitions, 766 flow [2024-10-11 17:16:30,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=369, PETRI_TRANSITIONS=367} [2024-10-11 17:16:30,418 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -83 predicate places. [2024-10-11 17:16:30,418 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 367 transitions, 766 flow [2024-10-11 17:16:30,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-11 17:16:30,418 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:30,418 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] [2024-10-11 17:16:30,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:16:30,419 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:30,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:30,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1951831972, now seen corresponding path program 1 times [2024-10-11 17:16:30,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:30,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131741519] [2024-10-11 17:16:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:30,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-11 17:16:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:30,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131741519] [2024-10-11 17:16:30,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131741519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:30,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:30,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:30,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793004539] [2024-10-11 17:16:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:30,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:30,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:30,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:30,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 487 [2024-10-11 17:16:30,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 367 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:30,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:30,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 487 [2024-10-11 17:16:30,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:30,602 INFO L124 PetriNetUnfolderBase]: 224/1009 cut-off events. [2024-10-11 17:16:30,603 INFO L125 PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES. [2024-10-11 17:16:30,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 1009 events. 224/1009 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4544 event pairs, 123 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 1481. Up to 324 conditions per place. [2024-10-11 17:16:30,608 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 20 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2024-10-11 17:16:30,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 366 transitions, 808 flow [2024-10-11 17:16:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-11 17:16:30,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8145106091718002 [2024-10-11 17:16:30,610 INFO L175 Difference]: Start difference. First operand has 369 places, 367 transitions, 766 flow. Second operand 3 states and 1190 transitions. [2024-10-11 17:16:30,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 366 transitions, 808 flow [2024-10-11 17:16:30,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 366 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:30,614 INFO L231 Difference]: Finished difference. Result has 369 places, 366 transitions, 765 flow [2024-10-11 17:16:30,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=369, PETRI_TRANSITIONS=366} [2024-10-11 17:16:30,615 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -83 predicate places. [2024-10-11 17:16:30,615 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 366 transitions, 765 flow [2024-10-11 17:16:30,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:30,616 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:30,616 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] [2024-10-11 17:16:30,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:16:30,616 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:30,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:30,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1760690756, now seen corresponding path program 1 times [2024-10-11 17:16:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:30,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784158018] [2024-10-11 17:16:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784158018] [2024-10-11 17:16:30,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784158018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:30,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116249851] [2024-10-11 17:16:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:30,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:30,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:30,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:30,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 487 [2024-10-11 17:16:30,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 366 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 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-11 17:16:30,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:30,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 487 [2024-10-11 17:16:30,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:30,965 INFO L124 PetriNetUnfolderBase]: 323/1537 cut-off events. [2024-10-11 17:16:30,965 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2024-10-11 17:16:30,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 1537 events. 323/1537 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8484 event pairs, 187 based on Foata normal form. 0/1318 useless extension candidates. Maximal degree in co-relation 2189. Up to 462 conditions per place. [2024-10-11 17:16:30,982 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 21 selfloop transitions, 1 changer transitions 0/364 dead transitions. [2024-10-11 17:16:30,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 364 transitions, 805 flow [2024-10-11 17:16:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2024-10-11 17:16:30,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8151950718685832 [2024-10-11 17:16:30,988 INFO L175 Difference]: Start difference. First operand has 369 places, 366 transitions, 765 flow. Second operand 3 states and 1191 transitions. [2024-10-11 17:16:30,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 364 transitions, 805 flow [2024-10-11 17:16:30,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 364 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:30,995 INFO L231 Difference]: Finished difference. Result has 367 places, 364 transitions, 759 flow [2024-10-11 17:16:30,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=367, PETRI_TRANSITIONS=364} [2024-10-11 17:16:31,000 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -85 predicate places. [2024-10-11 17:16:31,000 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 364 transitions, 759 flow [2024-10-11 17:16:31,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 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-11 17:16:31,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:31,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:31,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:16:31,005 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:31,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:31,006 INFO L85 PathProgramCache]: Analyzing trace with hash 165139693, now seen corresponding path program 1 times [2024-10-11 17:16:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:31,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108244] [2024-10-11 17:16:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:31,094 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-11 17:16:31,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108244] [2024-10-11 17:16:31,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:31,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:31,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:31,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682843258] [2024-10-11 17:16:31,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:31,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:31,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:31,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:31,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:31,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 487 [2024-10-11 17:16:31,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 364 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:31,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:31,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 487 [2024-10-11 17:16:31,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:31,360 INFO L124 PetriNetUnfolderBase]: 327/1561 cut-off events. [2024-10-11 17:16:31,361 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2024-10-11 17:16:31,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2281 conditions, 1561 events. 327/1561 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8557 event pairs, 151 based on Foata normal form. 0/1334 useless extension candidates. Maximal degree in co-relation 2216. Up to 383 conditions per place. [2024-10-11 17:16:31,367 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 28 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-10-11 17:16:31,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 371 transitions, 843 flow [2024-10-11 17:16:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2024-10-11 17:16:31,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8206707734428473 [2024-10-11 17:16:31,370 INFO L175 Difference]: Start difference. First operand has 367 places, 364 transitions, 759 flow. Second operand 3 states and 1199 transitions. [2024-10-11 17:16:31,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 371 transitions, 843 flow [2024-10-11 17:16:31,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 371 transitions, 842 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:31,376 INFO L231 Difference]: Finished difference. Result has 367 places, 363 transitions, 760 flow [2024-10-11 17:16:31,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=367, PETRI_TRANSITIONS=363} [2024-10-11 17:16:31,377 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -85 predicate places. [2024-10-11 17:16:31,377 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 363 transitions, 760 flow [2024-10-11 17:16:31,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:31,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:31,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:31,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:16:31,378 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:31,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1463313912, now seen corresponding path program 1 times [2024-10-11 17:16:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150996727] [2024-10-11 17:16:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:31,448 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-11 17:16:31,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150996727] [2024-10-11 17:16:31,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150996727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:31,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709947054] [2024-10-11 17:16:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:31,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:31,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 487 [2024-10-11 17:16:31,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 363 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:31,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:31,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 487 [2024-10-11 17:16:31,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:31,793 INFO L124 PetriNetUnfolderBase]: 561/2083 cut-off events. [2024-10-11 17:16:31,794 INFO L125 PetriNetUnfolderBase]: For 371/371 co-relation queries the response was YES. [2024-10-11 17:16:31,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3304 conditions, 2083 events. 561/2083 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12938 event pairs, 94 based on Foata normal form. 0/1905 useless extension candidates. Maximal degree in co-relation 3239. Up to 636 conditions per place. [2024-10-11 17:16:31,803 INFO L140 encePairwiseOnDemand]: 480/487 looper letters, 32 selfloop transitions, 5 changer transitions 0/373 dead transitions. [2024-10-11 17:16:31,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 373 transitions, 867 flow [2024-10-11 17:16:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1196 transitions. [2024-10-11 17:16:31,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8186173853524983 [2024-10-11 17:16:31,806 INFO L175 Difference]: Start difference. First operand has 367 places, 363 transitions, 760 flow. Second operand 3 states and 1196 transitions. [2024-10-11 17:16:31,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 373 transitions, 867 flow [2024-10-11 17:16:31,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 373 transitions, 863 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:31,811 INFO L231 Difference]: Finished difference. Result has 366 places, 364 transitions, 790 flow [2024-10-11 17:16:31,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=366, PETRI_TRANSITIONS=364} [2024-10-11 17:16:31,812 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -86 predicate places. [2024-10-11 17:16:31,812 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 364 transitions, 790 flow [2024-10-11 17:16:31,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:31,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:31,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:16:31,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:16:31,813 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:31,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash 601947623, now seen corresponding path program 1 times [2024-10-11 17:16:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:31,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459820136] [2024-10-11 17:16:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:31,857 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-11 17:16:31,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459820136] [2024-10-11 17:16:31,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459820136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:31,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:31,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:31,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409902645] [2024-10-11 17:16:31,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:31,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:31,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:31,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:31,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:31,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 487 [2024-10-11 17:16:31,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 364 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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-11 17:16:31,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:31,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 487 [2024-10-11 17:16:31,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:32,120 INFO L124 PetriNetUnfolderBase]: 407/1893 cut-off events. [2024-10-11 17:16:32,120 INFO L125 PetriNetUnfolderBase]: For 735/745 co-relation queries the response was YES. [2024-10-11 17:16:32,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3071 conditions, 1893 events. 407/1893 cut-off events. For 735/745 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 11927 event pairs, 150 based on Foata normal form. 3/1714 useless extension candidates. Maximal degree in co-relation 3005. Up to 524 conditions per place. [2024-10-11 17:16:32,129 INFO L140 encePairwiseOnDemand]: 483/487 looper letters, 29 selfloop transitions, 4 changer transitions 0/373 dead transitions. [2024-10-11 17:16:32,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 373 transitions, 894 flow [2024-10-11 17:16:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1205 transitions. [2024-10-11 17:16:32,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8247775496235455 [2024-10-11 17:16:32,132 INFO L175 Difference]: Start difference. First operand has 366 places, 364 transitions, 790 flow. Second operand 3 states and 1205 transitions. [2024-10-11 17:16:32,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 373 transitions, 894 flow [2024-10-11 17:16:32,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 373 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:32,137 INFO L231 Difference]: Finished difference. Result has 366 places, 367 transitions, 816 flow [2024-10-11 17:16:32,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=366, PETRI_TRANSITIONS=367} [2024-10-11 17:16:32,138 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -86 predicate places. [2024-10-11 17:16:32,138 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 367 transitions, 816 flow [2024-10-11 17:16:32,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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-11 17:16:32,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:32,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:16:32,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:16:32,139 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:32,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1594754317, now seen corresponding path program 1 times [2024-10-11 17:16:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832944156] [2024-10-11 17:16:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:32,757 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-11 17:16:32,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832944156] [2024-10-11 17:16:32,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832944156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:32,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:32,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:32,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626269541] [2024-10-11 17:16:32,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:32,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:32,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:32,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:32,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:32,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 487 [2024-10-11 17:16:32,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 367 transitions, 816 flow. Second operand has 6 states, 6 states have (on average 376.8333333333333) internal successors, (2261), 6 states have internal predecessors, (2261), 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-11 17:16:32,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:32,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 487 [2024-10-11 17:16:32,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:33,368 INFO L124 PetriNetUnfolderBase]: 618/2464 cut-off events. [2024-10-11 17:16:33,368 INFO L125 PetriNetUnfolderBase]: For 1207/1219 co-relation queries the response was YES. [2024-10-11 17:16:33,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 2464 events. 618/2464 cut-off events. For 1207/1219 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 17019 event pairs, 131 based on Foata normal form. 7/2248 useless extension candidates. Maximal degree in co-relation 4190. Up to 440 conditions per place. [2024-10-11 17:16:33,379 INFO L140 encePairwiseOnDemand]: 480/487 looper letters, 76 selfloop transitions, 6 changer transitions 0/404 dead transitions. [2024-10-11 17:16:33,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 404 transitions, 1122 flow [2024-10-11 17:16:33,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2316 transitions. [2024-10-11 17:16:33,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7926078028747433 [2024-10-11 17:16:33,383 INFO L175 Difference]: Start difference. First operand has 366 places, 367 transitions, 816 flow. Second operand 6 states and 2316 transitions. [2024-10-11 17:16:33,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 404 transitions, 1122 flow [2024-10-11 17:16:33,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 404 transitions, 1122 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:33,388 INFO L231 Difference]: Finished difference. Result has 375 places, 371 transitions, 860 flow [2024-10-11 17:16:33,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=375, PETRI_TRANSITIONS=371} [2024-10-11 17:16:33,389 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -77 predicate places. [2024-10-11 17:16:33,389 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 371 transitions, 860 flow [2024-10-11 17:16:33,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.8333333333333) internal successors, (2261), 6 states have internal predecessors, (2261), 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-11 17:16:33,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:33,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:16:33,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:16:33,390 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:33,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1799078769, now seen corresponding path program 1 times [2024-10-11 17:16:33,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:33,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622202747] [2024-10-11 17:16:33,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:33,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:33,678 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-11 17:16:33,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:33,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622202747] [2024-10-11 17:16:33,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622202747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:33,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:33,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:16:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880214311] [2024-10-11 17:16:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:33,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:33,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:33,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:33,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 487 [2024-10-11 17:16:33,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 371 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 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-11 17:16:33,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:33,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 487 [2024-10-11 17:16:33,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:34,011 INFO L124 PetriNetUnfolderBase]: 382/1719 cut-off events. [2024-10-11 17:16:34,012 INFO L125 PetriNetUnfolderBase]: For 942/977 co-relation queries the response was YES. [2024-10-11 17:16:34,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 1719 events. 382/1719 cut-off events. For 942/977 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10362 event pairs, 80 based on Foata normal form. 33/1572 useless extension candidates. Maximal degree in co-relation 2906. Up to 432 conditions per place. [2024-10-11 17:16:34,022 INFO L140 encePairwiseOnDemand]: 484/487 looper letters, 36 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2024-10-11 17:16:34,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 381 transitions, 984 flow [2024-10-11 17:16:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2024-10-11 17:16:34,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8254620123203286 [2024-10-11 17:16:34,026 INFO L175 Difference]: Start difference. First operand has 375 places, 371 transitions, 860 flow. Second operand 3 states and 1206 transitions. [2024-10-11 17:16:34,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 381 transitions, 984 flow [2024-10-11 17:16:34,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 381 transitions, 984 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:34,031 INFO L231 Difference]: Finished difference. Result has 378 places, 372 transitions, 872 flow [2024-10-11 17:16:34,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=378, PETRI_TRANSITIONS=372} [2024-10-11 17:16:34,032 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -74 predicate places. [2024-10-11 17:16:34,032 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 372 transitions, 872 flow [2024-10-11 17:16:34,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 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-11 17:16:34,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:34,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:16:34,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:16:34,033 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:34,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2035447691, now seen corresponding path program 2 times [2024-10-11 17:16:34,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:34,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820075810] [2024-10-11 17:16:34,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:34,553 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-11 17:16:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820075810] [2024-10-11 17:16:34,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820075810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:34,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:34,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:16:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563029286] [2024-10-11 17:16:34,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:34,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:34,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 487 [2024-10-11 17:16:34,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 372 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 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-11 17:16:34,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:34,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 487 [2024-10-11 17:16:34,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:34,947 INFO L124 PetriNetUnfolderBase]: 372/1837 cut-off events. [2024-10-11 17:16:34,947 INFO L125 PetriNetUnfolderBase]: For 1057/1090 co-relation queries the response was YES. [2024-10-11 17:16:34,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3237 conditions, 1837 events. 372/1837 cut-off events. For 1057/1090 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10592 event pairs, 122 based on Foata normal form. 14/1649 useless extension candidates. Maximal degree in co-relation 3162. Up to 506 conditions per place. [2024-10-11 17:16:34,961 INFO L140 encePairwiseOnDemand]: 483/487 looper letters, 30 selfloop transitions, 4 changer transitions 0/377 dead transitions. [2024-10-11 17:16:34,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 377 transitions, 956 flow [2024-10-11 17:16:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2024-10-11 17:16:34,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8240930869267625 [2024-10-11 17:16:34,964 INFO L175 Difference]: Start difference. First operand has 378 places, 372 transitions, 872 flow. Second operand 3 states and 1204 transitions. [2024-10-11 17:16:34,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 377 transitions, 956 flow [2024-10-11 17:16:34,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 377 transitions, 954 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:34,970 INFO L231 Difference]: Finished difference. Result has 380 places, 372 transitions, 886 flow [2024-10-11 17:16:34,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=380, PETRI_TRANSITIONS=372} [2024-10-11 17:16:34,970 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -72 predicate places. [2024-10-11 17:16:34,971 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 372 transitions, 886 flow [2024-10-11 17:16:34,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 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-11 17:16:34,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:34,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:16:34,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:16:34,972 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-11 17:16:34,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash -305507925, now seen corresponding path program 3 times [2024-10-11 17:16:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:34,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403695400] [2024-10-11 17:16:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:34,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:35,064 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-11 17:16:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403695400] [2024-10-11 17:16:35,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403695400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:35,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:35,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65575573] [2024-10-11 17:16:35,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:35,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:35,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:35,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:35,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:35,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 487 [2024-10-11 17:16:35,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 372 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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-11 17:16:35,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:35,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 487 [2024-10-11 17:16:35,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:35,318 INFO L124 PetriNetUnfolderBase]: 382/1984 cut-off events. [2024-10-11 17:16:35,318 INFO L125 PetriNetUnfolderBase]: For 1218/1246 co-relation queries the response was YES. [2024-10-11 17:16:35,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3484 conditions, 1984 events. 382/1984 cut-off events. For 1218/1246 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11704 event pairs, 168 based on Foata normal form. 4/1775 useless extension candidates. Maximal degree in co-relation 3410. Up to 529 conditions per place. [2024-10-11 17:16:35,326 INFO L140 encePairwiseOnDemand]: 485/487 looper letters, 0 selfloop transitions, 0 changer transitions 371/371 dead transitions. [2024-10-11 17:16:35,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 371 transitions, 938 flow [2024-10-11 17:16:35,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1196 transitions. [2024-10-11 17:16:35,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8186173853524983 [2024-10-11 17:16:35,328 INFO L175 Difference]: Start difference. First operand has 380 places, 372 transitions, 886 flow. Second operand 3 states and 1196 transitions. [2024-10-11 17:16:35,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 371 transitions, 938 flow [2024-10-11 17:16:35,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 371 transitions, 934 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:35,332 INFO L231 Difference]: Finished difference. Result has 380 places, 0 transitions, 0 flow [2024-10-11 17:16:35,333 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=487, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=380, PETRI_TRANSITIONS=0} [2024-10-11 17:16:35,336 INFO L277 CegarLoopForPetriNet]: 452 programPoint places, -72 predicate places. [2024-10-11 17:16:35,336 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 0 transitions, 0 flow [2024-10-11 17:16:35,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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-11 17:16:35,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (158 of 159 remaining) [2024-10-11 17:16:35,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (157 of 159 remaining) [2024-10-11 17:16:35,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (156 of 159 remaining) [2024-10-11 17:16:35,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (155 of 159 remaining) [2024-10-11 17:16:35,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (154 of 159 remaining) [2024-10-11 17:16:35,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (153 of 159 remaining) [2024-10-11 17:16:35,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (152 of 159 remaining) [2024-10-11 17:16:35,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (151 of 159 remaining) [2024-10-11 17:16:35,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (150 of 159 remaining) [2024-10-11 17:16:35,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (149 of 159 remaining) [2024-10-11 17:16:35,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (148 of 159 remaining) [2024-10-11 17:16:35,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (147 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (146 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (145 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (144 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (143 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (142 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (141 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (140 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (139 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (138 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (137 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (136 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (135 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (134 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (132 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (131 of 159 remaining) [2024-10-11 17:16:35,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (130 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (129 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (128 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (127 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (126 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (125 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (124 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (123 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (122 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (121 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (120 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (119 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (118 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (117 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (116 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (115 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (114 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (112 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (111 of 159 remaining) [2024-10-11 17:16:35,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (110 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (109 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (108 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (107 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (106 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (105 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (104 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (103 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (102 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (101 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (100 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (99 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (98 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (97 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (96 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (95 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (93 of 159 remaining) [2024-10-11 17:16:35,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (92 of 159 remaining) [2024-10-11 17:16:35,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (91 of 159 remaining) [2024-10-11 17:16:35,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (90 of 159 remaining) [2024-10-11 17:16:35,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (89 of 159 remaining) [2024-10-11 17:16:35,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (88 of 159 remaining) [2024-10-11 17:16:35,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (87 of 159 remaining) [2024-10-11 17:16:35,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (86 of 159 remaining) [2024-10-11 17:16:35,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (85 of 159 remaining) [2024-10-11 17:16:35,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (84 of 159 remaining) [2024-10-11 17:16:35,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (83 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (82 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (81 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (80 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (79 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (78 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (77 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (75 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (74 of 159 remaining) [2024-10-11 17:16:35,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (73 of 159 remaining) [2024-10-11 17:16:35,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (72 of 159 remaining) [2024-10-11 17:16:35,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (71 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (70 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (69 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (65 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (64 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (63 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (62 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (61 of 159 remaining) [2024-10-11 17:16:35,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (60 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (59 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (58 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (57 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (56 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (51 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 159 remaining) [2024-10-11 17:16:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (48 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (46 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (45 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (44 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (43 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (42 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (41 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (40 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (39 of 159 remaining) [2024-10-11 17:16:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (38 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (37 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (36 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (31 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 159 remaining) [2024-10-11 17:16:35,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (13 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (12 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (11 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (8 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 159 remaining) [2024-10-11 17:16:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (6 of 159 remaining) [2024-10-11 17:16:35,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 159 remaining) [2024-10-11 17:16:35,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 159 remaining) [2024-10-11 17:16:35,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (3 of 159 remaining) [2024-10-11 17:16:35,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (2 of 159 remaining) [2024-10-11 17:16:35,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (1 of 159 remaining) [2024-10-11 17:16:35,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 159 remaining) [2024-10-11 17:16:35,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:16:35,353 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 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-11 17:16:35,362 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:16:35,362 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:16:35,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:16:35 BasicIcfg [2024-10-11 17:16:35,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:16:35,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:16:35,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:16:35,368 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:16:35,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:24" (3/4) ... [2024-10-11 17:16:35,370 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:16:35,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:16:35,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:16:35,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:16:35,381 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-10-11 17:16:35,382 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:16:35,383 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:16:35,383 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:16:35,467 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:16:35,467 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:16:35,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:16:35,468 INFO L158 Benchmark]: Toolchain (without parser) took 13308.26ms. Allocated memory was 132.1MB in the beginning and 853.5MB in the end (delta: 721.4MB). Free memory was 97.0MB in the beginning and 551.9MB in the end (delta: -454.9MB). Peak memory consumption was 267.5MB. Max. memory is 16.1GB. [2024-10-11 17:16:35,468 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:16:35,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.97ms. Allocated memory is still 132.1MB. Free memory was 97.0MB in the beginning and 80.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 17:16:35,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 132.1MB. Free memory was 80.2MB in the beginning and 76.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:16:35,469 INFO L158 Benchmark]: Boogie Preprocessor took 45.03ms. Allocated memory is still 132.1MB. Free memory was 76.0MB in the beginning and 72.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:16:35,469 INFO L158 Benchmark]: RCFGBuilder took 1573.03ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 72.4MB in the beginning and 124.1MB in the end (delta: -51.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-10-11 17:16:35,469 INFO L158 Benchmark]: TraceAbstraction took 11214.15ms. Allocated memory was 180.4MB in the beginning and 853.5MB in the end (delta: 673.2MB). Free memory was 123.1MB in the beginning and 560.3MB in the end (delta: -437.3MB). Peak memory consumption was 237.0MB. Max. memory is 16.1GB. [2024-10-11 17:16:35,469 INFO L158 Benchmark]: Witness Printer took 99.38ms. Allocated memory is still 853.5MB. Free memory was 560.3MB in the beginning and 551.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 17:16:35,471 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.14ms. Allocated memory is still 100.7MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.97ms. Allocated memory is still 132.1MB. Free memory was 97.0MB in the beginning and 80.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 132.1MB. Free memory was 80.2MB in the beginning and 76.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.03ms. Allocated memory is still 132.1MB. Free memory was 76.0MB in the beginning and 72.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1573.03ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 72.4MB in the beginning and 124.1MB in the end (delta: -51.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11214.15ms. Allocated memory was 180.4MB in the beginning and 853.5MB in the end (delta: 673.2MB). Free memory was 123.1MB in the beginning and 560.3MB in the end (delta: -437.3MB). Peak memory consumption was 237.0MB. Max. memory is 16.1GB. * Witness Printer took 99.38ms. Allocated memory is still 853.5MB. Free memory was 560.3MB in the beginning and 551.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 59]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 84]: 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: 84]: 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: 84]: 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: 85]: 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: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - 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 - 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 - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 603 locations, 159 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: 10.9s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 600 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1555 IncrementalHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 99 mSDtfsCounter, 1555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=952occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 4546 NumberOfCodeBlocks, 4546 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4518 ConstructedInterpolants, 0 QuantifiedInterpolants, 4978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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 90 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:16:35,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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