./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:00:46,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:00:46,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:00:46,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:00:46,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:00:46,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:00:46,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:00:46,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:00:46,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:00:46,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:00:46,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:00:46,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:00:46,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:00:46,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:00:46,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:00:46,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:00:46,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:00:46,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:00:46,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:00:46,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:00:46,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:00:46,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:00:46,881 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:00:46,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:00:46,881 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:00:46,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:00:46,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:00:46,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:00:46,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:00:46,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:00:46,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:00:46,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:00:46,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:00:46,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:00:46,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:00:46,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:00:46,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:00:46,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:00:46,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:00:46,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:00:46,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:00:46,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 [2024-11-19 06:00:47,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:00:47,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:00:47,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:00:47,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:00:47,190 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:00:47,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-3.wvr.c [2024-11-19 06:00:48,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:00:48,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:00:48,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-3.wvr.c [2024-11-19 06:00:48,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf6c3b63/d9ccc577538c462383a8c9877ac621ea/FLAG297307003 [2024-11-19 06:00:49,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf6c3b63/d9ccc577538c462383a8c9877ac621ea [2024-11-19 06:00:49,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:00:49,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:00:49,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:00:49,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:00:49,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:00:49,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713d47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49, skipping insertion in model container [2024-11-19 06:00:49,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:00:49,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:00:49,395 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:00:49,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:00:49,448 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:00:49,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49 WrapperNode [2024-11-19 06:00:49,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:00:49,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:00:49,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:00:49,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:00:49,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,494 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 264 [2024-11-19 06:00:49,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:00:49,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:00:49,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:00:49,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:00:49,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:00:49,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:00:49,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:00:49,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:00:49,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (1/1) ... [2024-11-19 06:00:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:00:49,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:00:49,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:00:49,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:00:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:00:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 06:00:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 06:00:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 06:00:49,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 06:00:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 06:00:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 06:00:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:00:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:00:49,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:00:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 06:00:49,674 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 06:00:49,833 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:00:49,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:00:50,498 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:00:50,503 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:00:50,533 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:00:50,533 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 06:00:50,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:50 BoogieIcfgContainer [2024-11-19 06:00:50,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:00:50,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:00:50,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:00:50,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:00:50,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:00:49" (1/3) ... [2024-11-19 06:00:50,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289e012d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:00:50, skipping insertion in model container [2024-11-19 06:00:50,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:49" (2/3) ... [2024-11-19 06:00:50,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289e012d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:00:50, skipping insertion in model container [2024-11-19 06:00:50,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:50" (3/3) ... [2024-11-19 06:00:50,542 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-11-19 06:00:50,555 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:00:50,555 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-19 06:00:50,555 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:00:50,661 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 06:00:50,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 349 transitions, 712 flow [2024-11-19 06:00:50,851 INFO L124 PetriNetUnfolderBase]: 19/347 cut-off events. [2024-11-19 06:00:50,851 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 06:00:50,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 347 events. 19/347 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 478 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 210. Up to 2 conditions per place. [2024-11-19 06:00:50,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 349 transitions, 712 flow [2024-11-19 06:00:50,875 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 330 transitions, 672 flow [2024-11-19 06:00:50,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:00:50,900 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;@607c7667, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:00:50,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-11-19 06:00:50,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:00:50,932 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-11-19 06:00:50,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:00:50,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:50,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:50,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1436931317, now seen corresponding path program 1 times [2024-11-19 06:00:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049744971] [2024-11-19 06:00:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:51,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:51,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049744971] [2024-11-19 06:00:51,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049744971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:51,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:51,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:51,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648648741] [2024-11-19 06:00:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:51,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:51,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:51,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:51,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 349 [2024-11-19 06:00:51,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 330 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:51,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:51,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 349 [2024-11-19 06:00:51,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:51,274 INFO L124 PetriNetUnfolderBase]: 14/426 cut-off events. [2024-11-19 06:00:51,274 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-19 06:00:51,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 426 events. 14/426 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1022 event pairs, 3 based on Foata normal form. 11/362 useless extension candidates. Maximal degree in co-relation 321. Up to 19 conditions per place. [2024-11-19 06:00:51,280 INFO L140 encePairwiseOnDemand]: 335/349 looper letters, 10 selfloop transitions, 2 changer transitions 4/318 dead transitions. [2024-11-19 06:00:51,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 318 transitions, 672 flow [2024-11-19 06:00:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 990 transitions. [2024-11-19 06:00:51,296 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9455587392550143 [2024-11-19 06:00:51,298 INFO L175 Difference]: Start difference. First operand has 319 places, 330 transitions, 672 flow. Second operand 3 states and 990 transitions. [2024-11-19 06:00:51,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 318 transitions, 672 flow [2024-11-19 06:00:51,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 318 transitions, 664 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 06:00:51,308 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 636 flow [2024-11-19 06:00:51,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2024-11-19 06:00:51,313 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -3 predicate places. [2024-11-19 06:00:51,313 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 636 flow [2024-11-19 06:00:51,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:51,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:51,314 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:51,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:00:51,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:51,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1558477961, now seen corresponding path program 1 times [2024-11-19 06:00:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:51,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816870352] [2024-11-19 06:00:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816870352] [2024-11-19 06:00:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816870352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:51,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5516117] [2024-11-19 06:00:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:51,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:51,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:51,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 349 [2024-11-19 06:00:51,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:51,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:51,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 349 [2024-11-19 06:00:51,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:51,464 INFO L124 PetriNetUnfolderBase]: 18/467 cut-off events. [2024-11-19 06:00:51,464 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 06:00:51,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 467 events. 18/467 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1130 event pairs, 7 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 476. Up to 28 conditions per place. [2024-11-19 06:00:51,471 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 13 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2024-11-19 06:00:51,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 313 transitions, 664 flow [2024-11-19 06:00:51,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2024-11-19 06:00:51,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9293218720152817 [2024-11-19 06:00:51,476 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 636 flow. Second operand 3 states and 973 transitions. [2024-11-19 06:00:51,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 313 transitions, 664 flow [2024-11-19 06:00:51,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 313 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:51,481 INFO L231 Difference]: Finished difference. Result has 311 places, 313 transitions, 634 flow [2024-11-19 06:00:51,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=311, PETRI_TRANSITIONS=313} [2024-11-19 06:00:51,483 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -8 predicate places. [2024-11-19 06:00:51,483 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 313 transitions, 634 flow [2024-11-19 06:00:51,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:51,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:51,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:51,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:00:51,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:51,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash 653490418, now seen corresponding path program 1 times [2024-11-19 06:00:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013869034] [2024-11-19 06:00:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:51,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013869034] [2024-11-19 06:00:51,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013869034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:51,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:51,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842916526] [2024-11-19 06:00:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:51,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:51,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:51,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 349 [2024-11-19 06:00:51,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 313 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:51,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:51,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 349 [2024-11-19 06:00:51,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:51,709 INFO L124 PetriNetUnfolderBase]: 62/954 cut-off events. [2024-11-19 06:00:51,709 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 06:00:51,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 954 events. 62/954 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3996 event pairs, 20 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 1005. Up to 77 conditions per place. [2024-11-19 06:00:51,718 INFO L140 encePairwiseOnDemand]: 342/349 looper letters, 16 selfloop transitions, 1 changer transitions 0/307 dead transitions. [2024-11-19 06:00:51,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 307 transitions, 656 flow [2024-11-19 06:00:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2024-11-19 06:00:51,723 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188156638013372 [2024-11-19 06:00:51,723 INFO L175 Difference]: Start difference. First operand has 311 places, 313 transitions, 634 flow. Second operand 3 states and 962 transitions. [2024-11-19 06:00:51,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 307 transitions, 656 flow [2024-11-19 06:00:51,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 307 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:51,756 INFO L231 Difference]: Finished difference. Result has 305 places, 307 transitions, 620 flow [2024-11-19 06:00:51,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=305, PETRI_TRANSITIONS=307} [2024-11-19 06:00:51,761 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -14 predicate places. [2024-11-19 06:00:51,765 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 307 transitions, 620 flow [2024-11-19 06:00:51,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:51,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:51,766 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:51,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:00:51,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:51,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:51,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2089816064, now seen corresponding path program 1 times [2024-11-19 06:00:51,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:51,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531047890] [2024-11-19 06:00:51,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:51,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:51,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-11-19 06:00:51,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:51,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531047890] [2024-11-19 06:00:51,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531047890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364347298] [2024-11-19 06:00:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:51,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:51,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:51,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 349 [2024-11-19 06:00:51,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 307 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:51,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:51,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 349 [2024-11-19 06:00:51,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:52,000 INFO L124 PetriNetUnfolderBase]: 18/457 cut-off events. [2024-11-19 06:00:52,000 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 06:00:52,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 457 events. 18/457 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1111 event pairs, 7 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 455. Up to 26 conditions per place. [2024-11-19 06:00:52,004 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 11 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2024-11-19 06:00:52,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 306 transitions, 644 flow [2024-11-19 06:00:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2024-11-19 06:00:52,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.933142311365807 [2024-11-19 06:00:52,006 INFO L175 Difference]: Start difference. First operand has 305 places, 307 transitions, 620 flow. Second operand 3 states and 977 transitions. [2024-11-19 06:00:52,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 306 transitions, 644 flow [2024-11-19 06:00:52,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 306 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:00:52,010 INFO L231 Difference]: Finished difference. Result has 305 places, 306 transitions, 621 flow [2024-11-19 06:00:52,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=305, PETRI_TRANSITIONS=306} [2024-11-19 06:00:52,011 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -14 predicate places. [2024-11-19 06:00:52,012 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 306 transitions, 621 flow [2024-11-19 06:00:52,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:52,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:52,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:52,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:00:52,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:52,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1034273138, now seen corresponding path program 1 times [2024-11-19 06:00:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:52,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485441131] [2024-11-19 06:00:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:52,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:52,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485441131] [2024-11-19 06:00:52,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485441131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:52,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844059017] [2024-11-19 06:00:52,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:52,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:00:52,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:00:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:00:52,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2024-11-19 06:00:52,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 306 transitions, 621 flow. Second operand has 6 states, 6 states have (on average 303.5) internal successors, (1821), 6 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:52,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:52,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2024-11-19 06:00:52,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:52,823 INFO L124 PetriNetUnfolderBase]: 120/1180 cut-off events. [2024-11-19 06:00:52,823 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-19 06:00:52,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1180 events. 120/1180 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5724 event pairs, 64 based on Foata normal form. 0/980 useless extension candidates. Maximal degree in co-relation 1349. Up to 188 conditions per place. [2024-11-19 06:00:52,831 INFO L140 encePairwiseOnDemand]: 343/349 looper letters, 28 selfloop transitions, 5 changer transitions 0/305 dead transitions. [2024-11-19 06:00:52,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 305 transitions, 685 flow [2024-11-19 06:00:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:00:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:00:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1846 transitions. [2024-11-19 06:00:52,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8815663801337154 [2024-11-19 06:00:52,834 INFO L175 Difference]: Start difference. First operand has 305 places, 306 transitions, 621 flow. Second operand 6 states and 1846 transitions. [2024-11-19 06:00:52,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 305 transitions, 685 flow [2024-11-19 06:00:52,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 305 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:52,838 INFO L231 Difference]: Finished difference. Result has 307 places, 305 transitions, 625 flow [2024-11-19 06:00:52,838 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=625, PETRI_PLACES=307, PETRI_TRANSITIONS=305} [2024-11-19 06:00:52,839 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -12 predicate places. [2024-11-19 06:00:52,839 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 305 transitions, 625 flow [2024-11-19 06:00:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 303.5) internal successors, (1821), 6 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:52,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:52,840 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-11-19 06:00:52,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:00:52,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:52,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1794580958, now seen corresponding path program 1 times [2024-11-19 06:00:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276046256] [2024-11-19 06:00:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:52,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:52,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276046256] [2024-11-19 06:00:52,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276046256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:52,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:52,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:52,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249208326] [2024-11-19 06:00:52,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:52,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:52,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:52,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:52,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:52,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 349 [2024-11-19 06:00:52,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 305 transitions, 625 flow. Second operand has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:52,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:52,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 349 [2024-11-19 06:00:52,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:52,952 INFO L124 PetriNetUnfolderBase]: 32/817 cut-off events. [2024-11-19 06:00:52,952 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 06:00:52,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 817 events. 32/817 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3303 event pairs, 8 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 845. Up to 32 conditions per place. [2024-11-19 06:00:52,957 INFO L140 encePairwiseOnDemand]: 345/349 looper letters, 10 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2024-11-19 06:00:52,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 641 flow [2024-11-19 06:00:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 980 transitions. [2024-11-19 06:00:52,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.936007640878701 [2024-11-19 06:00:52,959 INFO L175 Difference]: Start difference. First operand has 307 places, 305 transitions, 625 flow. Second operand 3 states and 980 transitions. [2024-11-19 06:00:52,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 641 flow [2024-11-19 06:00:52,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 631 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:00:52,963 INFO L231 Difference]: Finished difference. Result has 301 places, 302 transitions, 611 flow [2024-11-19 06:00:52,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=301, PETRI_TRANSITIONS=302} [2024-11-19 06:00:52,964 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -18 predicate places. [2024-11-19 06:00:52,964 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 302 transitions, 611 flow [2024-11-19 06:00:52,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:52,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:52,965 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] [2024-11-19 06:00:52,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:00:52,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:52,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1226781314, now seen corresponding path program 1 times [2024-11-19 06:00:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:52,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188808230] [2024-11-19 06:00:52,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:52,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:52,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188808230] [2024-11-19 06:00:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188808230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:52,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:52,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583736186] [2024-11-19 06:00:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:52,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:52,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:52,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:52,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:53,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 349 [2024-11-19 06:00:53,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 302 transitions, 611 flow. Second operand has 3 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:53,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:53,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 349 [2024-11-19 06:00:53,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:53,067 INFO L124 PetriNetUnfolderBase]: 19/477 cut-off events. [2024-11-19 06:00:53,068 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 06:00:53,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 477 events. 19/477 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 958 event pairs, 1 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 483. Up to 20 conditions per place. [2024-11-19 06:00:53,070 INFO L140 encePairwiseOnDemand]: 342/349 looper letters, 11 selfloop transitions, 3 changer transitions 0/299 dead transitions. [2024-11-19 06:00:53,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 299 transitions, 634 flow [2024-11-19 06:00:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2024-11-19 06:00:53,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9312320916905444 [2024-11-19 06:00:53,072 INFO L175 Difference]: Start difference. First operand has 301 places, 302 transitions, 611 flow. Second operand 3 states and 975 transitions. [2024-11-19 06:00:53,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 299 transitions, 634 flow [2024-11-19 06:00:53,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 299 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:00:53,076 INFO L231 Difference]: Finished difference. Result has 298 places, 298 transitions, 608 flow [2024-11-19 06:00:53,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=298, PETRI_TRANSITIONS=298} [2024-11-19 06:00:53,077 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -21 predicate places. [2024-11-19 06:00:53,077 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 298 transitions, 608 flow [2024-11-19 06:00:53,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:53,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:53,078 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] [2024-11-19 06:00:53,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:00:53,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:53,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:53,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1417648325, now seen corresponding path program 1 times [2024-11-19 06:00:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:53,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489184621] [2024-11-19 06:00:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:53,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489184621] [2024-11-19 06:00:53,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489184621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:53,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:53,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:53,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807186466] [2024-11-19 06:00:53,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:53,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:53,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:53,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:53,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 349 [2024-11-19 06:00:53,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 298 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:53,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:53,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 349 [2024-11-19 06:00:53,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:53,180 INFO L124 PetriNetUnfolderBase]: 31/408 cut-off events. [2024-11-19 06:00:53,181 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-19 06:00:53,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 408 events. 31/408 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1105 event pairs, 3 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 451. Up to 55 conditions per place. [2024-11-19 06:00:53,183 INFO L140 encePairwiseOnDemand]: 332/349 looper letters, 19 selfloop transitions, 6 changer transitions 4/289 dead transitions. [2024-11-19 06:00:53,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 645 flow [2024-11-19 06:00:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2024-11-19 06:00:53,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.89207258834766 [2024-11-19 06:00:53,185 INFO L175 Difference]: Start difference. First operand has 298 places, 298 transitions, 608 flow. Second operand 3 states and 934 transitions. [2024-11-19 06:00:53,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 645 flow [2024-11-19 06:00:53,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 289 transitions, 639 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:53,189 INFO L231 Difference]: Finished difference. Result has 288 places, 284 transitions, 585 flow [2024-11-19 06:00:53,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=288, PETRI_TRANSITIONS=284} [2024-11-19 06:00:53,190 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -31 predicate places. [2024-11-19 06:00:53,190 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 284 transitions, 585 flow [2024-11-19 06:00:53,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:53,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:53,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:53,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:00:53,191 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:53,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:53,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1939615872, now seen corresponding path program 1 times [2024-11-19 06:00:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:53,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505476101] [2024-11-19 06:00:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505476101] [2024-11-19 06:00:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505476101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:53,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002849255] [2024-11-19 06:00:53,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:53,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:53,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:53,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:53,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 349 [2024-11-19 06:00:53,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 284 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:53,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:53,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 349 [2024-11-19 06:00:53,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:53,296 INFO L124 PetriNetUnfolderBase]: 57/825 cut-off events. [2024-11-19 06:00:53,296 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 06:00:53,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 825 events. 57/825 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3201 event pairs, 6 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 896. Up to 68 conditions per place. [2024-11-19 06:00:53,300 INFO L140 encePairwiseOnDemand]: 343/349 looper letters, 14 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-11-19 06:00:53,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 284 transitions, 619 flow [2024-11-19 06:00:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2024-11-19 06:00:53,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.933142311365807 [2024-11-19 06:00:53,302 INFO L175 Difference]: Start difference. First operand has 288 places, 284 transitions, 585 flow. Second operand 3 states and 977 transitions. [2024-11-19 06:00:53,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 284 transitions, 619 flow [2024-11-19 06:00:53,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 284 transitions, 607 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:53,307 INFO L231 Difference]: Finished difference. Result has 281 places, 282 transitions, 579 flow [2024-11-19 06:00:53,307 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=281, PETRI_TRANSITIONS=282} [2024-11-19 06:00:53,308 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -38 predicate places. [2024-11-19 06:00:53,308 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 282 transitions, 579 flow [2024-11-19 06:00:53,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:53,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:53,309 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] [2024-11-19 06:00:53,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:00:53,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:53,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash -228904666, now seen corresponding path program 1 times [2024-11-19 06:00:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012591598] [2024-11-19 06:00:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:53,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012591598] [2024-11-19 06:00:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012591598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:53,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:53,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:00:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91576111] [2024-11-19 06:00:53,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:53,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:00:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:00:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:00:53,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 349 [2024-11-19 06:00:53,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 282 transitions, 579 flow. Second operand has 4 states, 4 states have (on average 326.25) internal successors, (1305), 4 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:53,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:53,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 349 [2024-11-19 06:00:53,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:53,531 INFO L124 PetriNetUnfolderBase]: 39/958 cut-off events. [2024-11-19 06:00:53,532 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 06:00:53,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 958 events. 39/958 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3565 event pairs, 3 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 993. Up to 18 conditions per place. [2024-11-19 06:00:53,538 INFO L140 encePairwiseOnDemand]: 343/349 looper letters, 13 selfloop transitions, 6 changer transitions 0/291 dead transitions. [2024-11-19 06:00:53,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 291 transitions, 639 flow [2024-11-19 06:00:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:00:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 06:00:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1645 transitions. [2024-11-19 06:00:53,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9426934097421203 [2024-11-19 06:00:53,542 INFO L175 Difference]: Start difference. First operand has 281 places, 282 transitions, 579 flow. Second operand 5 states and 1645 transitions. [2024-11-19 06:00:53,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 291 transitions, 639 flow [2024-11-19 06:00:53,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 291 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:53,546 INFO L231 Difference]: Finished difference. Result has 288 places, 286 transitions, 617 flow [2024-11-19 06:00:53,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=617, PETRI_PLACES=288, PETRI_TRANSITIONS=286} [2024-11-19 06:00:53,547 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -31 predicate places. [2024-11-19 06:00:53,547 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 286 transitions, 617 flow [2024-11-19 06:00:53,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 326.25) internal successors, (1305), 4 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:53,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:53,548 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] [2024-11-19 06:00:53,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:00:53,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1890275831, now seen corresponding path program 1 times [2024-11-19 06:00:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476569313] [2024-11-19 06:00:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:53,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:53,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476569313] [2024-11-19 06:00:53,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476569313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:53,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:53,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985107790] [2024-11-19 06:00:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:53,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:00:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:00:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:00:54,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 349 [2024-11-19 06:00:54,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 286 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 319.5) internal successors, (1917), 6 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:54,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:54,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 349 [2024-11-19 06:00:54,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:54,462 INFO L124 PetriNetUnfolderBase]: 34/739 cut-off events. [2024-11-19 06:00:54,463 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-19 06:00:54,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 739 events. 34/739 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2221 event pairs, 2 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 795. Up to 17 conditions per place. [2024-11-19 06:00:54,476 INFO L140 encePairwiseOnDemand]: 343/349 looper letters, 15 selfloop transitions, 6 changer transitions 0/289 dead transitions. [2024-11-19 06:00:54,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 289 transitions, 669 flow [2024-11-19 06:00:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:00:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:00:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1929 transitions. [2024-11-19 06:00:54,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9212034383954155 [2024-11-19 06:00:54,480 INFO L175 Difference]: Start difference. First operand has 288 places, 286 transitions, 617 flow. Second operand 6 states and 1929 transitions. [2024-11-19 06:00:54,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 289 transitions, 669 flow [2024-11-19 06:00:54,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 669 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:54,488 INFO L231 Difference]: Finished difference. Result has 292 places, 285 transitions, 627 flow [2024-11-19 06:00:54,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=627, PETRI_PLACES=292, PETRI_TRANSITIONS=285} [2024-11-19 06:00:54,493 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -27 predicate places. [2024-11-19 06:00:54,493 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 285 transitions, 627 flow [2024-11-19 06:00:54,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 319.5) internal successors, (1917), 6 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:54,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:54,495 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] [2024-11-19 06:00:54,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:00:54,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:54,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1303799136, now seen corresponding path program 1 times [2024-11-19 06:00:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060452088] [2024-11-19 06:00:54,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:54,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060452088] [2024-11-19 06:00:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060452088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:54,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:54,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:00:54,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45741251] [2024-11-19 06:00:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:54,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:00:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:00:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:00:54,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 349 [2024-11-19 06:00:54,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 285 transitions, 627 flow. Second operand has 4 states, 4 states have (on average 324.5) internal successors, (1298), 4 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:54,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:54,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 349 [2024-11-19 06:00:54,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:54,898 INFO L124 PetriNetUnfolderBase]: 49/927 cut-off events. [2024-11-19 06:00:54,899 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2024-11-19 06:00:54,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 927 events. 49/927 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3944 event pairs, 6 based on Foata normal form. 0/844 useless extension candidates. Maximal degree in co-relation 1022. Up to 53 conditions per place. [2024-11-19 06:00:54,915 INFO L140 encePairwiseOnDemand]: 343/349 looper letters, 14 selfloop transitions, 6 changer transitions 0/293 dead transitions. [2024-11-19 06:00:54,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 293 transitions, 686 flow [2024-11-19 06:00:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:00:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 06:00:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1636 transitions. [2024-11-19 06:00:54,922 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375358166189112 [2024-11-19 06:00:54,922 INFO L175 Difference]: Start difference. First operand has 292 places, 285 transitions, 627 flow. Second operand 5 states and 1636 transitions. [2024-11-19 06:00:54,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 293 transitions, 686 flow [2024-11-19 06:00:54,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:00:54,931 INFO L231 Difference]: Finished difference. Result has 294 places, 289 transitions, 653 flow [2024-11-19 06:00:54,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=653, PETRI_PLACES=294, PETRI_TRANSITIONS=289} [2024-11-19 06:00:54,935 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -25 predicate places. [2024-11-19 06:00:54,935 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 653 flow [2024-11-19 06:00:54,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 324.5) internal successors, (1298), 4 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:54,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:54,937 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] [2024-11-19 06:00:54,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:00:54,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:54,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1532803724, now seen corresponding path program 1 times [2024-11-19 06:00:54,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:54,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445286346] [2024-11-19 06:00:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:55,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:55,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445286346] [2024-11-19 06:00:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445286346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:55,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904314435] [2024-11-19 06:00:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:55,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:55,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:55,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:55,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 349 [2024-11-19 06:00:55,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:55,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:55,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 349 [2024-11-19 06:00:55,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:55,306 INFO L124 PetriNetUnfolderBase]: 45/1216 cut-off events. [2024-11-19 06:00:55,310 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-19 06:00:55,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 1216 events. 45/1216 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5397 event pairs, 10 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 1356. Up to 34 conditions per place. [2024-11-19 06:00:55,326 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 9 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-11-19 06:00:55,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 289 transitions, 676 flow [2024-11-19 06:00:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions. [2024-11-19 06:00:55,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369627507163324 [2024-11-19 06:00:55,333 INFO L175 Difference]: Start difference. First operand has 294 places, 289 transitions, 653 flow. Second operand 3 states and 981 transitions. [2024-11-19 06:00:55,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 289 transitions, 676 flow [2024-11-19 06:00:55,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 289 transitions, 676 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:55,337 INFO L231 Difference]: Finished difference. Result has 295 places, 288 transitions, 655 flow [2024-11-19 06:00:55,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=295, PETRI_TRANSITIONS=288} [2024-11-19 06:00:55,338 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -24 predicate places. [2024-11-19 06:00:55,338 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 288 transitions, 655 flow [2024-11-19 06:00:55,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:55,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:55,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:55,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:00:55,339 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:55,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:55,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1806695610, now seen corresponding path program 1 times [2024-11-19 06:00:55,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:55,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244609500] [2024-11-19 06:00:55,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:55,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244609500] [2024-11-19 06:00:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244609500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:55,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:55,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614798552] [2024-11-19 06:00:55,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:55,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:00:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:55,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:00:55,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:00:55,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 349 [2024-11-19 06:00:55,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 288 transitions, 655 flow. Second operand has 6 states, 6 states have (on average 305.6666666666667) internal successors, (1834), 6 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:55,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:55,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 349 [2024-11-19 06:00:55,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:55,901 INFO L124 PetriNetUnfolderBase]: 70/806 cut-off events. [2024-11-19 06:00:55,901 INFO L125 PetriNetUnfolderBase]: For 67/68 co-relation queries the response was YES. [2024-11-19 06:00:55,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 806 events. 70/806 cut-off events. For 67/68 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3691 event pairs, 8 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 1023. Up to 56 conditions per place. [2024-11-19 06:00:55,907 INFO L140 encePairwiseOnDemand]: 331/349 looper letters, 17 selfloop transitions, 16 changer transitions 0/289 dead transitions. [2024-11-19 06:00:55,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 289 transitions, 727 flow [2024-11-19 06:00:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:00:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:00:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1859 transitions. [2024-11-19 06:00:55,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.887774594078319 [2024-11-19 06:00:55,911 INFO L175 Difference]: Start difference. First operand has 295 places, 288 transitions, 655 flow. Second operand 6 states and 1859 transitions. [2024-11-19 06:00:55,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 289 transitions, 727 flow [2024-11-19 06:00:55,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 289 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:55,917 INFO L231 Difference]: Finished difference. Result has 295 places, 285 transitions, 677 flow [2024-11-19 06:00:55,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=677, PETRI_PLACES=295, PETRI_TRANSITIONS=285} [2024-11-19 06:00:55,918 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -24 predicate places. [2024-11-19 06:00:55,918 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 285 transitions, 677 flow [2024-11-19 06:00:55,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.6666666666667) internal successors, (1834), 6 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:55,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:55,920 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] [2024-11-19 06:00:55,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:00:55,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:55,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash 471531273, now seen corresponding path program 1 times [2024-11-19 06:00:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:55,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859209074] [2024-11-19 06:00:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:55,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:55,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859209074] [2024-11-19 06:00:55,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859209074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:55,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:55,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564507976] [2024-11-19 06:00:55,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:55,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:55,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:55,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:55,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:56,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 349 [2024-11-19 06:00:56,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 285 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:56,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:56,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 349 [2024-11-19 06:00:56,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:56,121 INFO L124 PetriNetUnfolderBase]: 63/913 cut-off events. [2024-11-19 06:00:56,121 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2024-11-19 06:00:56,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 913 events. 63/913 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4129 event pairs, 34 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1185. Up to 114 conditions per place. [2024-11-19 06:00:56,126 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 17 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-11-19 06:00:56,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 285 transitions, 716 flow [2024-11-19 06:00:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2024-11-19 06:00:56,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216809933142311 [2024-11-19 06:00:56,129 INFO L175 Difference]: Start difference. First operand has 295 places, 285 transitions, 677 flow. Second operand 3 states and 965 transitions. [2024-11-19 06:00:56,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 285 transitions, 716 flow [2024-11-19 06:00:56,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 285 transitions, 684 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:00:56,134 INFO L231 Difference]: Finished difference. Result has 291 places, 284 transitions, 647 flow [2024-11-19 06:00:56,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=647, PETRI_PLACES=291, PETRI_TRANSITIONS=284} [2024-11-19 06:00:56,135 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -28 predicate places. [2024-11-19 06:00:56,135 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 284 transitions, 647 flow [2024-11-19 06:00:56,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:56,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:56,136 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] [2024-11-19 06:00:56,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:00:56,136 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:56,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash 94862880, now seen corresponding path program 1 times [2024-11-19 06:00:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:56,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433829599] [2024-11-19 06:00:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433829599] [2024-11-19 06:00:56,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433829599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:56,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:56,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:56,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102971091] [2024-11-19 06:00:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:56,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:56,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:56,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:56,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 349 [2024-11-19 06:00:56,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 284 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:56,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:56,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 349 [2024-11-19 06:00:56,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:56,327 INFO L124 PetriNetUnfolderBase]: 62/876 cut-off events. [2024-11-19 06:00:56,327 INFO L125 PetriNetUnfolderBase]: For 63/64 co-relation queries the response was YES. [2024-11-19 06:00:56,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 876 events. 62/876 cut-off events. For 63/64 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3912 event pairs, 34 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 1063. Up to 114 conditions per place. [2024-11-19 06:00:56,333 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 17 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-11-19 06:00:56,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 284 transitions, 686 flow [2024-11-19 06:00:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2024-11-19 06:00:56,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216809933142311 [2024-11-19 06:00:56,335 INFO L175 Difference]: Start difference. First operand has 291 places, 284 transitions, 647 flow. Second operand 3 states and 965 transitions. [2024-11-19 06:00:56,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 284 transitions, 686 flow [2024-11-19 06:00:56,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 284 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:56,339 INFO L231 Difference]: Finished difference. Result has 290 places, 283 transitions, 645 flow [2024-11-19 06:00:56,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=290, PETRI_TRANSITIONS=283} [2024-11-19 06:00:56,340 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -29 predicate places. [2024-11-19 06:00:56,340 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 283 transitions, 645 flow [2024-11-19 06:00:56,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:56,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:56,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:56,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:00:56,341 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-19 06:00:56,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1378687145, now seen corresponding path program 1 times [2024-11-19 06:00:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580125131] [2024-11-19 06:00:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:56,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:56,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580125131] [2024-11-19 06:00:56,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580125131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:56,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:56,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987490554] [2024-11-19 06:00:56,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:56,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:56,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:56,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:56,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 349 [2024-11-19 06:00:56,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 283 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:56,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:56,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 349 [2024-11-19 06:00:56,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:56,548 INFO L124 PetriNetUnfolderBase]: 61/838 cut-off events. [2024-11-19 06:00:56,548 INFO L125 PetriNetUnfolderBase]: For 62/63 co-relation queries the response was YES. [2024-11-19 06:00:56,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 838 events. 61/838 cut-off events. For 62/63 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3604 event pairs, 34 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1024. Up to 114 conditions per place. [2024-11-19 06:00:56,553 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 0 selfloop transitions, 0 changer transitions 283/283 dead transitions. [2024-11-19 06:00:56,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 283 transitions, 684 flow [2024-11-19 06:00:56,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2024-11-19 06:00:56,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216809933142311 [2024-11-19 06:00:56,555 INFO L175 Difference]: Start difference. First operand has 290 places, 283 transitions, 645 flow. Second operand 3 states and 965 transitions. [2024-11-19 06:00:56,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 283 transitions, 684 flow [2024-11-19 06:00:56,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 283 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:56,558 INFO L231 Difference]: Finished difference. Result has 289 places, 0 transitions, 0 flow [2024-11-19 06:00:56,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=289, PETRI_TRANSITIONS=0} [2024-11-19 06:00:56,559 INFO L277 CegarLoopForPetriNet]: 319 programPoint places, -30 predicate places. [2024-11-19 06:00:56,559 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 0 transitions, 0 flow [2024-11-19 06:00:56,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:56,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2024-11-19 06:00:56,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2024-11-19 06:00:56,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2024-11-19 06:00:56,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2024-11-19 06:00:56,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2024-11-19 06:00:56,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2024-11-19 06:00:56,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2024-11-19 06:00:56,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2024-11-19 06:00:56,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2024-11-19 06:00:56,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2024-11-19 06:00:56,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2024-11-19 06:00:56,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2024-11-19 06:00:56,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2024-11-19 06:00:56,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2024-11-19 06:00:56,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2024-11-19 06:00:56,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2024-11-19 06:00:56,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2024-11-19 06:00:56,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2024-11-19 06:00:56,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2024-11-19 06:00:56,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2024-11-19 06:00:56,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2024-11-19 06:00:56,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2024-11-19 06:00:56,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2024-11-19 06:00:56,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2024-11-19 06:00:56,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2024-11-19 06:00:56,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2024-11-19 06:00:56,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2024-11-19 06:00:56,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2024-11-19 06:00:56,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2024-11-19 06:00:56,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2024-11-19 06:00:56,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 71 remaining) [2024-11-19 06:00:56,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2024-11-19 06:00:56,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 71 remaining) [2024-11-19 06:00:56,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 71 remaining) [2024-11-19 06:00:56,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 71 remaining) [2024-11-19 06:00:56,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2024-11-19 06:00:56,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2024-11-19 06:00:56,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2024-11-19 06:00:56,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2024-11-19 06:00:56,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2024-11-19 06:00:56,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2024-11-19 06:00:56,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2024-11-19 06:00:56,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2024-11-19 06:00:56,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2024-11-19 06:00:56,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2024-11-19 06:00:56,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2024-11-19 06:00:56,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2024-11-19 06:00:56,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2024-11-19 06:00:56,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2024-11-19 06:00:56,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2024-11-19 06:00:56,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2024-11-19 06:00:56,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2024-11-19 06:00:56,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2024-11-19 06:00:56,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2024-11-19 06:00:56,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2024-11-19 06:00:56,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2024-11-19 06:00:56,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2024-11-19 06:00:56,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2024-11-19 06:00:56,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2024-11-19 06:00:56,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2024-11-19 06:00:56,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2024-11-19 06:00:56,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2024-11-19 06:00:56,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:00:56,571 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:56,577 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 06:00:56,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:00:56,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:00:56 BasicIcfg [2024-11-19 06:00:56,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:00:56,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:00:56,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:00:56,582 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:00:56,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:50" (3/4) ... [2024-11-19 06:00:56,584 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 06:00:56,587 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 06:00:56,587 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 06:00:56,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-19 06:00:56,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 06:00:56,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 06:00:56,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 06:00:56,669 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:00:56,672 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 06:00:56,672 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:00:56,673 INFO L158 Benchmark]: Toolchain (without parser) took 7582.98ms. Allocated memory was 188.7MB in the beginning and 398.5MB in the end (delta: 209.7MB). Free memory was 109.6MB in the beginning and 155.6MB in the end (delta: -46.0MB). Peak memory consumption was 165.4MB. Max. memory is 16.1GB. [2024-11-19 06:00:56,673 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 188.7MB. Free memory was 155.2MB in the beginning and 155.0MB in the end (delta: 218.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:00:56,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.96ms. Allocated memory is still 188.7MB. Free memory was 109.4MB in the beginning and 145.5MB in the end (delta: -36.1MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-19 06:00:56,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.05ms. Allocated memory is still 188.7MB. Free memory was 145.5MB in the beginning and 142.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:00:56,675 INFO L158 Benchmark]: Boogie Preprocessor took 84.22ms. Allocated memory is still 188.7MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:00:56,676 INFO L158 Benchmark]: RCFGBuilder took 954.44ms. Allocated memory is still 188.7MB. Free memory was 140.6MB in the beginning and 132.6MB in the end (delta: 8.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 06:00:56,676 INFO L158 Benchmark]: TraceAbstraction took 6045.65ms. Allocated memory was 188.7MB in the beginning and 398.5MB in the end (delta: 209.7MB). Free memory was 131.5MB in the beginning and 161.9MB in the end (delta: -30.4MB). Peak memory consumption was 180.4MB. Max. memory is 16.1GB. [2024-11-19 06:00:56,676 INFO L158 Benchmark]: Witness Printer took 90.69ms. Allocated memory is still 398.5MB. Free memory was 161.9MB in the beginning and 155.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 06:00:56,677 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 188.7MB. Free memory was 155.2MB in the beginning and 155.0MB in the end (delta: 218.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.96ms. Allocated memory is still 188.7MB. Free memory was 109.4MB in the beginning and 145.5MB in the end (delta: -36.1MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.05ms. Allocated memory is still 188.7MB. Free memory was 145.5MB in the beginning and 142.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.22ms. Allocated memory is still 188.7MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 954.44ms. Allocated memory is still 188.7MB. Free memory was 140.6MB in the beginning and 132.6MB in the end (delta: 8.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6045.65ms. Allocated memory was 188.7MB in the beginning and 398.5MB in the end (delta: 209.7MB). Free memory was 131.5MB in the beginning and 161.9MB in the end (delta: -30.4MB). Peak memory consumption was 180.4MB. Max. memory is 16.1GB. * Witness Printer took 90.69ms. Allocated memory is still 398.5MB. Free memory was 161.9MB in the beginning and 155.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 523 locations, 71 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1120 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1293 IncrementalHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 187 mSDtfsCounter, 1293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=677occurred in iteration=14, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1630 NumberOfCodeBlocks, 1630 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1613 ConstructedInterpolants, 0 QuantifiedInterpolants, 2328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 06:00:56,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE