./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f 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-5.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 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:40:32,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:40:32,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:40:32,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:40:32,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:40:32,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:40:32,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:40:32,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:40:32,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:40:32,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:40:32,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:40:32,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:40:32,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:40:32,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:40:32,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:40:32,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:40:32,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:40:32,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:40:32,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:40:32,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:40:32,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:40:32,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:40:32,722 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:40:32,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:40:32,722 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:40:32,723 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:40:32,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:40:32,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:40:32,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:40:32,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:40:32,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:40:32,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:32,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:40:32,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:40:32,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:40:32,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:40:32,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:40:32,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:40:32,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:40:32,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:40:32,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:40:32,727 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 -> 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 [2024-11-12 12:40:32,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:40:32,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:40:32,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:40:32,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:40:32,987 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:40:32,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-5.wvr.c [2024-11-12 12:40:34,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:40:34,644 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:40:34,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c [2024-11-12 12:40:34,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4c1488cb/c6883c538380465491fe1ee0b4deb9ba/FLAGf7c7f9257 [2024-11-12 12:40:35,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4c1488cb/c6883c538380465491fe1ee0b4deb9ba [2024-11-12 12:40:35,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:40:35,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:40:35,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:35,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:40:35,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:40:35,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8cb054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35, skipping insertion in model container [2024-11-12 12:40:35,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:40:35,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:35,370 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:40:35,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:35,433 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:40:35,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35 WrapperNode [2024-11-12 12:40:35,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:35,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:35,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:40:35,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:40:35,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,507 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 330 [2024-11-12 12:40:35,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:35,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:40:35,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:40:35,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:40:35,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:40:35,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:40:35,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:40:35,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:40:35,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (1/1) ... [2024-11-12 12:40:35,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:35,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:35,610 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-12 12:40:35,614 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-12 12:40:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:40:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:40:35,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:40:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:40:35,662 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:40:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:40:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:40:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:40:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:40:35,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:40:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:40:35,664 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:40:35,767 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:40:35,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:40:36,327 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:40:36,328 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:40:36,351 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:40:36,352 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 12:40:36,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:36 BoogieIcfgContainer [2024-11-12 12:40:36,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:40:36,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:40:36,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:40:36,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:40:36,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:40:35" (1/3) ... [2024-11-12 12:40:36,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4a8211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:36, skipping insertion in model container [2024-11-12 12:40:36,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:35" (2/3) ... [2024-11-12 12:40:36,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4a8211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:36, skipping insertion in model container [2024-11-12 12:40:36,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:36" (3/3) ... [2024-11-12 12:40:36,361 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2024-11-12 12:40:36,378 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:40:36,379 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-12 12:40:36,380 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:40:36,531 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:40:36,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 423 places, 439 transitions, 892 flow [2024-11-12 12:40:36,761 INFO L124 PetriNetUnfolderBase]: 23/437 cut-off events. [2024-11-12 12:40:36,761 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:40:36,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 437 events. 23/437 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 532 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 300. Up to 2 conditions per place. [2024-11-12 12:40:36,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 423 places, 439 transitions, 892 flow [2024-11-12 12:40:36,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 405 places, 420 transitions, 852 flow [2024-11-12 12:40:36,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:40:36,816 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;@71daee87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:40:36,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 99 error locations. [2024-11-12 12:40:36,820 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:40:36,822 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-11-12 12:40:36,822 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:40:36,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:36,823 INFO L206 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-12 12:40:36,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:36,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1426788379, now seen corresponding path program 1 times [2024-11-12 12:40:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:36,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410902826] [2024-11-12 12:40:36,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:37,011 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-12 12:40:37,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:37,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410902826] [2024-11-12 12:40:37,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410902826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:37,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:37,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:37,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103124934] [2024-11-12 12:40:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:37,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:37,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:37,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:37,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2024-11-12 12:40:37,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 420 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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-12 12:40:37,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:37,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2024-11-12 12:40:37,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:37,187 INFO L124 PetriNetUnfolderBase]: 16/514 cut-off events. [2024-11-12 12:40:37,187 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-12 12:40:37,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 514 events. 16/514 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1066 event pairs, 3 based on Foata normal form. 13/434 useless extension candidates. Maximal degree in co-relation 409. Up to 19 conditions per place. [2024-11-12 12:40:37,195 INFO L140 encePairwiseOnDemand]: 423/439 looper letters, 10 selfloop transitions, 2 changer transitions 4/406 dead transitions. [2024-11-12 12:40:37,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 848 flow [2024-11-12 12:40:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2024-11-12 12:40:37,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536826119969628 [2024-11-12 12:40:37,222 INFO L175 Difference]: Start difference. First operand has 405 places, 420 transitions, 852 flow. Second operand 3 states and 1256 transitions. [2024-11-12 12:40:37,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 848 flow [2024-11-12 12:40:37,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 406 transitions, 840 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 12:40:37,236 INFO L231 Difference]: Finished difference. Result has 402 places, 402 transitions, 812 flow [2024-11-12 12:40:37,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=402, PETRI_TRANSITIONS=402} [2024-11-12 12:40:37,245 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -3 predicate places. [2024-11-12 12:40:37,245 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 402 transitions, 812 flow [2024-11-12 12:40:37,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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-12 12:40:37,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:37,247 INFO L206 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-12 12:40:37,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:40:37,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:37,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash 639706644, now seen corresponding path program 1 times [2024-11-12 12:40:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984862512] [2024-11-12 12:40:37,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:37,328 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-12 12:40:37,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:37,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984862512] [2024-11-12 12:40:37,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984862512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:37,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:37,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:37,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344998787] [2024-11-12 12:40:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:37,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:37,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:37,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:37,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 439 [2024-11-12 12:40:37,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 402 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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-12 12:40:37,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:37,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 439 [2024-11-12 12:40:37,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:37,542 INFO L124 PetriNetUnfolderBase]: 26/649 cut-off events. [2024-11-12 12:40:37,542 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:40:37,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 649 events. 26/649 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1622 event pairs, 11 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 668. Up to 38 conditions per place. [2024-11-12 12:40:37,548 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 15 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-11-12 12:40:37,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 844 flow [2024-11-12 12:40:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2024-11-12 12:40:37,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9362186788154897 [2024-11-12 12:40:37,553 INFO L175 Difference]: Start difference. First operand has 402 places, 402 transitions, 812 flow. Second operand 3 states and 1233 transitions. [2024-11-12 12:40:37,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 844 flow [2024-11-12 12:40:37,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 401 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:37,561 INFO L231 Difference]: Finished difference. Result has 397 places, 401 transitions, 810 flow [2024-11-12 12:40:37,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=397, PETRI_TRANSITIONS=401} [2024-11-12 12:40:37,563 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -8 predicate places. [2024-11-12 12:40:37,563 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 401 transitions, 810 flow [2024-11-12 12:40:37,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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-12 12:40:37,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:37,565 INFO L206 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-12 12:40:37,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:40:37,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:37,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1202620902, now seen corresponding path program 1 times [2024-11-12 12:40:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:37,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568014651] [2024-11-12 12:40:37,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:37,624 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-12 12:40:37,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568014651] [2024-11-12 12:40:37,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568014651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:37,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:37,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214391568] [2024-11-12 12:40:37,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:37,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:37,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:37,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:37,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:37,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-12 12:40:37,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 401 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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-12 12:40:37,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:37,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-12 12:40:37,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:37,945 INFO L124 PetriNetUnfolderBase]: 96/1418 cut-off events. [2024-11-12 12:40:37,945 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-12 12:40:37,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1418 events. 96/1418 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 6351 event pairs, 32 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 1509. Up to 117 conditions per place. [2024-11-12 12:40:37,960 INFO L140 encePairwiseOnDemand]: 430/439 looper letters, 20 selfloop transitions, 1 changer transitions 0/393 dead transitions. [2024-11-12 12:40:37,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 393 transitions, 836 flow [2024-11-12 12:40:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2024-11-12 12:40:37,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9217919514047077 [2024-11-12 12:40:37,964 INFO L175 Difference]: Start difference. First operand has 397 places, 401 transitions, 810 flow. Second operand 3 states and 1214 transitions. [2024-11-12 12:40:37,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 393 transitions, 836 flow [2024-11-12 12:40:37,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 393 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:37,973 INFO L231 Difference]: Finished difference. Result has 389 places, 393 transitions, 792 flow [2024-11-12 12:40:37,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=389, PETRI_TRANSITIONS=393} [2024-11-12 12:40:37,975 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -16 predicate places. [2024-11-12 12:40:37,976 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 393 transitions, 792 flow [2024-11-12 12:40:37,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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-12 12:40:37,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:37,977 INFO L206 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-12 12:40:37,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:40:37,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:37,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash 845562235, now seen corresponding path program 1 times [2024-11-12 12:40:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255625373] [2024-11-12 12:40:37,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:38,104 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-12 12:40:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:38,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255625373] [2024-11-12 12:40:38,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255625373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:38,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:38,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:38,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248192011] [2024-11-12 12:40:38,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:38,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:38,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:38,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:38,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:38,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 439 [2024-11-12 12:40:38,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 393 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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-12 12:40:38,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:38,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 439 [2024-11-12 12:40:38,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:38,261 INFO L124 PetriNetUnfolderBase]: 26/635 cut-off events. [2024-11-12 12:40:38,261 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:40:38,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 635 events. 26/635 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1601 event pairs, 11 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 643. Up to 36 conditions per place. [2024-11-12 12:40:38,267 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 13 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2024-11-12 12:40:38,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 392 transitions, 820 flow [2024-11-12 12:40:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-11-12 12:40:38,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9392558845861807 [2024-11-12 12:40:38,271 INFO L175 Difference]: Start difference. First operand has 389 places, 393 transitions, 792 flow. Second operand 3 states and 1237 transitions. [2024-11-12 12:40:38,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 392 transitions, 820 flow [2024-11-12 12:40:38,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 392 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:38,278 INFO L231 Difference]: Finished difference. Result has 389 places, 392 transitions, 793 flow [2024-11-12 12:40:38,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=389, PETRI_TRANSITIONS=392} [2024-11-12 12:40:38,280 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -16 predicate places. [2024-11-12 12:40:38,281 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 392 transitions, 793 flow [2024-11-12 12:40:38,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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-12 12:40:38,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:38,282 INFO L206 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-12 12:40:38,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:40:38,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:38,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash 602574228, now seen corresponding path program 1 times [2024-11-12 12:40:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112841597] [2024-11-12 12:40:38,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:38,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:38,848 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-12 12:40:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112841597] [2024-11-12 12:40:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112841597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:38,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:38,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:38,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259014232] [2024-11-12 12:40:38,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:38,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:38,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:38,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:38,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:39,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 439 [2024-11-12 12:40:39,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 392 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 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-12 12:40:39,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:39,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 439 [2024-11-12 12:40:39,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:39,255 INFO L124 PetriNetUnfolderBase]: 188/1752 cut-off events. [2024-11-12 12:40:39,255 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-11-12 12:40:39,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1752 events. 188/1752 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8939 event pairs, 104 based on Foata normal form. 0/1456 useless extension candidates. Maximal degree in co-relation 2025. Up to 292 conditions per place. [2024-11-12 12:40:39,268 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 36 selfloop transitions, 5 changer transitions 0/391 dead transitions. [2024-11-12 12:40:39,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 391 transitions, 873 flow [2024-11-12 12:40:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2334 transitions. [2024-11-12 12:40:39,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8861047835990888 [2024-11-12 12:40:39,272 INFO L175 Difference]: Start difference. First operand has 389 places, 392 transitions, 793 flow. Second operand 6 states and 2334 transitions. [2024-11-12 12:40:39,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 391 transitions, 873 flow [2024-11-12 12:40:39,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 391 transitions, 869 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:39,281 INFO L231 Difference]: Finished difference. Result has 391 places, 391 transitions, 797 flow [2024-11-12 12:40:39,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=391, PETRI_TRANSITIONS=391} [2024-11-12 12:40:39,282 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -14 predicate places. [2024-11-12 12:40:39,283 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 391 transitions, 797 flow [2024-11-12 12:40:39,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 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-12 12:40:39,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:39,284 INFO L206 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-12 12:40:39,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:40:39,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:39,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash 736108395, now seen corresponding path program 1 times [2024-11-12 12:40:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:39,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874692182] [2024-11-12 12:40:39,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:39,320 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-12 12:40:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:39,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874692182] [2024-11-12 12:40:39,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874692182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:39,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:39,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206597155] [2024-11-12 12:40:39,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:39,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:39,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:39,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2024-11-12 12:40:39,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 391 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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-12 12:40:39,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:39,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2024-11-12 12:40:39,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:39,463 INFO L124 PetriNetUnfolderBase]: 40/1161 cut-off events. [2024-11-12 12:40:39,464 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:40:39,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 1161 events. 40/1161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4665 event pairs, 8 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1189. Up to 32 conditions per place. [2024-11-12 12:40:39,472 INFO L140 encePairwiseOnDemand]: 435/439 looper letters, 10 selfloop transitions, 1 changer transitions 0/388 dead transitions. [2024-11-12 12:40:39,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 388 transitions, 813 flow [2024-11-12 12:40:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1244 transitions. [2024-11-12 12:40:39,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9445709946848899 [2024-11-12 12:40:39,476 INFO L175 Difference]: Start difference. First operand has 391 places, 391 transitions, 797 flow. Second operand 3 states and 1244 transitions. [2024-11-12 12:40:39,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 388 transitions, 813 flow [2024-11-12 12:40:39,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 388 transitions, 803 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:39,483 INFO L231 Difference]: Finished difference. Result has 385 places, 388 transitions, 783 flow [2024-11-12 12:40:39,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=385, PETRI_TRANSITIONS=388} [2024-11-12 12:40:39,485 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -20 predicate places. [2024-11-12 12:40:39,486 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 388 transitions, 783 flow [2024-11-12 12:40:39,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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-12 12:40:39,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:39,488 INFO L206 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-12 12:40:39,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:40:39,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:39,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1894450176, now seen corresponding path program 1 times [2024-11-12 12:40:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488524530] [2024-11-12 12:40:39,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:39,555 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-12 12:40:39,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488524530] [2024-11-12 12:40:39,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488524530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:39,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:39,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88615706] [2024-11-12 12:40:39,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:39,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:39,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:39,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:39,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 439 [2024-11-12 12:40:39,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 388 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 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-12 12:40:39,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:39,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 439 [2024-11-12 12:40:39,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:39,633 INFO L124 PetriNetUnfolderBase]: 19/439 cut-off events. [2024-11-12 12:40:39,633 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:40:39,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 439 events. 19/439 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 706 event pairs, 1 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 447. Up to 21 conditions per place. [2024-11-12 12:40:39,637 INFO L140 encePairwiseOnDemand]: 432/439 looper letters, 11 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2024-11-12 12:40:39,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 385 transitions, 806 flow [2024-11-12 12:40:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-11-12 12:40:39,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9407744874715261 [2024-11-12 12:40:39,640 INFO L175 Difference]: Start difference. First operand has 385 places, 388 transitions, 783 flow. Second operand 3 states and 1239 transitions. [2024-11-12 12:40:39,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 385 transitions, 806 flow [2024-11-12 12:40:39,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 385 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:39,646 INFO L231 Difference]: Finished difference. Result has 382 places, 384 transitions, 780 flow [2024-11-12 12:40:39,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=382, PETRI_TRANSITIONS=384} [2024-11-12 12:40:39,648 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -23 predicate places. [2024-11-12 12:40:39,649 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 384 transitions, 780 flow [2024-11-12 12:40:39,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 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-12 12:40:39,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:39,650 INFO L206 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-12 12:40:39,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:40:39,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:39,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:39,652 INFO L85 PathProgramCache]: Analyzing trace with hash 296939360, now seen corresponding path program 1 times [2024-11-12 12:40:39,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:39,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969531782] [2024-11-12 12:40:39,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:39,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:39,699 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-12 12:40:39,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:39,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969531782] [2024-11-12 12:40:39,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969531782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:39,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:39,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:39,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265109308] [2024-11-12 12:40:39,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:39,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:39,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:39,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:39,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 439 [2024-11-12 12:40:39,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 384 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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-12 12:40:39,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:39,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 439 [2024-11-12 12:40:39,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:39,855 INFO L124 PetriNetUnfolderBase]: 49/568 cut-off events. [2024-11-12 12:40:39,856 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-12 12:40:39,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 568 events. 49/568 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1665 event pairs, 5 based on Foata normal form. 1/516 useless extension candidates. Maximal degree in co-relation 653. Up to 91 conditions per place. [2024-11-12 12:40:39,859 INFO L140 encePairwiseOnDemand]: 412/439 looper letters, 29 selfloop transitions, 10 changer transitions 4/369 dead transitions. [2024-11-12 12:40:39,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 369 transitions, 833 flow [2024-11-12 12:40:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions. [2024-11-12 12:40:39,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8792710706150342 [2024-11-12 12:40:39,862 INFO L175 Difference]: Start difference. First operand has 382 places, 384 transitions, 780 flow. Second operand 3 states and 1158 transitions. [2024-11-12 12:40:39,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 369 transitions, 833 flow [2024-11-12 12:40:39,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 369 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:39,869 INFO L231 Difference]: Finished difference. Result has 366 places, 364 transitions, 753 flow [2024-11-12 12:40:39,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=366, PETRI_TRANSITIONS=364} [2024-11-12 12:40:39,871 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -39 predicate places. [2024-11-12 12:40:39,871 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 364 transitions, 753 flow [2024-11-12 12:40:39,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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-12 12:40:39,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:39,873 INFO L206 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-12 12:40:39,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:40:39,873 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:39,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1047153410, now seen corresponding path program 1 times [2024-11-12 12:40:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:39,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525635570] [2024-11-12 12:40:39,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:39,915 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-12 12:40:39,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:39,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525635570] [2024-11-12 12:40:39,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525635570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:39,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:39,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:39,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692822813] [2024-11-12 12:40:39,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:39,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:39,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:39,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:39,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:39,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 439 [2024-11-12 12:40:39,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 364 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 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-12 12:40:39,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:39,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 439 [2024-11-12 12:40:39,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:40,074 INFO L124 PetriNetUnfolderBase]: 85/1157 cut-off events. [2024-11-12 12:40:40,075 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-12 12:40:40,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1157 events. 85/1157 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4640 event pairs, 10 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 1280. Up to 104 conditions per place. [2024-11-12 12:40:40,081 INFO L140 encePairwiseOnDemand]: 431/439 looper letters, 18 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-12 12:40:40,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 791 flow [2024-11-12 12:40:40,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2024-11-12 12:40:40,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9331814730447988 [2024-11-12 12:40:40,084 INFO L175 Difference]: Start difference. First operand has 366 places, 364 transitions, 753 flow. Second operand 3 states and 1229 transitions. [2024-11-12 12:40:40,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 791 flow [2024-11-12 12:40:40,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 771 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:40,092 INFO L231 Difference]: Finished difference. Result has 357 places, 360 transitions, 735 flow [2024-11-12 12:40:40,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=357, PETRI_TRANSITIONS=360} [2024-11-12 12:40:40,094 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -48 predicate places. [2024-11-12 12:40:40,094 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 360 transitions, 735 flow [2024-11-12 12:40:40,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 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-12 12:40:40,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:40,095 INFO L206 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-12 12:40:40,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:40:40,095 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:40,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1351136344, now seen corresponding path program 1 times [2024-11-12 12:40:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752155760] [2024-11-12 12:40:40,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:40,198 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-12 12:40:40,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:40,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752155760] [2024-11-12 12:40:40,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752155760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:40,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:40,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:40:40,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746611237] [2024-11-12 12:40:40,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:40,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:40:40,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:40,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:40:40,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:40:40,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 439 [2024-11-12 12:40:40,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 360 transitions, 735 flow. Second operand has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 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-12 12:40:40,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:40,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 439 [2024-11-12 12:40:40,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:40,434 INFO L124 PetriNetUnfolderBase]: 49/1348 cut-off events. [2024-11-12 12:40:40,434 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:40:40,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1348 events. 49/1348 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5248 event pairs, 3 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 1383. Up to 18 conditions per place. [2024-11-12 12:40:40,443 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 13 selfloop transitions, 6 changer transitions 0/369 dead transitions. [2024-11-12 12:40:40,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 369 transitions, 795 flow [2024-11-12 12:40:40,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:40:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 12:40:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2085 transitions. [2024-11-12 12:40:40,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498861047835991 [2024-11-12 12:40:40,450 INFO L175 Difference]: Start difference. First operand has 357 places, 360 transitions, 735 flow. Second operand 5 states and 2085 transitions. [2024-11-12 12:40:40,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 369 transitions, 795 flow [2024-11-12 12:40:40,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 369 transitions, 795 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:40,456 INFO L231 Difference]: Finished difference. Result has 364 places, 364 transitions, 773 flow [2024-11-12 12:40:40,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=773, PETRI_PLACES=364, PETRI_TRANSITIONS=364} [2024-11-12 12:40:40,458 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -41 predicate places. [2024-11-12 12:40:40,458 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 364 transitions, 773 flow [2024-11-12 12:40:40,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 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-12 12:40:40,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:40,460 INFO L206 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-12 12:40:40,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:40:40,460 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:40,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:40,461 INFO L85 PathProgramCache]: Analyzing trace with hash -357243765, now seen corresponding path program 1 times [2024-11-12 12:40:40,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:40,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740315583] [2024-11-12 12:40:40,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:40,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:40,858 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-12 12:40:40,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:40,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740315583] [2024-11-12 12:40:40,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740315583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:40,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:40,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452485607] [2024-11-12 12:40:40,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:40,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:40,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:40,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:41,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 439 [2024-11-12 12:40:41,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 364 transitions, 773 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 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-12 12:40:41,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:41,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 439 [2024-11-12 12:40:41,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:41,399 INFO L124 PetriNetUnfolderBase]: 42/1051 cut-off events. [2024-11-12 12:40:41,399 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-12 12:40:41,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 1051 events. 42/1051 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3378 event pairs, 2 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1107. Up to 17 conditions per place. [2024-11-12 12:40:41,411 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 15 selfloop transitions, 6 changer transitions 0/367 dead transitions. [2024-11-12 12:40:41,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 367 transitions, 825 flow [2024-11-12 12:40:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2457 transitions. [2024-11-12 12:40:41,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9328018223234624 [2024-11-12 12:40:41,417 INFO L175 Difference]: Start difference. First operand has 364 places, 364 transitions, 773 flow. Second operand 6 states and 2457 transitions. [2024-11-12 12:40:41,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 367 transitions, 825 flow [2024-11-12 12:40:41,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 367 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:41,423 INFO L231 Difference]: Finished difference. Result has 368 places, 363 transitions, 783 flow [2024-11-12 12:40:41,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=368, PETRI_TRANSITIONS=363} [2024-11-12 12:40:41,424 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -37 predicate places. [2024-11-12 12:40:41,425 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 363 transitions, 783 flow [2024-11-12 12:40:41,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 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-12 12:40:41,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:41,428 INFO L206 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-12 12:40:41,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:40:41,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:41,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1931297439, now seen corresponding path program 1 times [2024-11-12 12:40:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:41,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957549368] [2024-11-12 12:40:41,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:41,528 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-12 12:40:41,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:41,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957549368] [2024-11-12 12:40:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957549368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:41,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:41,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:40:41,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136547071] [2024-11-12 12:40:41,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:41,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:40:41,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:41,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:40:41,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:40:41,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 439 [2024-11-12 12:40:41,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 363 transitions, 783 flow. Second operand has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 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-12 12:40:41,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:41,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 439 [2024-11-12 12:40:41,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:41,827 INFO L124 PetriNetUnfolderBase]: 63/1321 cut-off events. [2024-11-12 12:40:41,828 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2024-11-12 12:40:41,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1321 events. 63/1321 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5829 event pairs, 6 based on Foata normal form. 0/1198 useless extension candidates. Maximal degree in co-relation 1430. Up to 67 conditions per place. [2024-11-12 12:40:41,838 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 16 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2024-11-12 12:40:41,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 371 transitions, 846 flow [2024-11-12 12:40:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:40:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 12:40:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2068 transitions. [2024-11-12 12:40:41,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9421412300683372 [2024-11-12 12:40:41,844 INFO L175 Difference]: Start difference. First operand has 368 places, 363 transitions, 783 flow. Second operand 5 states and 2068 transitions. [2024-11-12 12:40:41,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 371 transitions, 846 flow [2024-11-12 12:40:41,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 371 transitions, 834 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:41,850 INFO L231 Difference]: Finished difference. Result has 370 places, 367 transitions, 809 flow [2024-11-12 12:40:41,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=809, PETRI_PLACES=370, PETRI_TRANSITIONS=367} [2024-11-12 12:40:41,852 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -35 predicate places. [2024-11-12 12:40:41,853 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 367 transitions, 809 flow [2024-11-12 12:40:41,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 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-12 12:40:41,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:41,854 INFO L206 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-12 12:40:41,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:40:41,855 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash 120975630, now seen corresponding path program 1 times [2024-11-12 12:40:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:41,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647559921] [2024-11-12 12:40:41,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:41,897 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-12 12:40:41,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:41,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647559921] [2024-11-12 12:40:41,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647559921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:41,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:41,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705351917] [2024-11-12 12:40:41,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:41,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:41,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:41,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:41,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:41,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 439 [2024-11-12 12:40:41,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 367 transitions, 809 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-12 12:40:41,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:41,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 439 [2024-11-12 12:40:41,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:42,059 INFO L124 PetriNetUnfolderBase]: 37/937 cut-off events. [2024-11-12 12:40:42,059 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-12 12:40:42,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 937 events. 37/937 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2536 event pairs, 10 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1025. Up to 29 conditions per place. [2024-11-12 12:40:42,064 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 9 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-12 12:40:42,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 367 transitions, 832 flow [2024-11-12 12:40:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2024-11-12 12:40:42,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453302961275627 [2024-11-12 12:40:42,067 INFO L175 Difference]: Start difference. First operand has 370 places, 367 transitions, 809 flow. Second operand 3 states and 1245 transitions. [2024-11-12 12:40:42,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 367 transitions, 832 flow [2024-11-12 12:40:42,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 367 transitions, 832 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:42,076 INFO L231 Difference]: Finished difference. Result has 371 places, 366 transitions, 811 flow [2024-11-12 12:40:42,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=371, PETRI_TRANSITIONS=366} [2024-11-12 12:40:42,078 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -34 predicate places. [2024-11-12 12:40:42,078 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 366 transitions, 811 flow [2024-11-12 12:40:42,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-12 12:40:42,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:42,079 INFO L206 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-12 12:40:42,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:40:42,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:42,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash 385258091, now seen corresponding path program 1 times [2024-11-12 12:40:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:42,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362618172] [2024-11-12 12:40:42,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:42,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:42,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362618172] [2024-11-12 12:40:42,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362618172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:42,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:42,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092552039] [2024-11-12 12:40:42,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:42,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:42,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:42,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:42,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:42,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 439 [2024-11-12 12:40:42,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 366 transitions, 811 flow. Second operand has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 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-12 12:40:42,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:42,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 439 [2024-11-12 12:40:42,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:42,900 INFO L124 PetriNetUnfolderBase]: 102/1146 cut-off events. [2024-11-12 12:40:42,901 INFO L125 PetriNetUnfolderBase]: For 91/92 co-relation queries the response was YES. [2024-11-12 12:40:42,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1146 events. 102/1146 cut-off events. For 91/92 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5719 event pairs, 12 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1447. Up to 84 conditions per place. [2024-11-12 12:40:42,912 INFO L140 encePairwiseOnDemand]: 409/439 looper letters, 19 selfloop transitions, 26 changer transitions 0/365 dead transitions. [2024-11-12 12:40:42,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 365 transitions, 903 flow [2024-11-12 12:40:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2317 transitions. [2024-11-12 12:40:42,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8796507213363706 [2024-11-12 12:40:42,918 INFO L175 Difference]: Start difference. First operand has 371 places, 366 transitions, 811 flow. Second operand 6 states and 2317 transitions. [2024-11-12 12:40:42,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 365 transitions, 903 flow [2024-11-12 12:40:42,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 365 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:42,924 INFO L231 Difference]: Finished difference. Result has 369 places, 361 transitions, 849 flow [2024-11-12 12:40:42,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=849, PETRI_PLACES=369, PETRI_TRANSITIONS=361} [2024-11-12 12:40:42,925 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -36 predicate places. [2024-11-12 12:40:42,926 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 361 transitions, 849 flow [2024-11-12 12:40:42,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 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-12 12:40:42,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:42,927 INFO L206 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-12 12:40:42,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:40:42,928 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:42,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1119386450, now seen corresponding path program 1 times [2024-11-12 12:40:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474503916] [2024-11-12 12:40:42,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:42,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474503916] [2024-11-12 12:40:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474503916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:42,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:42,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113858945] [2024-11-12 12:40:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:42,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:43,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-12 12:40:43,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 361 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:43,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:43,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-12 12:40:43,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:43,264 INFO L124 PetriNetUnfolderBase]: 89/1309 cut-off events. [2024-11-12 12:40:43,264 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2024-11-12 12:40:43,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 1309 events. 89/1309 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6391 event pairs, 50 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1687. Up to 170 conditions per place. [2024-11-12 12:40:43,275 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 25 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-12 12:40:43,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 361 transitions, 904 flow [2024-11-12 12:40:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-12 12:40:43,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-12 12:40:43,279 INFO L175 Difference]: Start difference. First operand has 369 places, 361 transitions, 849 flow. Second operand 3 states and 1213 transitions. [2024-11-12 12:40:43,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 361 transitions, 904 flow [2024-11-12 12:40:43,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 361 transitions, 852 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:43,285 INFO L231 Difference]: Finished difference. Result has 365 places, 360 transitions, 799 flow [2024-11-12 12:40:43,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=365, PETRI_TRANSITIONS=360} [2024-11-12 12:40:43,286 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -40 predicate places. [2024-11-12 12:40:43,287 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 360 transitions, 799 flow [2024-11-12 12:40:43,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:43,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:43,287 INFO L206 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-12 12:40:43,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:40:43,288 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:43,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash 290366597, now seen corresponding path program 1 times [2024-11-12 12:40:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:43,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904446847] [2024-11-12 12:40:43,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:43,331 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-12 12:40:43,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:43,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904446847] [2024-11-12 12:40:43,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904446847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:43,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:43,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:43,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849145570] [2024-11-12 12:40:43,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:43,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:43,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:43,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:43,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-12 12:40:43,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 360 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-12 12:40:43,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:43,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-12 12:40:43,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:43,604 INFO L124 PetriNetUnfolderBase]: 88/1272 cut-off events. [2024-11-12 12:40:43,605 INFO L125 PetriNetUnfolderBase]: For 79/80 co-relation queries the response was YES. [2024-11-12 12:40:43,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1272 events. 88/1272 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6149 event pairs, 50 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 1515. Up to 170 conditions per place. [2024-11-12 12:40:43,614 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 25 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-12 12:40:43,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 360 transitions, 854 flow [2024-11-12 12:40:43,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-12 12:40:43,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-12 12:40:43,617 INFO L175 Difference]: Start difference. First operand has 365 places, 360 transitions, 799 flow. Second operand 3 states and 1213 transitions. [2024-11-12 12:40:43,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 360 transitions, 854 flow [2024-11-12 12:40:43,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 360 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:43,623 INFO L231 Difference]: Finished difference. Result has 364 places, 359 transitions, 797 flow [2024-11-12 12:40:43,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=364, PETRI_TRANSITIONS=359} [2024-11-12 12:40:43,624 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -41 predicate places. [2024-11-12 12:40:43,624 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 359 transitions, 797 flow [2024-11-12 12:40:43,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-12 12:40:43,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:43,625 INFO L206 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-12 12:40:43,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:40:43,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:43,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:43,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1043521148, now seen corresponding path program 1 times [2024-11-12 12:40:43,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:43,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358507679] [2024-11-12 12:40:43,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:43,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:43,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:43,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358507679] [2024-11-12 12:40:43,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358507679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:43,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:43,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:43,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102022080] [2024-11-12 12:40:43,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:43,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:43,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:43,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:43,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-12 12:40:43,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 359 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 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-12 12:40:43,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:43,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-12 12:40:43,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:43,913 INFO L124 PetriNetUnfolderBase]: 87/1234 cut-off events. [2024-11-12 12:40:43,913 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2024-11-12 12:40:43,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 1234 events. 87/1234 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5850 event pairs, 50 based on Foata normal form. 0/1164 useless extension candidates. Maximal degree in co-relation 1476. Up to 170 conditions per place. [2024-11-12 12:40:43,922 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 25 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2024-11-12 12:40:43,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 359 transitions, 852 flow [2024-11-12 12:40:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-12 12:40:43,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-12 12:40:43,925 INFO L175 Difference]: Start difference. First operand has 364 places, 359 transitions, 797 flow. Second operand 3 states and 1213 transitions. [2024-11-12 12:40:43,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 359 transitions, 852 flow [2024-11-12 12:40:43,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 359 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:43,931 INFO L231 Difference]: Finished difference. Result has 363 places, 358 transitions, 795 flow [2024-11-12 12:40:43,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=363, PETRI_TRANSITIONS=358} [2024-11-12 12:40:43,932 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -42 predicate places. [2024-11-12 12:40:43,932 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 358 transitions, 795 flow [2024-11-12 12:40:43,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 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-12 12:40:43,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:43,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:43,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:40:43,933 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:43,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:43,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1688451731, now seen corresponding path program 1 times [2024-11-12 12:40:43,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:43,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198747969] [2024-11-12 12:40:43,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:43,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:43,991 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-12 12:40:43,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:43,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198747969] [2024-11-12 12:40:43,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198747969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:43,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:43,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:43,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86430336] [2024-11-12 12:40:43,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:43,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:43,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:43,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:43,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:44,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-12 12:40:44,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 358 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 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-12 12:40:44,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:44,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-12 12:40:44,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:44,240 INFO L124 PetriNetUnfolderBase]: 86/1196 cut-off events. [2024-11-12 12:40:44,240 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2024-11-12 12:40:44,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1196 events. 86/1196 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5610 event pairs, 50 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1438. Up to 170 conditions per place. [2024-11-12 12:40:44,246 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 25 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-12 12:40:44,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 358 transitions, 850 flow [2024-11-12 12:40:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-12 12:40:44,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-12 12:40:44,249 INFO L175 Difference]: Start difference. First operand has 363 places, 358 transitions, 795 flow. Second operand 3 states and 1213 transitions. [2024-11-12 12:40:44,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 358 transitions, 850 flow [2024-11-12 12:40:44,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 358 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:44,254 INFO L231 Difference]: Finished difference. Result has 362 places, 357 transitions, 793 flow [2024-11-12 12:40:44,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=362, PETRI_TRANSITIONS=357} [2024-11-12 12:40:44,255 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -43 predicate places. [2024-11-12 12:40:44,255 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 357 transitions, 793 flow [2024-11-12 12:40:44,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 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-12 12:40:44,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:44,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:44,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:40:44,256 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-12 12:40:44,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 863158474, now seen corresponding path program 1 times [2024-11-12 12:40:44,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:44,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123292185] [2024-11-12 12:40:44,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:44,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:44,330 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-12 12:40:44,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:44,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123292185] [2024-11-12 12:40:44,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123292185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:44,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480047095] [2024-11-12 12:40:44,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:44,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:44,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:44,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:44,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:44,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-12 12:40:44,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 357 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 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-12 12:40:44,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:44,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-12 12:40:44,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:44,557 INFO L124 PetriNetUnfolderBase]: 85/1158 cut-off events. [2024-11-12 12:40:44,558 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2024-11-12 12:40:44,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 1158 events. 85/1158 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5402 event pairs, 50 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1400. Up to 170 conditions per place. [2024-11-12 12:40:44,564 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 0 selfloop transitions, 0 changer transitions 357/357 dead transitions. [2024-11-12 12:40:44,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 848 flow [2024-11-12 12:40:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-12 12:40:44,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-12 12:40:44,568 INFO L175 Difference]: Start difference. First operand has 362 places, 357 transitions, 793 flow. Second operand 3 states and 1213 transitions. [2024-11-12 12:40:44,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 848 flow [2024-11-12 12:40:44,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 357 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:44,572 INFO L231 Difference]: Finished difference. Result has 361 places, 0 transitions, 0 flow [2024-11-12 12:40:44,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=361, PETRI_TRANSITIONS=0} [2024-11-12 12:40:44,573 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -44 predicate places. [2024-11-12 12:40:44,573 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 0 transitions, 0 flow [2024-11-12 12:40:44,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 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-12 12:40:44,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (98 of 99 remaining) [2024-11-12 12:40:44,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (97 of 99 remaining) [2024-11-12 12:40:44,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (96 of 99 remaining) [2024-11-12 12:40:44,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (95 of 99 remaining) [2024-11-12 12:40:44,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (94 of 99 remaining) [2024-11-12 12:40:44,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (93 of 99 remaining) [2024-11-12 12:40:44,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (92 of 99 remaining) [2024-11-12 12:40:44,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (91 of 99 remaining) [2024-11-12 12:40:44,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 99 remaining) [2024-11-12 12:40:44,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (89 of 99 remaining) [2024-11-12 12:40:44,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (88 of 99 remaining) [2024-11-12 12:40:44,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (87 of 99 remaining) [2024-11-12 12:40:44,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 99 remaining) [2024-11-12 12:40:44,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (85 of 99 remaining) [2024-11-12 12:40:44,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (84 of 99 remaining) [2024-11-12 12:40:44,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 99 remaining) [2024-11-12 12:40:44,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (82 of 99 remaining) [2024-11-12 12:40:44,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (81 of 99 remaining) [2024-11-12 12:40:44,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (80 of 99 remaining) [2024-11-12 12:40:44,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 99 remaining) [2024-11-12 12:40:44,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (78 of 99 remaining) [2024-11-12 12:40:44,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (77 of 99 remaining) [2024-11-12 12:40:44,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (76 of 99 remaining) [2024-11-12 12:40:44,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (75 of 99 remaining) [2024-11-12 12:40:44,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (74 of 99 remaining) [2024-11-12 12:40:44,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 99 remaining) [2024-11-12 12:40:44,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (72 of 99 remaining) [2024-11-12 12:40:44,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (71 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (70 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (67 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (66 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (65 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (64 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (63 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (62 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (61 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (60 of 99 remaining) [2024-11-12 12:40:44,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (59 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (58 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (57 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (56 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (55 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 99 remaining) [2024-11-12 12:40:44,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 99 remaining) [2024-11-12 12:40:44,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 99 remaining) [2024-11-12 12:40:44,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 99 remaining) [2024-11-12 12:40:44,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 99 remaining) [2024-11-12 12:40:44,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 99 remaining) [2024-11-12 12:40:44,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 99 remaining) [2024-11-12 12:40:44,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 99 remaining) [2024-11-12 12:40:44,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 99 remaining) [2024-11-12 12:40:44,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (40 of 99 remaining) [2024-11-12 12:40:44,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 99 remaining) [2024-11-12 12:40:44,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (38 of 99 remaining) [2024-11-12 12:40:44,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (37 of 99 remaining) [2024-11-12 12:40:44,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 99 remaining) [2024-11-12 12:40:44,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 99 remaining) [2024-11-12 12:40:44,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 99 remaining) [2024-11-12 12:40:44,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 99 remaining) [2024-11-12 12:40:44,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 99 remaining) [2024-11-12 12:40:44,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (31 of 99 remaining) [2024-11-12 12:40:44,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 99 remaining) [2024-11-12 12:40:44,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 99 remaining) [2024-11-12 12:40:44,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 99 remaining) [2024-11-12 12:40:44,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 99 remaining) [2024-11-12 12:40:44,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 99 remaining) [2024-11-12 12:40:44,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 99 remaining) [2024-11-12 12:40:44,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 99 remaining) [2024-11-12 12:40:44,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 99 remaining) [2024-11-12 12:40:44,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 99 remaining) [2024-11-12 12:40:44,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 99 remaining) [2024-11-12 12:40:44,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 99 remaining) [2024-11-12 12:40:44,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 99 remaining) [2024-11-12 12:40:44,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 99 remaining) [2024-11-12 12:40:44,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (17 of 99 remaining) [2024-11-12 12:40:44,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 99 remaining) [2024-11-12 12:40:44,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (15 of 99 remaining) [2024-11-12 12:40:44,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 99 remaining) [2024-11-12 12:40:44,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (13 of 99 remaining) [2024-11-12 12:40:44,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (12 of 99 remaining) [2024-11-12 12:40:44,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (11 of 99 remaining) [2024-11-12 12:40:44,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (10 of 99 remaining) [2024-11-12 12:40:44,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (9 of 99 remaining) [2024-11-12 12:40:44,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (8 of 99 remaining) [2024-11-12 12:40:44,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (7 of 99 remaining) [2024-11-12 12:40:44,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (6 of 99 remaining) [2024-11-12 12:40:44,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (5 of 99 remaining) [2024-11-12 12:40:44,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (4 of 99 remaining) [2024-11-12 12:40:44,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (3 of 99 remaining) [2024-11-12 12:40:44,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (2 of 99 remaining) [2024-11-12 12:40:44,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (1 of 99 remaining) [2024-11-12 12:40:44,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (0 of 99 remaining) [2024-11-12 12:40:44,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 12:40:44,590 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:44,598 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:40:44,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:40:44,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:40:44 BasicIcfg [2024-11-12 12:40:44,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:40:44,605 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:40:44,605 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:40:44,605 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:40:44,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:36" (3/4) ... [2024-11-12 12:40:44,607 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:40:44,610 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:40:44,611 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:40:44,616 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-12 12:40:44,616 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:40:44,617 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:40:44,617 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:40:44,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:40:44,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:40:44,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:40:44,709 INFO L158 Benchmark]: Toolchain (without parser) took 9680.67ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 103.4MB in the beginning and 133.7MB in the end (delta: -30.2MB). Peak memory consumption was 138.4MB. Max. memory is 16.1GB. [2024-11-12 12:40:44,709 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:40:44,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.61ms. Allocated memory is still 172.0MB. Free memory was 103.2MB in the beginning and 136.6MB in the end (delta: -33.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 12:40:44,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.66ms. Allocated memory is still 172.0MB. Free memory was 136.6MB in the beginning and 133.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:40:44,710 INFO L158 Benchmark]: Boogie Preprocessor took 50.64ms. Allocated memory is still 172.0MB. Free memory was 133.8MB in the beginning and 131.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:44,710 INFO L158 Benchmark]: RCFGBuilder took 792.40ms. Allocated memory is still 172.0MB. Free memory was 131.0MB in the beginning and 97.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-12 12:40:44,711 INFO L158 Benchmark]: TraceAbstraction took 8250.89ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 96.8MB in the beginning and 138.9MB in the end (delta: -42.1MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. [2024-11-12 12:40:44,711 INFO L158 Benchmark]: Witness Printer took 103.51ms. Allocated memory is still 339.7MB. Free memory was 138.9MB in the beginning and 133.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:40:44,712 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.11ms. Allocated memory is still 104.9MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.61ms. Allocated memory is still 172.0MB. Free memory was 103.2MB in the beginning and 136.6MB in the end (delta: -33.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.66ms. Allocated memory is still 172.0MB. Free memory was 136.6MB in the beginning and 133.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.64ms. Allocated memory is still 172.0MB. Free memory was 133.8MB in the beginning and 131.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 792.40ms. Allocated memory is still 172.0MB. Free memory was 131.0MB in the beginning and 97.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8250.89ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 96.8MB in the beginning and 138.9MB in the end (delta: -42.1MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. * Witness Printer took 103.51ms. Allocated memory is still 339.7MB. Free memory was 138.9MB in the beginning and 133.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: 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, 695 locations, 99 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: 8.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1726 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1871 IncrementalHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 95 mSDtfsCounter, 1871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=852occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2090 NumberOfCodeBlocks, 2090 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2071 ConstructedInterpolants, 0 QuantifiedInterpolants, 2790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 12:40:44,741 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