./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/parallel-misc-1.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/parallel-misc-1.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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:15:41,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:15:41,997 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:15:42,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:15:42,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:15:42,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:15:42,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:15:42,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:15:42,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:15:42,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:15:42,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:15:42,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:15:42,024 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:15:42,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:15:42,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:15:42,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:15:42,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:15:42,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:15:42,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:15:42,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:15:42,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:15:42,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:15:42,030 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:15:42,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:15:42,030 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:15:42,030 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:15:42,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:15:42,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:15:42,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:15:42,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:15:42,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:15:42,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:42,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:15:42,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:15:42,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:15:42,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:15:42,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:15:42,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:15:42,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:15:42,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:15:42,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:15:42,035 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2024-10-11 17:15:42,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:15:42,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:15:42,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:15:42,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:15:42,258 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:15:42,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2024-10-11 17:15:43,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:15:43,736 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:15:43,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2024-10-11 17:15:43,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/331da6d3f/1e2c01e5c8ee401690b02841b31899e9/FLAG75607e54f [2024-10-11 17:15:44,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/331da6d3f/1e2c01e5c8ee401690b02841b31899e9 [2024-10-11 17:15:44,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:15:44,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:15:44,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:44,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:15:44,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:15:44,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a218bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44, skipping insertion in model container [2024-10-11 17:15:44,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:15:44,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:44,344 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:15:44,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:44,385 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:15:44,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44 WrapperNode [2024-10-11 17:15:44,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:44,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:44,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:15:44,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:15:44,392 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:15:44" (1/1) ... [2024-10-11 17:15:44,401 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:15:44" (1/1) ... [2024-10-11 17:15:44,438 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 508 [2024-10-11 17:15:44,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:44,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:15:44,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:15:44,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:15:44,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:15:44,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:15:44,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:15:44,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:15:44,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (1/1) ... [2024-10-11 17:15:44,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:44,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:15:44,517 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:15:44,520 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:15:44,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:15:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:15:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:15:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:15:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:15:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:15:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:15:44,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:15:44,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:15:44,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:15:44,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:15:44,578 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:15:44,691 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:15:44,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:15:45,281 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:15:45,281 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:15:45,306 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:15:45,306 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 17:15:45,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:45 BoogieIcfgContainer [2024-10-11 17:15:45,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:15:45,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:15:45,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:15:45,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:15:45,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:15:44" (1/3) ... [2024-10-11 17:15:45,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453e9d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:45, skipping insertion in model container [2024-10-11 17:15:45,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:44" (2/3) ... [2024-10-11 17:15:45,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453e9d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:45, skipping insertion in model container [2024-10-11 17:15:45,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:45" (3/3) ... [2024-10-11 17:15:45,314 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2024-10-11 17:15:45,327 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:15:45,328 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 73 error locations. [2024-10-11 17:15:45,328 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:15:45,451 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:15:45,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 680 places, 706 transitions, 1426 flow [2024-10-11 17:15:45,707 INFO L124 PetriNetUnfolderBase]: 33/704 cut-off events. [2024-10-11 17:15:45,707 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:15:45,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 704 events. 33/704 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1858 event pairs, 0 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 457. Up to 2 conditions per place. [2024-10-11 17:15:45,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 680 places, 706 transitions, 1426 flow [2024-10-11 17:15:45,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 662 places, 687 transitions, 1386 flow [2024-10-11 17:15:45,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:15:45,747 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;@572b2afa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:15:45,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 123 error locations. [2024-10-11 17:15:45,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:15:45,750 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-11 17:15:45,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:15:45,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:45,750 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:45,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:45,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1199725653, now seen corresponding path program 1 times [2024-10-11 17:15:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:45,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509493869] [2024-10-11 17:15:45,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:45,904 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:15:45,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509493869] [2024-10-11 17:15:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509493869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:45,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:45,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369862822] [2024-10-11 17:15:45,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:45,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:45,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:45,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:46,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 706 [2024-10-11 17:15:46,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 687 transitions, 1386 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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:15:46,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:46,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 706 [2024-10-11 17:15:46,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:46,340 INFO L124 PetriNetUnfolderBase]: 28/1966 cut-off events. [2024-10-11 17:15:46,341 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-10-11 17:15:46,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1966 events. 28/1966 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 10172 event pairs, 6 based on Foata normal form. 82/1739 useless extension candidates. Maximal degree in co-relation 1769. Up to 32 conditions per place. [2024-10-11 17:15:46,355 INFO L140 encePairwiseOnDemand]: 681/706 looper letters, 19 selfloop transitions, 2 changer transitions 3/664 dead transitions. [2024-10-11 17:15:46,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 664 transitions, 1382 flow [2024-10-11 17:15:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2024-10-11 17:15:46,376 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542020774315392 [2024-10-11 17:15:46,380 INFO L175 Difference]: Start difference. First operand has 662 places, 687 transitions, 1386 flow. Second operand 3 states and 2021 transitions. [2024-10-11 17:15:46,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 664 transitions, 1382 flow [2024-10-11 17:15:46,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 664 transitions, 1374 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:15:46,399 INFO L231 Difference]: Finished difference. Result has 659 places, 661 transitions, 1330 flow [2024-10-11 17:15:46,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=659, PETRI_TRANSITIONS=661} [2024-10-11 17:15:46,405 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -3 predicate places. [2024-10-11 17:15:46,405 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 661 transitions, 1330 flow [2024-10-11 17:15:46,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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:15:46,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:46,407 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:46,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:15:46,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:46,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash -424455180, now seen corresponding path program 1 times [2024-10-11 17:15:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:46,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766746848] [2024-10-11 17:15:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:46,471 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:15:46,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766746848] [2024-10-11 17:15:46,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766746848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:46,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:46,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193187541] [2024-10-11 17:15:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:46,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:46,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:46,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 706 [2024-10-11 17:15:46,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 661 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:15:46,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:46,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 706 [2024-10-11 17:15:46,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:46,657 INFO L124 PetriNetUnfolderBase]: 19/880 cut-off events. [2024-10-11 17:15:46,658 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-11 17:15:46,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 880 events. 19/880 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3056 event pairs, 6 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 883. Up to 29 conditions per place. [2024-10-11 17:15:46,669 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 14 selfloop transitions, 2 changer transitions 0/660 dead transitions. [2024-10-11 17:15:46,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 660 transitions, 1360 flow [2024-10-11 17:15:46,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2024-10-11 17:15:46,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9485363550519358 [2024-10-11 17:15:46,673 INFO L175 Difference]: Start difference. First operand has 659 places, 661 transitions, 1330 flow. Second operand 3 states and 2009 transitions. [2024-10-11 17:15:46,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 660 transitions, 1360 flow [2024-10-11 17:15:46,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 660 transitions, 1356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:46,681 INFO L231 Difference]: Finished difference. Result has 655 places, 660 transitions, 1328 flow [2024-10-11 17:15:46,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=655, PETRI_TRANSITIONS=660} [2024-10-11 17:15:46,682 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -7 predicate places. [2024-10-11 17:15:46,682 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 660 transitions, 1328 flow [2024-10-11 17:15:46,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:15:46,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:46,684 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:46,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:15:46,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:46,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash -472914400, now seen corresponding path program 1 times [2024-10-11 17:15:46,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735350414] [2024-10-11 17:15:46,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:46,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:46,735 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:15:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735350414] [2024-10-11 17:15:46,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735350414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:46,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:46,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:46,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639507772] [2024-10-11 17:15:46,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:46,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:46,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:46,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:46,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 706 [2024-10-11 17:15:46,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 660 transitions, 1328 flow. Second operand has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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:15:46,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:46,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 706 [2024-10-11 17:15:46,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:46,864 INFO L124 PetriNetUnfolderBase]: 13/876 cut-off events. [2024-10-11 17:15:46,864 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-10-11 17:15:46,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 876 events. 13/876 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2718 event pairs, 1 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 854. Up to 11 conditions per place. [2024-10-11 17:15:46,876 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 8 selfloop transitions, 2 changer transitions 0/659 dead transitions. [2024-10-11 17:15:46,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 659 transitions, 1346 flow [2024-10-11 17:15:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2024-10-11 17:15:46,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542020774315392 [2024-10-11 17:15:46,879 INFO L175 Difference]: Start difference. First operand has 655 places, 660 transitions, 1328 flow. Second operand 3 states and 2021 transitions. [2024-10-11 17:15:46,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 659 transitions, 1346 flow [2024-10-11 17:15:46,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 659 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:46,887 INFO L231 Difference]: Finished difference. Result has 654 places, 659 transitions, 1326 flow [2024-10-11 17:15:46,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1326, PETRI_PLACES=654, PETRI_TRANSITIONS=659} [2024-10-11 17:15:46,888 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -8 predicate places. [2024-10-11 17:15:46,888 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 659 transitions, 1326 flow [2024-10-11 17:15:46,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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:15:46,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:46,890 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:46,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:15:46,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:46,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1445387779, now seen corresponding path program 1 times [2024-10-11 17:15:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:46,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033302719] [2024-10-11 17:15:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:46,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:46,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:46,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033302719] [2024-10-11 17:15:46,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033302719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:46,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:46,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787134585] [2024-10-11 17:15:46,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:46,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:46,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:46,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:46,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 706 [2024-10-11 17:15:46,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 659 transitions, 1326 flow. Second operand has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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:15:46,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:46,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 706 [2024-10-11 17:15:46,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:47,053 INFO L124 PetriNetUnfolderBase]: 11/660 cut-off events. [2024-10-11 17:15:47,054 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-11 17:15:47,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 660 events. 11/660 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1841 event pairs, 1 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 629. Up to 11 conditions per place. [2024-10-11 17:15:47,062 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 8 selfloop transitions, 2 changer transitions 0/658 dead transitions. [2024-10-11 17:15:47,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 658 transitions, 1344 flow [2024-10-11 17:15:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2024-10-11 17:15:47,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542020774315392 [2024-10-11 17:15:47,066 INFO L175 Difference]: Start difference. First operand has 654 places, 659 transitions, 1326 flow. Second operand 3 states and 2021 transitions. [2024-10-11 17:15:47,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 658 transitions, 1344 flow [2024-10-11 17:15:47,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 658 transitions, 1340 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:47,073 INFO L231 Difference]: Finished difference. Result has 653 places, 658 transitions, 1324 flow [2024-10-11 17:15:47,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1324, PETRI_PLACES=653, PETRI_TRANSITIONS=658} [2024-10-11 17:15:47,074 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -9 predicate places. [2024-10-11 17:15:47,074 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 658 transitions, 1324 flow [2024-10-11 17:15:47,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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:15:47,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:47,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:47,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:15:47,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:47,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1186604938, now seen corresponding path program 1 times [2024-10-11 17:15:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:47,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543624249] [2024-10-11 17:15:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:47,121 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:15:47,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:47,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543624249] [2024-10-11 17:15:47,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543624249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:47,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:47,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:47,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400030244] [2024-10-11 17:15:47,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:47,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:47,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:47,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:47,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:47,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 706 [2024-10-11 17:15:47,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 658 transitions, 1324 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:15:47,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:47,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 706 [2024-10-11 17:15:47,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:47,366 INFO L124 PetriNetUnfolderBase]: 22/1525 cut-off events. [2024-10-11 17:15:47,367 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-11 17:15:47,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1525 events. 22/1525 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7049 event pairs, 4 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 1501. Up to 22 conditions per place. [2024-10-11 17:15:47,380 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 13 selfloop transitions, 2 changer transitions 0/657 dead transitions. [2024-10-11 17:15:47,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 657 transitions, 1352 flow [2024-10-11 17:15:47,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2024-10-11 17:15:47,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.949480642115203 [2024-10-11 17:15:47,387 INFO L175 Difference]: Start difference. First operand has 653 places, 658 transitions, 1324 flow. Second operand 3 states and 2011 transitions. [2024-10-11 17:15:47,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 657 transitions, 1352 flow [2024-10-11 17:15:47,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 657 transitions, 1348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:47,402 INFO L231 Difference]: Finished difference. Result has 652 places, 657 transitions, 1322 flow [2024-10-11 17:15:47,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=652, PETRI_TRANSITIONS=657} [2024-10-11 17:15:47,403 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -10 predicate places. [2024-10-11 17:15:47,403 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 657 transitions, 1322 flow [2024-10-11 17:15:47,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:15:47,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:47,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:47,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:15:47,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:47,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1273069341, now seen corresponding path program 1 times [2024-10-11 17:15:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060141382] [2024-10-11 17:15:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:47,433 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:15:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060141382] [2024-10-11 17:15:47,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060141382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:47,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:47,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949662784] [2024-10-11 17:15:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:47,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:47,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:47,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:47,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:47,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 706 [2024-10-11 17:15:47,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 657 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:15:47,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:47,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 706 [2024-10-11 17:15:47,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:47,563 INFO L124 PetriNetUnfolderBase]: 14/701 cut-off events. [2024-10-11 17:15:47,563 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-10-11 17:15:47,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 701 events. 14/701 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2226 event pairs, 4 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 665. Up to 22 conditions per place. [2024-10-11 17:15:47,575 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 13 selfloop transitions, 2 changer transitions 0/656 dead transitions. [2024-10-11 17:15:47,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 656 transitions, 1350 flow [2024-10-11 17:15:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2024-10-11 17:15:47,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.949480642115203 [2024-10-11 17:15:47,579 INFO L175 Difference]: Start difference. First operand has 652 places, 657 transitions, 1322 flow. Second operand 3 states and 2011 transitions. [2024-10-11 17:15:47,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 656 transitions, 1350 flow [2024-10-11 17:15:47,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 656 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:47,587 INFO L231 Difference]: Finished difference. Result has 651 places, 656 transitions, 1320 flow [2024-10-11 17:15:47,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1320, PETRI_PLACES=651, PETRI_TRANSITIONS=656} [2024-10-11 17:15:47,589 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -11 predicate places. [2024-10-11 17:15:47,590 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 656 transitions, 1320 flow [2024-10-11 17:15:47,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:15:47,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:47,591 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] [2024-10-11 17:15:47,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:15:47,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:47,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1273970532, now seen corresponding path program 1 times [2024-10-11 17:15:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:47,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468554031] [2024-10-11 17:15:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:47,642 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:15:47,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:47,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468554031] [2024-10-11 17:15:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468554031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:47,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:47,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352123102] [2024-10-11 17:15:47,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:47,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:47,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:47,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:47,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 706 [2024-10-11 17:15:47,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 656 transitions, 1320 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:15:47,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:47,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 706 [2024-10-11 17:15:47,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:47,849 INFO L124 PetriNetUnfolderBase]: 18/874 cut-off events. [2024-10-11 17:15:47,849 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:15:47,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 874 events. 18/874 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3325 event pairs, 6 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 842. Up to 28 conditions per place. [2024-10-11 17:15:47,862 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 14 selfloop transitions, 2 changer transitions 0/655 dead transitions. [2024-10-11 17:15:47,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 655 transitions, 1350 flow [2024-10-11 17:15:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2024-10-11 17:15:47,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9485363550519358 [2024-10-11 17:15:47,866 INFO L175 Difference]: Start difference. First operand has 651 places, 656 transitions, 1320 flow. Second operand 3 states and 2009 transitions. [2024-10-11 17:15:47,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 655 transitions, 1350 flow [2024-10-11 17:15:47,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 655 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:47,875 INFO L231 Difference]: Finished difference. Result has 650 places, 655 transitions, 1318 flow [2024-10-11 17:15:47,876 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1318, PETRI_PLACES=650, PETRI_TRANSITIONS=655} [2024-10-11 17:15:47,877 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -12 predicate places. [2024-10-11 17:15:47,878 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 655 transitions, 1318 flow [2024-10-11 17:15:47,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:15:47,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:47,879 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] [2024-10-11 17:15:47,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:15:47,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:47,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash 823168958, now seen corresponding path program 1 times [2024-10-11 17:15:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:47,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38945139] [2024-10-11 17:15:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:47,918 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:15:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38945139] [2024-10-11 17:15:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38945139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653986113] [2024-10-11 17:15:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:47,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:47,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:47,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:47,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 706 [2024-10-11 17:15:47,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 655 transitions, 1318 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:15:47,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:47,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 706 [2024-10-11 17:15:47,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:48,067 INFO L124 PetriNetUnfolderBase]: 18/873 cut-off events. [2024-10-11 17:15:48,068 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-11 17:15:48,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 873 events. 18/873 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3104 event pairs, 6 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 827. Up to 28 conditions per place. [2024-10-11 17:15:48,079 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 14 selfloop transitions, 2 changer transitions 0/654 dead transitions. [2024-10-11 17:15:48,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 654 transitions, 1348 flow [2024-10-11 17:15:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2024-10-11 17:15:48,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9485363550519358 [2024-10-11 17:15:48,083 INFO L175 Difference]: Start difference. First operand has 650 places, 655 transitions, 1318 flow. Second operand 3 states and 2009 transitions. [2024-10-11 17:15:48,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 654 transitions, 1348 flow [2024-10-11 17:15:48,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 654 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:48,090 INFO L231 Difference]: Finished difference. Result has 649 places, 654 transitions, 1316 flow [2024-10-11 17:15:48,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=649, PETRI_TRANSITIONS=654} [2024-10-11 17:15:48,092 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -13 predicate places. [2024-10-11 17:15:48,092 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 654 transitions, 1316 flow [2024-10-11 17:15:48,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:15:48,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:48,093 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] [2024-10-11 17:15:48,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:15:48,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:48,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1077315636, now seen corresponding path program 1 times [2024-10-11 17:15:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316685317] [2024-10-11 17:15:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:48,129 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:15:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316685317] [2024-10-11 17:15:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316685317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:48,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:48,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327300582] [2024-10-11 17:15:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:48,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:48,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:48,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 706 [2024-10-11 17:15:48,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 654 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:15:48,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:48,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 706 [2024-10-11 17:15:48,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:48,260 INFO L124 PetriNetUnfolderBase]: 17/1083 cut-off events. [2024-10-11 17:15:48,260 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:15:48,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 1083 events. 17/1083 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4826 event pairs, 3 based on Foata normal form. 0/925 useless extension candidates. Maximal degree in co-relation 1021. Up to 19 conditions per place. [2024-10-11 17:15:48,272 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 10 selfloop transitions, 2 changer transitions 0/653 dead transitions. [2024-10-11 17:15:48,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 653 transitions, 1338 flow [2024-10-11 17:15:48,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2017 transitions. [2024-10-11 17:15:48,275 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9523135033050047 [2024-10-11 17:15:48,275 INFO L175 Difference]: Start difference. First operand has 649 places, 654 transitions, 1316 flow. Second operand 3 states and 2017 transitions. [2024-10-11 17:15:48,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 653 transitions, 1338 flow [2024-10-11 17:15:48,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 653 transitions, 1334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:48,282 INFO L231 Difference]: Finished difference. Result has 648 places, 653 transitions, 1314 flow [2024-10-11 17:15:48,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1314, PETRI_PLACES=648, PETRI_TRANSITIONS=653} [2024-10-11 17:15:48,284 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -14 predicate places. [2024-10-11 17:15:48,284 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 653 transitions, 1314 flow [2024-10-11 17:15:48,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:15:48,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:48,285 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:48,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:15:48,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:48,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1233095483, now seen corresponding path program 1 times [2024-10-11 17:15:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674386900] [2024-10-11 17:15:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:48,324 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:15:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674386900] [2024-10-11 17:15:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674386900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:48,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:48,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:48,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265381120] [2024-10-11 17:15:48,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:48,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:48,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:48,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:48,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:48,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 706 [2024-10-11 17:15:48,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 653 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:15:48,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:48,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 706 [2024-10-11 17:15:48,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:48,492 INFO L124 PetriNetUnfolderBase]: 29/1717 cut-off events. [2024-10-11 17:15:48,492 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:15:48,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 1717 events. 29/1717 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 9696 event pairs, 8 based on Foata normal form. 0/1462 useless extension candidates. Maximal degree in co-relation 1661. Up to 32 conditions per place. [2024-10-11 17:15:48,509 INFO L140 encePairwiseOnDemand]: 702/706 looper letters, 10 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2024-10-11 17:15:48,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 650 transitions, 1330 flow [2024-10-11 17:15:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2024-10-11 17:15:48,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9527856468366384 [2024-10-11 17:15:48,513 INFO L175 Difference]: Start difference. First operand has 648 places, 653 transitions, 1314 flow. Second operand 3 states and 2018 transitions. [2024-10-11 17:15:48,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 650 transitions, 1330 flow [2024-10-11 17:15:48,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 650 transitions, 1326 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:48,522 INFO L231 Difference]: Finished difference. Result has 645 places, 650 transitions, 1306 flow [2024-10-11 17:15:48,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=645, PETRI_TRANSITIONS=650} [2024-10-11 17:15:48,523 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -17 predicate places. [2024-10-11 17:15:48,524 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 650 transitions, 1306 flow [2024-10-11 17:15:48,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:15:48,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:48,525 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:48,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:15:48,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:48,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1541767593, now seen corresponding path program 1 times [2024-10-11 17:15:48,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:48,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472525132] [2024-10-11 17:15:48,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:48,946 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:15:48,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:48,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472525132] [2024-10-11 17:15:48,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472525132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:48,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:48,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:15:48,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429597164] [2024-10-11 17:15:48,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:15:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:15:48,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:15:49,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 640 out of 706 [2024-10-11 17:15:49,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 650 transitions, 1306 flow. Second operand has 6 states, 6 states have (on average 641.5) internal successors, (3849), 6 states have internal predecessors, (3849), 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:15:49,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:49,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 640 of 706 [2024-10-11 17:15:49,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:49,539 INFO L124 PetriNetUnfolderBase]: 244/4163 cut-off events. [2024-10-11 17:15:49,540 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2024-10-11 17:15:49,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 4163 events. 244/4163 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 32057 event pairs, 168 based on Foata normal form. 0/3508 useless extension candidates. Maximal degree in co-relation 4509. Up to 421 conditions per place. [2024-10-11 17:15:49,561 INFO L140 encePairwiseOnDemand]: 700/706 looper letters, 36 selfloop transitions, 5 changer transitions 0/649 dead transitions. [2024-10-11 17:15:49,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 649 transitions, 1386 flow [2024-10-11 17:15:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:15:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:15:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3882 transitions. [2024-10-11 17:15:49,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9164305949008499 [2024-10-11 17:15:49,567 INFO L175 Difference]: Start difference. First operand has 645 places, 650 transitions, 1306 flow. Second operand 6 states and 3882 transitions. [2024-10-11 17:15:49,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 649 transitions, 1386 flow [2024-10-11 17:15:49,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 649 transitions, 1385 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:49,573 INFO L231 Difference]: Finished difference. Result has 648 places, 649 transitions, 1313 flow [2024-10-11 17:15:49,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1313, PETRI_PLACES=648, PETRI_TRANSITIONS=649} [2024-10-11 17:15:49,575 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -14 predicate places. [2024-10-11 17:15:49,576 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 649 transitions, 1313 flow [2024-10-11 17:15:49,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 641.5) internal successors, (3849), 6 states have internal predecessors, (3849), 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:15:49,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:49,579 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] [2024-10-11 17:15:49,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:15:49,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:49,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash -771150762, now seen corresponding path program 1 times [2024-10-11 17:15:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:49,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249819936] [2024-10-11 17:15:49,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:49,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:49,610 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:15:49,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249819936] [2024-10-11 17:15:49,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249819936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:49,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:49,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:49,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337017497] [2024-10-11 17:15:49,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:49,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:49,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 706 [2024-10-11 17:15:49,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 649 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:15:49,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:49,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 706 [2024-10-11 17:15:49,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:49,851 INFO L124 PetriNetUnfolderBase]: 34/1521 cut-off events. [2024-10-11 17:15:49,851 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-11 17:15:49,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 1521 events. 34/1521 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7600 event pairs, 15 based on Foata normal form. 0/1298 useless extension candidates. Maximal degree in co-relation 1564. Up to 46 conditions per place. [2024-10-11 17:15:49,860 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 13 selfloop transitions, 2 changer transitions 0/648 dead transitions. [2024-10-11 17:15:49,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 648 transitions, 1341 flow [2024-10-11 17:15:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2024-10-11 17:15:49,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.949480642115203 [2024-10-11 17:15:49,864 INFO L175 Difference]: Start difference. First operand has 648 places, 649 transitions, 1313 flow. Second operand 3 states and 2011 transitions. [2024-10-11 17:15:49,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 648 transitions, 1341 flow [2024-10-11 17:15:49,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 648 transitions, 1331 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:15:49,871 INFO L231 Difference]: Finished difference. Result has 644 places, 648 transitions, 1305 flow [2024-10-11 17:15:49,871 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=644, PETRI_TRANSITIONS=648} [2024-10-11 17:15:49,873 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -18 predicate places. [2024-10-11 17:15:49,873 INFO L471 AbstractCegarLoop]: Abstraction has has 644 places, 648 transitions, 1305 flow [2024-10-11 17:15:49,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:15:49,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:49,874 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] [2024-10-11 17:15:49,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:15:49,874 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:49,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash 421043245, now seen corresponding path program 1 times [2024-10-11 17:15:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:49,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936931469] [2024-10-11 17:15:49,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:49,904 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:15:49,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936931469] [2024-10-11 17:15:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936931469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191919422] [2024-10-11 17:15:49,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:49,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:49,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:49,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:49,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 706 [2024-10-11 17:15:49,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 648 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 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:15:49,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:49,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 706 [2024-10-11 17:15:49,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,072 INFO L124 PetriNetUnfolderBase]: 28/1297 cut-off events. [2024-10-11 17:15:50,072 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-11 17:15:50,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 1297 events. 28/1297 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6709 event pairs, 8 based on Foata normal form. 0/1124 useless extension candidates. Maximal degree in co-relation 1268. Up to 44 conditions per place. [2024-10-11 17:15:50,083 INFO L140 encePairwiseOnDemand]: 691/706 looper letters, 25 selfloop transitions, 5 changer transitions 0/641 dead transitions. [2024-10-11 17:15:50,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 641 transitions, 1352 flow [2024-10-11 17:15:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2024-10-11 17:15:50,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9324834749763928 [2024-10-11 17:15:50,086 INFO L175 Difference]: Start difference. First operand has 644 places, 648 transitions, 1305 flow. Second operand 3 states and 1975 transitions. [2024-10-11 17:15:50,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 641 transitions, 1352 flow [2024-10-11 17:15:50,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 641 transitions, 1348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:50,095 INFO L231 Difference]: Finished difference. Result has 635 places, 640 transitions, 1304 flow [2024-10-11 17:15:50,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=635, PETRI_TRANSITIONS=640} [2024-10-11 17:15:50,096 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -27 predicate places. [2024-10-11 17:15:50,097 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 640 transitions, 1304 flow [2024-10-11 17:15:50,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 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:15:50,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,098 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] [2024-10-11 17:15:50,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:15:50,098 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:50,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,099 INFO L85 PathProgramCache]: Analyzing trace with hash 895675511, now seen corresponding path program 1 times [2024-10-11 17:15:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058934382] [2024-10-11 17:15:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,120 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:15:50,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058934382] [2024-10-11 17:15:50,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058934382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990330805] [2024-10-11 17:15:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 706 [2024-10-11 17:15:50,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 640 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 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:15:50,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 706 [2024-10-11 17:15:50,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,287 INFO L124 PetriNetUnfolderBase]: 25/876 cut-off events. [2024-10-11 17:15:50,288 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-10-11 17:15:50,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 876 events. 25/876 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3209 event pairs, 8 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 835. Up to 34 conditions per place. [2024-10-11 17:15:50,298 INFO L140 encePairwiseOnDemand]: 696/706 looper letters, 15 selfloop transitions, 5 changer transitions 0/638 dead transitions. [2024-10-11 17:15:50,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 638 transitions, 1341 flow [2024-10-11 17:15:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2005 transitions. [2024-10-11 17:15:50,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9466477809254014 [2024-10-11 17:15:50,305 INFO L175 Difference]: Start difference. First operand has 635 places, 640 transitions, 1304 flow. Second operand 3 states and 2005 transitions. [2024-10-11 17:15:50,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 638 transitions, 1341 flow [2024-10-11 17:15:50,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 638 transitions, 1336 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:50,313 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1312 flow [2024-10-11 17:15:50,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=632, PETRI_TRANSITIONS=637} [2024-10-11 17:15:50,314 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -30 predicate places. [2024-10-11 17:15:50,314 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1312 flow [2024-10-11 17:15:50,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 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:15:50,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,316 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] [2024-10-11 17:15:50,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:15:50,316 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash -582735692, now seen corresponding path program 1 times [2024-10-11 17:15:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807683829] [2024-10-11 17:15:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807683829] [2024-10-11 17:15:50,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807683829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487365992] [2024-10-11 17:15:50,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,368 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 706 [2024-10-11 17:15:50,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 637 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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:15:50,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 706 [2024-10-11 17:15:50,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,604 INFO L124 PetriNetUnfolderBase]: 40/1573 cut-off events. [2024-10-11 17:15:50,604 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2024-10-11 17:15:50,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 1573 events. 40/1573 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 7279 event pairs, 2 based on Foata normal form. 0/1373 useless extension candidates. Maximal degree in co-relation 1578. Up to 30 conditions per place. [2024-10-11 17:15:50,623 INFO L140 encePairwiseOnDemand]: 696/706 looper letters, 13 selfloop transitions, 6 changer transitions 0/637 dead transitions. [2024-10-11 17:15:50,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 637 transitions, 1352 flow [2024-10-11 17:15:50,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2024-10-11 17:15:50,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9499527856468366 [2024-10-11 17:15:50,626 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1312 flow. Second operand 3 states and 2012 transitions. [2024-10-11 17:15:50,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 637 transitions, 1352 flow [2024-10-11 17:15:50,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 637 transitions, 1347 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:50,633 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1325 flow [2024-10-11 17:15:50,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=630, PETRI_TRANSITIONS=635} [2024-10-11 17:15:50,634 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -32 predicate places. [2024-10-11 17:15:50,634 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1325 flow [2024-10-11 17:15:50,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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:15:50,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,636 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] [2024-10-11 17:15:50,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:15:50,636 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:50,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1528377432, now seen corresponding path program 1 times [2024-10-11 17:15:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470074299] [2024-10-11 17:15:50,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,671 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:15:50,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470074299] [2024-10-11 17:15:50,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470074299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585815280] [2024-10-11 17:15:50,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 706 [2024-10-11 17:15:50,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 635 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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:15:50,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 706 [2024-10-11 17:15:50,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,917 INFO L124 PetriNetUnfolderBase]: 53/1813 cut-off events. [2024-10-11 17:15:50,917 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-10-11 17:15:50,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 1813 events. 53/1813 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10980 event pairs, 2 based on Foata normal form. 1/1588 useless extension candidates. Maximal degree in co-relation 1851. Up to 43 conditions per place. [2024-10-11 17:15:50,943 INFO L140 encePairwiseOnDemand]: 696/706 looper letters, 12 selfloop transitions, 5 changer transitions 4/636 dead transitions. [2024-10-11 17:15:50,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 636 transitions, 1368 flow [2024-10-11 17:15:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2024-10-11 17:15:50,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9499527856468366 [2024-10-11 17:15:50,946 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1325 flow. Second operand 3 states and 2012 transitions. [2024-10-11 17:15:50,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 636 transitions, 1368 flow [2024-10-11 17:15:50,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 636 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:50,954 INFO L231 Difference]: Finished difference. Result has 628 places, 629 transitions, 1323 flow [2024-10-11 17:15:50,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1323, PETRI_PLACES=628, PETRI_TRANSITIONS=629} [2024-10-11 17:15:50,955 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -34 predicate places. [2024-10-11 17:15:50,955 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 629 transitions, 1323 flow [2024-10-11 17:15:50,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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:15:50,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,956 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] [2024-10-11 17:15:50,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:15:50,956 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:50,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1829852726, now seen corresponding path program 1 times [2024-10-11 17:15:50,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274098749] [2024-10-11 17:15:50,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274098749] [2024-10-11 17:15:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274098749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448639220] [2024-10-11 17:15:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 706 [2024-10-11 17:15:51,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 629 transitions, 1323 flow. Second operand has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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:15:51,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 706 [2024-10-11 17:15:51,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,338 INFO L124 PetriNetUnfolderBase]: 129/3255 cut-off events. [2024-10-11 17:15:51,339 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:15:51,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3660 conditions, 3255 events. 129/3255 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 25019 event pairs, 4 based on Foata normal form. 0/2879 useless extension candidates. Maximal degree in co-relation 3559. Up to 158 conditions per place. [2024-10-11 17:15:51,360 INFO L140 encePairwiseOnDemand]: 697/706 looper letters, 17 selfloop transitions, 3 changer transitions 0/626 dead transitions. [2024-10-11 17:15:51,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 626 transitions, 1359 flow [2024-10-11 17:15:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2000 transitions. [2024-10-11 17:15:51,363 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442870632672332 [2024-10-11 17:15:51,363 INFO L175 Difference]: Start difference. First operand has 628 places, 629 transitions, 1323 flow. Second operand 3 states and 2000 transitions. [2024-10-11 17:15:51,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 626 transitions, 1359 flow [2024-10-11 17:15:51,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 626 transitions, 1354 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:51,370 INFO L231 Difference]: Finished difference. Result has 620 places, 624 transitions, 1319 flow [2024-10-11 17:15:51,371 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1319, PETRI_PLACES=620, PETRI_TRANSITIONS=624} [2024-10-11 17:15:51,371 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -42 predicate places. [2024-10-11 17:15:51,371 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 624 transitions, 1319 flow [2024-10-11 17:15:51,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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:15:51,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,372 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:51,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:15:51,372 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:51,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1686688577, now seen corresponding path program 1 times [2024-10-11 17:15:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389515961] [2024-10-11 17:15:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,393 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:15:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389515961] [2024-10-11 17:15:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389515961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561013872] [2024-10-11 17:15:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 706 [2024-10-11 17:15:51,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 624 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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:15:51,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 706 [2024-10-11 17:15:51,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,836 INFO L124 PetriNetUnfolderBase]: 122/3768 cut-off events. [2024-10-11 17:15:51,837 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2024-10-11 17:15:51,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4229 conditions, 3768 events. 122/3768 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 31107 event pairs, 20 based on Foata normal form. 0/3397 useless extension candidates. Maximal degree in co-relation 4127. Up to 176 conditions per place. [2024-10-11 17:15:51,860 INFO L140 encePairwiseOnDemand]: 697/706 looper letters, 18 selfloop transitions, 3 changer transitions 0/622 dead transitions. [2024-10-11 17:15:51,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 622 transitions, 1360 flow [2024-10-11 17:15:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2001 transitions. [2024-10-11 17:15:51,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9447592067988668 [2024-10-11 17:15:51,863 INFO L175 Difference]: Start difference. First operand has 620 places, 624 transitions, 1319 flow. Second operand 3 states and 2001 transitions. [2024-10-11 17:15:51,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 622 transitions, 1360 flow [2024-10-11 17:15:51,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 622 transitions, 1357 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:51,870 INFO L231 Difference]: Finished difference. Result has 616 places, 619 transitions, 1317 flow [2024-10-11 17:15:51,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=616, PETRI_TRANSITIONS=619} [2024-10-11 17:15:51,871 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -46 predicate places. [2024-10-11 17:15:51,871 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 619 transitions, 1317 flow [2024-10-11 17:15:51,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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:15:51,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,872 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:15:51,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:15:51,872 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 134985541, now seen corresponding path program 1 times [2024-10-11 17:15:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29281637] [2024-10-11 17:15:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,900 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:15:51,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29281637] [2024-10-11 17:15:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29281637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644445091] [2024-10-11 17:15:51,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 706 [2024-10-11 17:15:51,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 619 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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:15:51,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 706 [2024-10-11 17:15:51,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:53,029 INFO L124 PetriNetUnfolderBase]: 354/9609 cut-off events. [2024-10-11 17:15:53,029 INFO L125 PetriNetUnfolderBase]: For 59/63 co-relation queries the response was YES. [2024-10-11 17:15:53,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10800 conditions, 9609 events. 354/9609 cut-off events. For 59/63 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 98014 event pairs, 88 based on Foata normal form. 0/8697 useless extension candidates. Maximal degree in co-relation 10698. Up to 467 conditions per place. [2024-10-11 17:15:53,103 INFO L140 encePairwiseOnDemand]: 698/706 looper letters, 18 selfloop transitions, 2 changer transitions 0/617 dead transitions. [2024-10-11 17:15:53,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 617 transitions, 1355 flow [2024-10-11 17:15:53,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2003 transitions. [2024-10-11 17:15:53,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.945703493862134 [2024-10-11 17:15:53,107 INFO L175 Difference]: Start difference. First operand has 616 places, 619 transitions, 1317 flow. Second operand 3 states and 2003 transitions. [2024-10-11 17:15:53,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 617 transitions, 1355 flow [2024-10-11 17:15:53,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 617 transitions, 1352 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:53,115 INFO L231 Difference]: Finished difference. Result has 612 places, 615 transitions, 1316 flow [2024-10-11 17:15:53,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=612, PETRI_TRANSITIONS=615} [2024-10-11 17:15:53,116 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -50 predicate places. [2024-10-11 17:15:53,116 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 615 transitions, 1316 flow [2024-10-11 17:15:53,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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:15:53,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:53,117 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:15:53,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:15:53,117 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash 168202096, now seen corresponding path program 1 times [2024-10-11 17:15:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661921576] [2024-10-11 17:15:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:53,481 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:15:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:53,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661921576] [2024-10-11 17:15:53,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661921576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:53,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:53,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:15:53,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240080724] [2024-10-11 17:15:53,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:53,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:15:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:53,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:15:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:15:53,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 706 [2024-10-11 17:15:53,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 615 transitions, 1316 flow. Second operand has 6 states, 6 states have (on average 652.6666666666666) internal successors, (3916), 6 states have internal predecessors, (3916), 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:15:53,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:53,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 706 [2024-10-11 17:15:53,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:54,432 INFO L124 PetriNetUnfolderBase]: 233/5969 cut-off events. [2024-10-11 17:15:54,432 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2024-10-11 17:15:54,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6890 conditions, 5969 events. 233/5969 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 52379 event pairs, 8 based on Foata normal form. 0/5473 useless extension candidates. Maximal degree in co-relation 6784. Up to 228 conditions per place. [2024-10-11 17:15:54,466 INFO L140 encePairwiseOnDemand]: 698/706 looper letters, 26 selfloop transitions, 5 changer transitions 0/616 dead transitions. [2024-10-11 17:15:54,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 616 transitions, 1384 flow [2024-10-11 17:15:54,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:15:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:15:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2024-10-11 17:15:54,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9301227573182247 [2024-10-11 17:15:54,472 INFO L175 Difference]: Start difference. First operand has 612 places, 615 transitions, 1316 flow. Second operand 6 states and 3940 transitions. [2024-10-11 17:15:54,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 616 transitions, 1384 flow [2024-10-11 17:15:54,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 616 transitions, 1384 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:54,478 INFO L231 Difference]: Finished difference. Result has 614 places, 612 transitions, 1320 flow [2024-10-11 17:15:54,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1320, PETRI_PLACES=614, PETRI_TRANSITIONS=612} [2024-10-11 17:15:54,479 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -48 predicate places. [2024-10-11 17:15:54,479 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 612 transitions, 1320 flow [2024-10-11 17:15:54,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 652.6666666666666) internal successors, (3916), 6 states have internal predecessors, (3916), 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:15:54,480 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:54,480 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] [2024-10-11 17:15:54,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:15:54,480 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:54,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash -774491270, now seen corresponding path program 1 times [2024-10-11 17:15:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:54,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153697317] [2024-10-11 17:15:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:54,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:54,773 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:15:54,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:54,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153697317] [2024-10-11 17:15:54,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153697317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:54,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:54,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:15:54,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885950183] [2024-10-11 17:15:54,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:54,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:15:54,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:54,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:15:54,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:15:54,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 706 [2024-10-11 17:15:54,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 612 transitions, 1320 flow. Second operand has 6 states, 6 states have (on average 652.8333333333334) internal successors, (3917), 6 states have internal predecessors, (3917), 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:15:54,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:54,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 706 [2024-10-11 17:15:54,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:55,442 INFO L124 PetriNetUnfolderBase]: 160/4614 cut-off events. [2024-10-11 17:15:55,443 INFO L125 PetriNetUnfolderBase]: For 62/70 co-relation queries the response was YES. [2024-10-11 17:15:55,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 4614 events. 160/4614 cut-off events. For 62/70 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 39444 event pairs, 0 based on Foata normal form. 0/4242 useless extension candidates. Maximal degree in co-relation 5224. Up to 171 conditions per place. [2024-10-11 17:15:55,479 INFO L140 encePairwiseOnDemand]: 698/706 looper letters, 26 selfloop transitions, 5 changer transitions 0/613 dead transitions. [2024-10-11 17:15:55,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 613 transitions, 1388 flow [2024-10-11 17:15:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:15:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:15:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2024-10-11 17:15:55,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9301227573182247 [2024-10-11 17:15:55,485 INFO L175 Difference]: Start difference. First operand has 614 places, 612 transitions, 1320 flow. Second operand 6 states and 3940 transitions. [2024-10-11 17:15:55,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 613 transitions, 1388 flow [2024-10-11 17:15:55,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 613 transitions, 1378 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:15:55,491 INFO L231 Difference]: Finished difference. Result has 611 places, 609 transitions, 1314 flow [2024-10-11 17:15:55,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=611, PETRI_TRANSITIONS=609} [2024-10-11 17:15:55,492 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -51 predicate places. [2024-10-11 17:15:55,493 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 609 transitions, 1314 flow [2024-10-11 17:15:55,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 652.8333333333334) internal successors, (3917), 6 states have internal predecessors, (3917), 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:15:55,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:55,494 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] [2024-10-11 17:15:55,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:15:55,494 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:55,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:55,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1718719399, now seen corresponding path program 1 times [2024-10-11 17:15:55,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:55,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895670721] [2024-10-11 17:15:55,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:55,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:55,521 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:15:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895670721] [2024-10-11 17:15:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895670721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:55,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557921352] [2024-10-11 17:15:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:55,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:55,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:55,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:55,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 706 [2024-10-11 17:15:55,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 609 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:15:55,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:55,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 706 [2024-10-11 17:15:55,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:56,155 INFO L124 PetriNetUnfolderBase]: 208/6152 cut-off events. [2024-10-11 17:15:56,155 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-10-11 17:15:56,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 6152 events. 208/6152 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 53513 event pairs, 32 based on Foata normal form. 0/5663 useless extension candidates. Maximal degree in co-relation 6969. Up to 163 conditions per place. [2024-10-11 17:15:56,200 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2024-10-11 17:15:56,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 609 transitions, 1345 flow [2024-10-11 17:15:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2024-10-11 17:15:56,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513692162417375 [2024-10-11 17:15:56,204 INFO L175 Difference]: Start difference. First operand has 611 places, 609 transitions, 1314 flow. Second operand 3 states and 2015 transitions. [2024-10-11 17:15:56,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 609 transitions, 1345 flow [2024-10-11 17:15:56,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 609 transitions, 1335 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:15:56,213 INFO L231 Difference]: Finished difference. Result has 607 places, 608 transitions, 1306 flow [2024-10-11 17:15:56,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=607, PETRI_TRANSITIONS=608} [2024-10-11 17:15:56,214 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2024-10-11 17:15:56,214 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 608 transitions, 1306 flow [2024-10-11 17:15:56,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:15:56,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:56,215 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] [2024-10-11 17:15:56,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:15:56,215 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:56,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1621160215, now seen corresponding path program 1 times [2024-10-11 17:15:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:56,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364212515] [2024-10-11 17:15:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:56,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:56,263 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:15:56,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:56,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364212515] [2024-10-11 17:15:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364212515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:56,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:56,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311390896] [2024-10-11 17:15:56,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:56,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:56,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 706 [2024-10-11 17:15:56,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 608 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 675.3333333333334) internal successors, (2026), 3 states have internal predecessors, (2026), 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:15:56,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:56,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 706 [2024-10-11 17:15:56,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:57,030 INFO L124 PetriNetUnfolderBase]: 145/6333 cut-off events. [2024-10-11 17:15:57,030 INFO L125 PetriNetUnfolderBase]: For 20/24 co-relation queries the response was YES. [2024-10-11 17:15:57,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6954 conditions, 6333 events. 145/6333 cut-off events. For 20/24 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 54640 event pairs, 4 based on Foata normal form. 0/5861 useless extension candidates. Maximal degree in co-relation 6849. Up to 68 conditions per place. [2024-10-11 17:15:57,082 INFO L140 encePairwiseOnDemand]: 704/706 looper letters, 8 selfloop transitions, 1 changer transitions 0/610 dead transitions. [2024-10-11 17:15:57,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 610 transitions, 1330 flow [2024-10-11 17:15:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2032 transitions. [2024-10-11 17:15:57,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.959395656279509 [2024-10-11 17:15:57,086 INFO L175 Difference]: Start difference. First operand has 607 places, 608 transitions, 1306 flow. Second operand 3 states and 2032 transitions. [2024-10-11 17:15:57,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 610 transitions, 1330 flow [2024-10-11 17:15:57,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 610 transitions, 1326 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:57,094 INFO L231 Difference]: Finished difference. Result has 607 places, 608 transitions, 1307 flow [2024-10-11 17:15:57,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1307, PETRI_PLACES=607, PETRI_TRANSITIONS=608} [2024-10-11 17:15:57,095 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2024-10-11 17:15:57,095 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 608 transitions, 1307 flow [2024-10-11 17:15:57,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.3333333333334) internal successors, (2026), 3 states have internal predecessors, (2026), 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:15:57,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:57,096 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] [2024-10-11 17:15:57,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:15:57,096 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:57,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:57,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1786609, now seen corresponding path program 1 times [2024-10-11 17:15:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:57,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214049525] [2024-10-11 17:15:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:57,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:57,134 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:15:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:57,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214049525] [2024-10-11 17:15:57,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214049525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:57,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:57,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734097097] [2024-10-11 17:15:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:57,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:57,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 706 [2024-10-11 17:15:57,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 608 transitions, 1307 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:15:57,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:57,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 706 [2024-10-11 17:15:57,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:57,835 INFO L124 PetriNetUnfolderBase]: 143/5379 cut-off events. [2024-10-11 17:15:57,835 INFO L125 PetriNetUnfolderBase]: For 99/107 co-relation queries the response was YES. [2024-10-11 17:15:57,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6026 conditions, 5379 events. 143/5379 cut-off events. For 99/107 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 43295 event pairs, 18 based on Foata normal form. 0/4984 useless extension candidates. Maximal degree in co-relation 5921. Up to 154 conditions per place. [2024-10-11 17:15:57,884 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 12 selfloop transitions, 2 changer transitions 1/608 dead transitions. [2024-10-11 17:15:57,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 608 transitions, 1338 flow [2024-10-11 17:15:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2024-10-11 17:15:57,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513692162417375 [2024-10-11 17:15:57,886 INFO L175 Difference]: Start difference. First operand has 607 places, 608 transitions, 1307 flow. Second operand 3 states and 2015 transitions. [2024-10-11 17:15:57,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 608 transitions, 1338 flow [2024-10-11 17:15:57,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 608 transitions, 1338 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:57,893 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1309 flow [2024-10-11 17:15:57,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=608, PETRI_TRANSITIONS=607} [2024-10-11 17:15:57,894 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2024-10-11 17:15:57,894 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1309 flow [2024-10-11 17:15:57,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:15:57,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:57,895 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:57,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:15:57,895 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:57,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash -892657165, now seen corresponding path program 1 times [2024-10-11 17:15:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567612066] [2024-10-11 17:15:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:57,939 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:15:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:57,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567612066] [2024-10-11 17:15:57,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567612066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:57,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:57,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711358544] [2024-10-11 17:15:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:57,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:57,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:57,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:57,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:57,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 706 [2024-10-11 17:15:57,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 607 transitions, 1309 flow. Second operand has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:15:57,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:57,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 706 [2024-10-11 17:15:57,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:58,655 INFO L124 PetriNetUnfolderBase]: 135/6249 cut-off events. [2024-10-11 17:15:58,655 INFO L125 PetriNetUnfolderBase]: For 30/38 co-relation queries the response was YES. [2024-10-11 17:15:58,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6859 conditions, 6249 events. 135/6249 cut-off events. For 30/38 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 51965 event pairs, 8 based on Foata normal form. 0/5823 useless extension candidates. Maximal degree in co-relation 6753. Up to 68 conditions per place. [2024-10-11 17:15:58,711 INFO L140 encePairwiseOnDemand]: 704/706 looper letters, 7 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2024-10-11 17:15:58,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 608 transitions, 1328 flow [2024-10-11 17:15:58,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2031 transitions. [2024-10-11 17:15:58,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589235127478754 [2024-10-11 17:15:58,714 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1309 flow. Second operand 3 states and 2031 transitions. [2024-10-11 17:15:58,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 608 transitions, 1328 flow [2024-10-11 17:15:58,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 608 transitions, 1324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:58,720 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1310 flow [2024-10-11 17:15:58,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=608, PETRI_TRANSITIONS=607} [2024-10-11 17:15:58,721 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2024-10-11 17:15:58,721 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1310 flow [2024-10-11 17:15:58,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:15:58,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:58,722 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] [2024-10-11 17:15:58,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:15:58,722 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:58,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:58,723 INFO L85 PathProgramCache]: Analyzing trace with hash 53670932, now seen corresponding path program 1 times [2024-10-11 17:15:58,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:58,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808063244] [2024-10-11 17:15:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:58,753 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:15:58,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:58,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808063244] [2024-10-11 17:15:58,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808063244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:58,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:58,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:58,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304587222] [2024-10-11 17:15:58,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:58,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:58,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:58,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:58,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 706 [2024-10-11 17:15:58,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 607 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:15:58,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:58,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 706 [2024-10-11 17:15:58,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:59,733 INFO L124 PetriNetUnfolderBase]: 231/8833 cut-off events. [2024-10-11 17:15:59,733 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-10-11 17:15:59,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 8833 events. 231/8833 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 81027 event pairs, 36 based on Foata normal form. 0/8211 useless extension candidates. Maximal degree in co-relation 9728. Up to 159 conditions per place. [2024-10-11 17:15:59,786 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 13 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2024-10-11 17:15:59,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 607 transitions, 1341 flow [2024-10-11 17:15:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2024-10-11 17:15:59,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513692162417375 [2024-10-11 17:15:59,788 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1310 flow. Second operand 3 states and 2015 transitions. [2024-10-11 17:15:59,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 607 transitions, 1341 flow [2024-10-11 17:15:59,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 607 transitions, 1341 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:59,795 INFO L231 Difference]: Finished difference. Result has 609 places, 606 transitions, 1312 flow [2024-10-11 17:15:59,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=609, PETRI_TRANSITIONS=606} [2024-10-11 17:15:59,796 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -53 predicate places. [2024-10-11 17:15:59,796 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 606 transitions, 1312 flow [2024-10-11 17:15:59,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:15:59,796 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:59,796 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] [2024-10-11 17:15:59,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:15:59,796 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:15:59,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1160851240, now seen corresponding path program 1 times [2024-10-11 17:15:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:59,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144188996] [2024-10-11 17:15:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:59,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:59,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144188996] [2024-10-11 17:15:59,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144188996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:59,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:59,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:59,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214643127] [2024-10-11 17:15:59,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:59,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:59,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:59,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:59,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:59,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 706 [2024-10-11 17:15:59,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 606 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:15:59,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:59,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 706 [2024-10-11 17:15:59,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:00,547 INFO L124 PetriNetUnfolderBase]: 147/6049 cut-off events. [2024-10-11 17:16:00,547 INFO L125 PetriNetUnfolderBase]: For 105/113 co-relation queries the response was YES. [2024-10-11 17:16:00,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6755 conditions, 6049 events. 147/6049 cut-off events. For 105/113 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 50536 event pairs, 22 based on Foata normal form. 0/5641 useless extension candidates. Maximal degree in co-relation 6648. Up to 150 conditions per place. [2024-10-11 17:16:00,579 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 13 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2024-10-11 17:16:00,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 606 transitions, 1343 flow [2024-10-11 17:16:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2024-10-11 17:16:00,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513692162417375 [2024-10-11 17:16:00,582 INFO L175 Difference]: Start difference. First operand has 609 places, 606 transitions, 1312 flow. Second operand 3 states and 2015 transitions. [2024-10-11 17:16:00,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 606 transitions, 1343 flow [2024-10-11 17:16:00,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 606 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:00,592 INFO L231 Difference]: Finished difference. Result has 608 places, 605 transitions, 1310 flow [2024-10-11 17:16:00,592 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=608, PETRI_TRANSITIONS=605} [2024-10-11 17:16:00,593 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2024-10-11 17:16:00,593 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 605 transitions, 1310 flow [2024-10-11 17:16:00,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:00,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:00,594 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] [2024-10-11 17:16:00,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:16:00,594 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:16:00,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash -624029191, now seen corresponding path program 1 times [2024-10-11 17:16:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223243392] [2024-10-11 17:16:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:00,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:00,632 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:00,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:00,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223243392] [2024-10-11 17:16:00,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223243392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:00,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:00,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115846498] [2024-10-11 17:16:00,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:00,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:00,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:00,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:00,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:00,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 706 [2024-10-11 17:16:00,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 605 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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:00,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:00,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 706 [2024-10-11 17:16:00,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:01,953 INFO L124 PetriNetUnfolderBase]: 281/10327 cut-off events. [2024-10-11 17:16:01,954 INFO L125 PetriNetUnfolderBase]: For 90/94 co-relation queries the response was YES. [2024-10-11 17:16:01,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11638 conditions, 10327 events. 281/10327 cut-off events. For 90/94 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 101498 event pairs, 64 based on Foata normal form. 0/9630 useless extension candidates. Maximal degree in co-relation 11531. Up to 254 conditions per place. [2024-10-11 17:16:02,006 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 20 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2024-10-11 17:16:02,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 605 transitions, 1355 flow [2024-10-11 17:16:02,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2024-10-11 17:16:02,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9461756373937678 [2024-10-11 17:16:02,009 INFO L175 Difference]: Start difference. First operand has 608 places, 605 transitions, 1310 flow. Second operand 3 states and 2004 transitions. [2024-10-11 17:16:02,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 605 transitions, 1355 flow [2024-10-11 17:16:02,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 605 transitions, 1351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:02,017 INFO L231 Difference]: Finished difference. Result has 607 places, 604 transitions, 1308 flow [2024-10-11 17:16:02,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1308, PETRI_PLACES=607, PETRI_TRANSITIONS=604} [2024-10-11 17:16:02,018 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2024-10-11 17:16:02,018 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 604 transitions, 1308 flow [2024-10-11 17:16:02,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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:02,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:02,018 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] [2024-10-11 17:16:02,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:16:02,019 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:16:02,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash 370853901, now seen corresponding path program 1 times [2024-10-11 17:16:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:02,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993111894] [2024-10-11 17:16:02,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:02,070 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:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993111894] [2024-10-11 17:16:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993111894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:02,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:02,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:02,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796244221] [2024-10-11 17:16:02,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:02,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:02,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:02,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:02,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:02,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 706 [2024-10-11 17:16:02,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 604 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:02,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:02,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 706 [2024-10-11 17:16:02,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:03,085 INFO L124 PetriNetUnfolderBase]: 163/6447 cut-off events. [2024-10-11 17:16:03,085 INFO L125 PetriNetUnfolderBase]: For 111/119 co-relation queries the response was YES. [2024-10-11 17:16:03,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7257 conditions, 6447 events. 163/6447 cut-off events. For 111/119 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 56396 event pairs, 36 based on Foata normal form. 0/6034 useless extension candidates. Maximal degree in co-relation 7150. Up to 199 conditions per place. [2024-10-11 17:16:03,143 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 15 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2024-10-11 17:16:03,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 604 transitions, 1343 flow [2024-10-11 17:16:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2024-10-11 17:16:03,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508970727101038 [2024-10-11 17:16:03,145 INFO L175 Difference]: Start difference. First operand has 607 places, 604 transitions, 1308 flow. Second operand 3 states and 2014 transitions. [2024-10-11 17:16:03,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 604 transitions, 1343 flow [2024-10-11 17:16:03,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 604 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:03,151 INFO L231 Difference]: Finished difference. Result has 606 places, 603 transitions, 1306 flow [2024-10-11 17:16:03,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=606, PETRI_TRANSITIONS=603} [2024-10-11 17:16:03,152 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -56 predicate places. [2024-10-11 17:16:03,152 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 603 transitions, 1306 flow [2024-10-11 17:16:03,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:03,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:03,153 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] [2024-10-11 17:16:03,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:16:03,153 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:16:03,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:03,153 INFO L85 PathProgramCache]: Analyzing trace with hash -378984119, now seen corresponding path program 1 times [2024-10-11 17:16:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110562494] [2024-10-11 17:16:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:03,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:03,194 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:03,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:03,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110562494] [2024-10-11 17:16:03,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110562494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:03,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:03,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:03,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926928673] [2024-10-11 17:16:03,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:03,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:03,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 706 [2024-10-11 17:16:03,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 603 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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:03,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:03,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 706 [2024-10-11 17:16:03,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:04,338 INFO L124 PetriNetUnfolderBase]: 283/10615 cut-off events. [2024-10-11 17:16:04,338 INFO L125 PetriNetUnfolderBase]: For 121/129 co-relation queries the response was YES. [2024-10-11 17:16:04,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11964 conditions, 10615 events. 283/10615 cut-off events. For 121/129 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 102976 event pairs, 56 based on Foata normal form. 0/9921 useless extension candidates. Maximal degree in co-relation 11857. Up to 246 conditions per place. [2024-10-11 17:16:04,405 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 20 selfloop transitions, 2 changer transitions 0/603 dead transitions. [2024-10-11 17:16:04,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 603 transitions, 1351 flow [2024-10-11 17:16:04,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2024-10-11 17:16:04,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9461756373937678 [2024-10-11 17:16:04,407 INFO L175 Difference]: Start difference. First operand has 606 places, 603 transitions, 1306 flow. Second operand 3 states and 2004 transitions. [2024-10-11 17:16:04,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 603 transitions, 1351 flow [2024-10-11 17:16:04,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 603 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:04,414 INFO L231 Difference]: Finished difference. Result has 605 places, 602 transitions, 1304 flow [2024-10-11 17:16:04,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=605, PETRI_TRANSITIONS=602} [2024-10-11 17:16:04,415 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -57 predicate places. [2024-10-11 17:16:04,415 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 602 transitions, 1304 flow [2024-10-11 17:16:04,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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:04,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:04,416 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] [2024-10-11 17:16:04,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:16:04,416 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:16:04,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1234606276, now seen corresponding path program 1 times [2024-10-11 17:16:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:04,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115264389] [2024-10-11 17:16:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:04,470 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:04,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:04,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115264389] [2024-10-11 17:16:04,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115264389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:04,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:04,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027335727] [2024-10-11 17:16:04,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:04,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:04,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:04,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:04,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:04,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 706 [2024-10-11 17:16:04,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 602 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:04,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:04,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 706 [2024-10-11 17:16:04,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:05,294 INFO L124 PetriNetUnfolderBase]: 233/7345 cut-off events. [2024-10-11 17:16:05,294 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-11 17:16:05,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8396 conditions, 7345 events. 233/7345 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 66902 event pairs, 76 based on Foata normal form. 0/6909 useless extension candidates. Maximal degree in co-relation 8328. Up to 266 conditions per place. [2024-10-11 17:16:05,363 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 14 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2024-10-11 17:16:05,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 602 transitions, 1337 flow [2024-10-11 17:16:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2024-10-11 17:16:05,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508970727101038 [2024-10-11 17:16:05,366 INFO L175 Difference]: Start difference. First operand has 605 places, 602 transitions, 1304 flow. Second operand 3 states and 2014 transitions. [2024-10-11 17:16:05,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 602 transitions, 1337 flow [2024-10-11 17:16:05,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 602 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:05,373 INFO L231 Difference]: Finished difference. Result has 604 places, 601 transitions, 1302 flow [2024-10-11 17:16:05,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1302, PETRI_PLACES=604, PETRI_TRANSITIONS=601} [2024-10-11 17:16:05,374 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -58 predicate places. [2024-10-11 17:16:05,374 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 601 transitions, 1302 flow [2024-10-11 17:16:05,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:05,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:05,375 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] [2024-10-11 17:16:05,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 17:16:05,375 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:16:05,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -782673315, now seen corresponding path program 1 times [2024-10-11 17:16:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958696801] [2024-10-11 17:16:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:05,423 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:05,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:05,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958696801] [2024-10-11 17:16:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958696801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:05,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576145035] [2024-10-11 17:16:05,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:05,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:05,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:05,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 706 [2024-10-11 17:16:05,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 601 transitions, 1302 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:05,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:05,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 706 [2024-10-11 17:16:05,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:06,193 INFO L124 PetriNetUnfolderBase]: 155/6417 cut-off events. [2024-10-11 17:16:06,193 INFO L125 PetriNetUnfolderBase]: For 113/121 co-relation queries the response was YES. [2024-10-11 17:16:06,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 6417 events. 155/6417 cut-off events. For 113/121 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 55278 event pairs, 32 based on Foata normal form. 0/6029 useless extension candidates. Maximal degree in co-relation 7082. Up to 185 conditions per place. [2024-10-11 17:16:06,251 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 15 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2024-10-11 17:16:06,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 601 transitions, 1337 flow [2024-10-11 17:16:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2024-10-11 17:16:06,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508970727101038 [2024-10-11 17:16:06,253 INFO L175 Difference]: Start difference. First operand has 604 places, 601 transitions, 1302 flow. Second operand 3 states and 2014 transitions. [2024-10-11 17:16:06,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 601 transitions, 1337 flow [2024-10-11 17:16:06,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 601 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:06,259 INFO L231 Difference]: Finished difference. Result has 603 places, 600 transitions, 1300 flow [2024-10-11 17:16:06,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=603, PETRI_TRANSITIONS=600} [2024-10-11 17:16:06,259 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -59 predicate places. [2024-10-11 17:16:06,260 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 600 transitions, 1300 flow [2024-10-11 17:16:06,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:06,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:06,260 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] [2024-10-11 17:16:06,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 17:16:06,260 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2024-10-11 17:16:06,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -163647336, now seen corresponding path program 1 times [2024-10-11 17:16:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277323802] [2024-10-11 17:16:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:06,296 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:06,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:06,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277323802] [2024-10-11 17:16:06,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277323802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:06,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:06,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:06,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580692449] [2024-10-11 17:16:06,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:06,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:06,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:06,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:06,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 706 [2024-10-11 17:16:06,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 600 transitions, 1300 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:06,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:06,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 706 [2024-10-11 17:16:06,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:07,085 INFO L124 PetriNetUnfolderBase]: 175/6445 cut-off events. [2024-10-11 17:16:07,086 INFO L125 PetriNetUnfolderBase]: For 92/100 co-relation queries the response was YES. [2024-10-11 17:16:07,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 6445 events. 175/6445 cut-off events. For 92/100 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 56749 event pairs, 42 based on Foata normal form. 0/6066 useless extension candidates. Maximal degree in co-relation 7248. Up to 258 conditions per place. [2024-10-11 17:16:07,140 INFO L140 encePairwiseOnDemand]: 703/706 looper letters, 0 selfloop transitions, 0 changer transitions 600/600 dead transitions. [2024-10-11 17:16:07,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 600 transitions, 1333 flow [2024-10-11 17:16:07,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2024-10-11 17:16:07,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508970727101038 [2024-10-11 17:16:07,142 INFO L175 Difference]: Start difference. First operand has 603 places, 600 transitions, 1300 flow. Second operand 3 states and 2014 transitions. [2024-10-11 17:16:07,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 600 transitions, 1333 flow [2024-10-11 17:16:07,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 600 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:07,149 INFO L231 Difference]: Finished difference. Result has 602 places, 0 transitions, 0 flow [2024-10-11 17:16:07,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=706, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=602, PETRI_TRANSITIONS=0} [2024-10-11 17:16:07,149 INFO L277 CegarLoopForPetriNet]: 662 programPoint places, -60 predicate places. [2024-10-11 17:16:07,149 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 0 transitions, 0 flow [2024-10-11 17:16:07,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (122 of 123 remaining) [2024-10-11 17:16:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (121 of 123 remaining) [2024-10-11 17:16:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (120 of 123 remaining) [2024-10-11 17:16:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (119 of 123 remaining) [2024-10-11 17:16:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (118 of 123 remaining) [2024-10-11 17:16:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (117 of 123 remaining) [2024-10-11 17:16:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (116 of 123 remaining) [2024-10-11 17:16:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (115 of 123 remaining) [2024-10-11 17:16:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (114 of 123 remaining) [2024-10-11 17:16:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (113 of 123 remaining) [2024-10-11 17:16:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (112 of 123 remaining) [2024-10-11 17:16:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (111 of 123 remaining) [2024-10-11 17:16:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 123 remaining) [2024-10-11 17:16:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (109 of 123 remaining) [2024-10-11 17:16:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (108 of 123 remaining) [2024-10-11 17:16:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (107 of 123 remaining) [2024-10-11 17:16:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (106 of 123 remaining) [2024-10-11 17:16:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (105 of 123 remaining) [2024-10-11 17:16:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (104 of 123 remaining) [2024-10-11 17:16:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (103 of 123 remaining) [2024-10-11 17:16:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (102 of 123 remaining) [2024-10-11 17:16:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (101 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (100 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (99 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (98 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (97 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (96 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (95 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (94 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (93 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (92 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (91 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (90 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (89 of 123 remaining) [2024-10-11 17:16:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (88 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (87 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (86 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (85 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (84 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (83 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (82 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (81 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (80 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (78 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (77 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (76 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (75 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (74 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (73 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (72 of 123 remaining) [2024-10-11 17:16:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (71 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (70 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (69 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (68 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (66 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (65 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (64 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (63 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (61 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (60 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (59 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (58 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (57 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (56 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (55 of 123 remaining) [2024-10-11 17:16:07,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (54 of 123 remaining) [2024-10-11 17:16:07,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (53 of 123 remaining) [2024-10-11 17:16:07,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (52 of 123 remaining) [2024-10-11 17:16:07,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (51 of 123 remaining) [2024-10-11 17:16:07,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (50 of 123 remaining) [2024-10-11 17:16:07,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 123 remaining) [2024-10-11 17:16:07,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 123 remaining) [2024-10-11 17:16:07,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 123 remaining) [2024-10-11 17:16:07,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (46 of 123 remaining) [2024-10-11 17:16:07,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (44 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (41 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (40 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (39 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (38 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (37 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (36 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (31 of 123 remaining) [2024-10-11 17:16:07,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (30 of 123 remaining) [2024-10-11 17:16:07,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (29 of 123 remaining) [2024-10-11 17:16:07,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (28 of 123 remaining) [2024-10-11 17:16:07,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (27 of 123 remaining) [2024-10-11 17:16:07,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (26 of 123 remaining) [2024-10-11 17:16:07,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (25 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (24 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (22 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (20 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (16 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (15 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (13 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (10 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (8 of 123 remaining) [2024-10-11 17:16:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 123 remaining) [2024-10-11 17:16:07,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (6 of 123 remaining) [2024-10-11 17:16:07,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (5 of 123 remaining) [2024-10-11 17:16:07,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (4 of 123 remaining) [2024-10-11 17:16:07,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (3 of 123 remaining) [2024-10-11 17:16:07,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (2 of 123 remaining) [2024-10-11 17:16:07,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (1 of 123 remaining) [2024-10-11 17:16:07,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (0 of 123 remaining) [2024-10-11 17:16:07,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 17:16:07,167 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:07,172 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:16:07,172 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:16:07,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:16:07 BasicIcfg [2024-10-11 17:16:07,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:16:07,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:16:07,177 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:16:07,177 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:16:07,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:45" (3/4) ... [2024-10-11 17:16:07,182 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:16:07,184 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:16:07,184 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:16:07,192 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 17:16:07,192 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:16:07,193 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:16:07,193 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:16:07,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:16:07,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:16:07,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:16:07,274 INFO L158 Benchmark]: Toolchain (without parser) took 23162.72ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 88.3MB in the beginning and 669.3MB in the end (delta: -581.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-11 17:16:07,276 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:16:07,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.64ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 73.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:16:07,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.45ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 69.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:16:07,276 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 66.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:16:07,277 INFO L158 Benchmark]: RCFGBuilder took 828.11ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 66.3MB in the beginning and 116.0MB in the end (delta: -49.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-10-11 17:16:07,277 INFO L158 Benchmark]: TraceAbstraction took 21867.82ms. Allocated memory was 186.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 115.0MB in the beginning and 676.6MB in the end (delta: -561.6MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-11 17:16:07,277 INFO L158 Benchmark]: Witness Printer took 97.00ms. Allocated memory is still 1.8GB. Free memory was 676.6MB in the beginning and 669.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 17:16:07,280 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.13ms. Allocated memory is still 142.6MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.64ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 73.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.45ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 69.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 66.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 828.11ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 66.3MB in the beginning and 116.0MB in the end (delta: -49.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21867.82ms. Allocated memory was 186.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 115.0MB in the beginning and 676.6MB in the end (delta: -561.6MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 97.00ms. Allocated memory is still 1.8GB. Free memory was 676.6MB in the beginning and 669.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 48]: 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: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 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: 48]: 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: 56]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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: 69]: 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: 69]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: 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: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1100 locations, 123 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: 21.7s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1866 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 663 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2136 IncrementalHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 311 mSDtfsCounter, 2136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1386occurred in iteration=0, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 4931 NumberOfCodeBlocks, 4931 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4898 ConstructedInterpolants, 0 QuantifiedInterpolants, 5303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 73 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:16:07,307 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