./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/security.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/security.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a3d6a7be4cff77b59978ea166f504665a94bd97447fe28973d9c58d928e868d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:17:31,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:17:31,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:17:31,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:17:31,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:17:31,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:17:31,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:17:31,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:17:31,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:17:31,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:17:31,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:17:31,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:17:31,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:17:31,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:17:31,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:17:31,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:17:31,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:17:31,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:17:31,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:17:31,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:17:31,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:17:31,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:17:31,195 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:17:31,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:17:31,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:17:31,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:17:31,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:17:31,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:17:31,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:17:31,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:17:31,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:17:31,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:31,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:17:31,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:17:31,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:17:31,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:17:31,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:17:31,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:17:31,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:17:31,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:17:31,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:17:31,208 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a3d6a7be4cff77b59978ea166f504665a94bd97447fe28973d9c58d928e868d [2024-10-11 17:17:31,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:17:31,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:17:31,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:17:31,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:17:31,610 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:17:31,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/security.wvr.c [2024-10-11 17:17:32,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:17:33,137 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:17:33,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/security.wvr.c [2024-10-11 17:17:33,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e0cfe24a/1f668d9939dc4e8387a49439fd20db17/FLAG0e4f17645 [2024-10-11 17:17:33,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e0cfe24a/1f668d9939dc4e8387a49439fd20db17 [2024-10-11 17:17:33,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:17:33,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:17:33,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:33,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:17:33,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:17:33,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302cdb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33, skipping insertion in model container [2024-10-11 17:17:33,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:17:33,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:33,778 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:17:33,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:33,824 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:17:33,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33 WrapperNode [2024-10-11 17:17:33,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:33,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:33,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:17:33,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:17:33,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,853 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2024-10-11 17:17:33,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:33,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:17:33,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:17:33,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:17:33,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:17:33,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:17:33,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:17:33,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:17:33,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:33,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:33,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:17:33,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:17:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:17:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:17:33,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:17:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:17:33,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:17:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:17:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:17:33,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:17:33,960 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:17:34,068 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:17:34,072 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:17:34,329 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:17:34,330 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:17:34,351 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:17:34,352 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:17:34,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:34 BoogieIcfgContainer [2024-10-11 17:17:34,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:17:34,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:17:34,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:17:34,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:17:34,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:17:33" (1/3) ... [2024-10-11 17:17:34,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffc0e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:34, skipping insertion in model container [2024-10-11 17:17:34,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33" (2/3) ... [2024-10-11 17:17:34,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffc0e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:34, skipping insertion in model container [2024-10-11 17:17:34,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:34" (3/3) ... [2024-10-11 17:17:34,359 INFO L112 eAbstractionObserver]: Analyzing ICFG security.wvr.c [2024-10-11 17:17:34,371 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:17:34,371 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-10-11 17:17:34,372 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:17:34,447 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:17:34,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 147 transitions, 308 flow [2024-10-11 17:17:34,533 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2024-10-11 17:17:34,533 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:17:34,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 145 events. 3/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 203 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2024-10-11 17:17:34,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 147 transitions, 308 flow [2024-10-11 17:17:34,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 128 transitions, 268 flow [2024-10-11 17:17:34,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:17:34,567 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;@6c9ccc4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:17:34,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-10-11 17:17:34,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:17:34,573 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-10-11 17:17:34,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:17:34,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:34,574 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:34,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:34,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1652043013, now seen corresponding path program 1 times [2024-10-11 17:17:34,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:34,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874509597] [2024-10-11 17:17:34,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:34,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:34,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:34,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874509597] [2024-10-11 17:17:34,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874509597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:34,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:34,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351547466] [2024-10-11 17:17:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:34,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:34,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 147 [2024-10-11 17:17:34,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:34,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:34,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 147 [2024-10-11 17:17:34,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:34,842 INFO L124 PetriNetUnfolderBase]: 6/176 cut-off events. [2024-10-11 17:17:34,843 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-10-11 17:17:34,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 176 events. 6/176 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 402 event pairs, 3 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 150. Up to 16 conditions per place. [2024-10-11 17:17:34,847 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-10-11 17:17:34,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 288 flow [2024-10-11 17:17:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2024-10-11 17:17:34,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9251700680272109 [2024-10-11 17:17:34,867 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 268 flow. Second operand 3 states and 408 transitions. [2024-10-11 17:17:34,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 288 flow [2024-10-11 17:17:34,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 127 transitions, 280 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:17:34,876 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 262 flow [2024-10-11 17:17:34,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2024-10-11 17:17:34,882 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -3 predicate places. [2024-10-11 17:17:34,882 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 262 flow [2024-10-11 17:17:34,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:34,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:34,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:34,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:17:34,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:34,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:34,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1233895533, now seen corresponding path program 1 times [2024-10-11 17:17:34,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:34,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035004131] [2024-10-11 17:17:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:34,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:34,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:34,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035004131] [2024-10-11 17:17:34,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035004131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:34,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:34,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144085618] [2024-10-11 17:17:34,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:34,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:34,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:34,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:34,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:34,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-10-11 17:17:34,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:34,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:34,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-10-11 17:17:34,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,029 INFO L124 PetriNetUnfolderBase]: 8/170 cut-off events. [2024-10-11 17:17:35,030 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:17:35,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 170 events. 8/170 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 471 event pairs, 3 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 172. Up to 14 conditions per place. [2024-10-11 17:17:35,031 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-10-11 17:17:35,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 283 flow [2024-10-11 17:17:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-10-11 17:17:35,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-10-11 17:17:35,034 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 262 flow. Second operand 3 states and 416 transitions. [2024-10-11 17:17:35,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 283 flow [2024-10-11 17:17:35,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:35,037 INFO L231 Difference]: Finished difference. Result has 129 places, 126 transitions, 260 flow [2024-10-11 17:17:35,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=129, PETRI_TRANSITIONS=126} [2024-10-11 17:17:35,038 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -4 predicate places. [2024-10-11 17:17:35,038 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 126 transitions, 260 flow [2024-10-11 17:17:35,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:17:35,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1432322502, now seen corresponding path program 1 times [2024-10-11 17:17:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864414001] [2024-10-11 17:17:35,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864414001] [2024-10-11 17:17:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864414001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689343659] [2024-10-11 17:17:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,083 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-10-11 17:17:35,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 126 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-10-11 17:17:35,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,112 INFO L124 PetriNetUnfolderBase]: 8/169 cut-off events. [2024-10-11 17:17:35,113 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-10-11 17:17:35,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 169 events. 8/169 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 290 event pairs, 2 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 154. Up to 14 conditions per place. [2024-10-11 17:17:35,114 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-10-11 17:17:35,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 281 flow [2024-10-11 17:17:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-10-11 17:17:35,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-10-11 17:17:35,116 INFO L175 Difference]: Start difference. First operand has 129 places, 126 transitions, 260 flow. Second operand 3 states and 416 transitions. [2024-10-11 17:17:35,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 281 flow [2024-10-11 17:17:35,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:35,118 INFO L231 Difference]: Finished difference. Result has 128 places, 125 transitions, 258 flow [2024-10-11 17:17:35,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=128, PETRI_TRANSITIONS=125} [2024-10-11 17:17:35,119 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -5 predicate places. [2024-10-11 17:17:35,119 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 258 flow [2024-10-11 17:17:35,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,120 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:17:35,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1053979864, now seen corresponding path program 1 times [2024-10-11 17:17:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211210189] [2024-10-11 17:17:35,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211210189] [2024-10-11 17:17:35,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211210189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218804944] [2024-10-11 17:17:35,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-10-11 17:17:35,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-10-11 17:17:35,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,189 INFO L124 PetriNetUnfolderBase]: 4/199 cut-off events. [2024-10-11 17:17:35,189 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:17:35,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 199 events. 4/199 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 628 event pairs, 1 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. [2024-10-11 17:17:35,190 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 9 selfloop transitions, 1 changer transitions 0/127 dead transitions. [2024-10-11 17:17:35,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 285 flow [2024-10-11 17:17:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2024-10-11 17:17:35,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9569160997732427 [2024-10-11 17:17:35,192 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 258 flow. Second operand 3 states and 422 transitions. [2024-10-11 17:17:35,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 285 flow [2024-10-11 17:17:35,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:35,194 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 254 flow [2024-10-11 17:17:35,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=127, PETRI_TRANSITIONS=124} [2024-10-11 17:17:35,195 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -6 predicate places. [2024-10-11 17:17:35,195 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 254 flow [2024-10-11 17:17:35,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,196 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:17:35,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash 708059466, now seen corresponding path program 1 times [2024-10-11 17:17:35,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159909462] [2024-10-11 17:17:35,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159909462] [2024-10-11 17:17:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159909462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888516441] [2024-10-11 17:17:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,239 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-10-11 17:17:35,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 124 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-10-11 17:17:35,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,302 INFO L124 PetriNetUnfolderBase]: 11/300 cut-off events. [2024-10-11 17:17:35,302 INFO L125 PetriNetUnfolderBase]: For 4/11 co-relation queries the response was YES. [2024-10-11 17:17:35,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 300 events. 11/300 cut-off events. For 4/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1203 event pairs, 5 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 207. Up to 22 conditions per place. [2024-10-11 17:17:35,307 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-10-11 17:17:35,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 124 transitions, 277 flow [2024-10-11 17:17:35,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-10-11 17:17:35,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-10-11 17:17:35,310 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 254 flow. Second operand 3 states and 414 transitions. [2024-10-11 17:17:35,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 124 transitions, 277 flow [2024-10-11 17:17:35,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 124 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:35,312 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 255 flow [2024-10-11 17:17:35,312 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2024-10-11 17:17:35,317 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -6 predicate places. [2024-10-11 17:17:35,318 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 255 flow [2024-10-11 17:17:35,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,319 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:17:35,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash 206179214, now seen corresponding path program 1 times [2024-10-11 17:17:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269877190] [2024-10-11 17:17:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269877190] [2024-10-11 17:17:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269877190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756345068] [2024-10-11 17:17:35,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,431 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-10-11 17:17:35,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-10-11 17:17:35,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,463 INFO L124 PetriNetUnfolderBase]: 11/299 cut-off events. [2024-10-11 17:17:35,464 INFO L125 PetriNetUnfolderBase]: For 6/13 co-relation queries the response was YES. [2024-10-11 17:17:35,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 299 events. 11/299 cut-off events. For 6/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1212 event pairs, 5 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 212. Up to 22 conditions per place. [2024-10-11 17:17:35,466 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2024-10-11 17:17:35,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 123 transitions, 278 flow [2024-10-11 17:17:35,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-10-11 17:17:35,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-10-11 17:17:35,468 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 255 flow. Second operand 3 states and 414 transitions. [2024-10-11 17:17:35,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 123 transitions, 278 flow [2024-10-11 17:17:35,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 123 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:35,470 INFO L231 Difference]: Finished difference. Result has 126 places, 122 transitions, 253 flow [2024-10-11 17:17:35,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=126, PETRI_TRANSITIONS=122} [2024-10-11 17:17:35,471 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -7 predicate places. [2024-10-11 17:17:35,471 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 122 transitions, 253 flow [2024-10-11 17:17:35,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:17:35,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1215516512, now seen corresponding path program 1 times [2024-10-11 17:17:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036877835] [2024-10-11 17:17:35,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036877835] [2024-10-11 17:17:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036877835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398848561] [2024-10-11 17:17:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 147 [2024-10-11 17:17:35,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 122 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 147 [2024-10-11 17:17:35,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,559 INFO L124 PetriNetUnfolderBase]: 9/261 cut-off events. [2024-10-11 17:17:35,559 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2024-10-11 17:17:35,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 261 events. 9/261 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 938 event pairs, 2 based on Foata normal form. 2/229 useless extension candidates. Maximal degree in co-relation 197. Up to 16 conditions per place. [2024-10-11 17:17:35,560 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 8 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-10-11 17:17:35,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 122 transitions, 272 flow [2024-10-11 17:17:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-10-11 17:17:35,561 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478458049886621 [2024-10-11 17:17:35,562 INFO L175 Difference]: Start difference. First operand has 126 places, 122 transitions, 253 flow. Second operand 3 states and 418 transitions. [2024-10-11 17:17:35,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 122 transitions, 272 flow [2024-10-11 17:17:35,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:35,563 INFO L231 Difference]: Finished difference. Result has 125 places, 121 transitions, 249 flow [2024-10-11 17:17:35,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=125, PETRI_TRANSITIONS=121} [2024-10-11 17:17:35,564 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-10-11 17:17:35,564 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 121 transitions, 249 flow [2024-10-11 17:17:35,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,565 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:17:35,565 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1260704255, now seen corresponding path program 1 times [2024-10-11 17:17:35,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622766816] [2024-10-11 17:17:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622766816] [2024-10-11 17:17:35,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622766816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301152502] [2024-10-11 17:17:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-10-11 17:17:35,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 121 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-10-11 17:17:35,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,648 INFO L124 PetriNetUnfolderBase]: 6/274 cut-off events. [2024-10-11 17:17:35,648 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2024-10-11 17:17:35,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 274 events. 6/274 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 880 event pairs, 4 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 163. Up to 12 conditions per place. [2024-10-11 17:17:35,653 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 8 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-10-11 17:17:35,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 271 flow [2024-10-11 17:17:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2024-10-11 17:17:35,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9546485260770975 [2024-10-11 17:17:35,654 INFO L175 Difference]: Start difference. First operand has 125 places, 121 transitions, 249 flow. Second operand 3 states and 421 transitions. [2024-10-11 17:17:35,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 122 transitions, 271 flow [2024-10-11 17:17:35,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:35,656 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 248 flow [2024-10-11 17:17:35,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2024-10-11 17:17:35,660 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-10-11 17:17:35,660 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 248 flow [2024-10-11 17:17:35,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,661 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:17:35,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -119724766, now seen corresponding path program 1 times [2024-10-11 17:17:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755925840] [2024-10-11 17:17:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,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-10-11 17:17:35,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755925840] [2024-10-11 17:17:35,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755925840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19623973] [2024-10-11 17:17:35,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-10-11 17:17:35,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-10-11 17:17:35,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,748 INFO L124 PetriNetUnfolderBase]: 28/362 cut-off events. [2024-10-11 17:17:35,748 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:17:35,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 362 events. 28/362 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1749 event pairs, 16 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 295. Up to 70 conditions per place. [2024-10-11 17:17:35,749 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 10 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-10-11 17:17:35,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 275 flow [2024-10-11 17:17:35,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-10-11 17:17:35,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-10-11 17:17:35,751 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 248 flow. Second operand 3 states and 416 transitions. [2024-10-11 17:17:35,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 121 transitions, 275 flow [2024-10-11 17:17:35,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:35,753 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 257 flow [2024-10-11 17:17:35,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2024-10-11 17:17:35,753 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-10-11 17:17:35,753 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 257 flow [2024-10-11 17:17:35,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:17:35,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash 326439841, now seen corresponding path program 1 times [2024-10-11 17:17:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10102863] [2024-10-11 17:17:35,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10102863] [2024-10-11 17:17:35,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10102863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064072159] [2024-10-11 17:17:35,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-10-11 17:17:35,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-10-11 17:17:35,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,827 INFO L124 PetriNetUnfolderBase]: 18/287 cut-off events. [2024-10-11 17:17:35,827 INFO L125 PetriNetUnfolderBase]: For 20/22 co-relation queries the response was YES. [2024-10-11 17:17:35,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 287 events. 18/287 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1162 event pairs, 10 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 193. Up to 34 conditions per place. [2024-10-11 17:17:35,829 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-10-11 17:17:35,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 280 flow [2024-10-11 17:17:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-10-11 17:17:35,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-10-11 17:17:35,830 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 257 flow. Second operand 3 states and 414 transitions. [2024-10-11 17:17:35,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 280 flow [2024-10-11 17:17:35,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:35,832 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 259 flow [2024-10-11 17:17:35,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2024-10-11 17:17:35,834 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -7 predicate places. [2024-10-11 17:17:35,834 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 259 flow [2024-10-11 17:17:35,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:17:35,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1458058907, now seen corresponding path program 1 times [2024-10-11 17:17:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451219208] [2024-10-11 17:17:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451219208] [2024-10-11 17:17:35,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451219208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259277333] [2024-10-11 17:17:35,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-10-11 17:17:35,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-10-11 17:17:35,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,925 INFO L124 PetriNetUnfolderBase]: 18/284 cut-off events. [2024-10-11 17:17:35,925 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2024-10-11 17:17:35,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 284 events. 18/284 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1153 event pairs, 10 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 247. Up to 34 conditions per place. [2024-10-11 17:17:35,926 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-10-11 17:17:35,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 119 transitions, 282 flow [2024-10-11 17:17:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-10-11 17:17:35,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-10-11 17:17:35,927 INFO L175 Difference]: Start difference. First operand has 126 places, 119 transitions, 259 flow. Second operand 3 states and 414 transitions. [2024-10-11 17:17:35,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 119 transitions, 282 flow [2024-10-11 17:17:35,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 119 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:35,930 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 257 flow [2024-10-11 17:17:35,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=125, PETRI_TRANSITIONS=118} [2024-10-11 17:17:35,930 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-10-11 17:17:35,930 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 257 flow [2024-10-11 17:17:35,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:17:35,931 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:35,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1313807461, now seen corresponding path program 1 times [2024-10-11 17:17:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719699841] [2024-10-11 17:17:35,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719699841] [2024-10-11 17:17:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719699841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446853455] [2024-10-11 17:17:35,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-10-11 17:17:35,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 118 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-10-11 17:17:35,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,999 INFO L124 PetriNetUnfolderBase]: 12/326 cut-off events. [2024-10-11 17:17:35,999 INFO L125 PetriNetUnfolderBase]: For 6/22 co-relation queries the response was YES. [2024-10-11 17:17:35,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 326 events. 12/326 cut-off events. For 6/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1335 event pairs, 4 based on Foata normal form. 4/300 useless extension candidates. Maximal degree in co-relation 304. Up to 25 conditions per place. [2024-10-11 17:17:36,000 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2024-10-11 17:17:36,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 118 transitions, 278 flow [2024-10-11 17:17:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-10-11 17:17:36,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-10-11 17:17:36,001 INFO L175 Difference]: Start difference. First operand has 125 places, 118 transitions, 257 flow. Second operand 3 states and 416 transitions. [2024-10-11 17:17:36,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 118 transitions, 278 flow [2024-10-11 17:17:36,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:36,003 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 255 flow [2024-10-11 17:17:36,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2024-10-11 17:17:36,004 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -9 predicate places. [2024-10-11 17:17:36,005 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 255 flow [2024-10-11 17:17:36,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:36,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:17:36,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:36,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1163742355, now seen corresponding path program 1 times [2024-10-11 17:17:36,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176977656] [2024-10-11 17:17:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:36,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176977656] [2024-10-11 17:17:36,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176977656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844424466] [2024-10-11 17:17:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 147 [2024-10-11 17:17:36,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 147 [2024-10-11 17:17:36,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,069 INFO L124 PetriNetUnfolderBase]: 16/272 cut-off events. [2024-10-11 17:17:36,069 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-10-11 17:17:36,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 272 events. 16/272 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1072 event pairs, 8 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 194. Up to 24 conditions per place. [2024-10-11 17:17:36,070 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 8 selfloop transitions, 1 changer transitions 0/117 dead transitions. [2024-10-11 17:17:36,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 117 transitions, 274 flow [2024-10-11 17:17:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-10-11 17:17:36,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478458049886621 [2024-10-11 17:17:36,072 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 255 flow. Second operand 3 states and 418 transitions. [2024-10-11 17:17:36,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 117 transitions, 274 flow [2024-10-11 17:17:36,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:36,074 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 251 flow [2024-10-11 17:17:36,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=251, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2024-10-11 17:17:36,074 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -10 predicate places. [2024-10-11 17:17:36,075 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 251 flow [2024-10-11 17:17:36,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,075 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:36,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:17:36,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:36,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1795930344, now seen corresponding path program 1 times [2024-10-11 17:17:36,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831144794] [2024-10-11 17:17:36,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:36,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831144794] [2024-10-11 17:17:36,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831144794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649160422] [2024-10-11 17:17:36,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-10-11 17:17:36,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-10-11 17:17:36,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,161 INFO L124 PetriNetUnfolderBase]: 20/234 cut-off events. [2024-10-11 17:17:36,165 INFO L125 PetriNetUnfolderBase]: For 22/24 co-relation queries the response was YES. [2024-10-11 17:17:36,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 234 events. 20/234 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 815 event pairs, 8 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 178. Up to 41 conditions per place. [2024-10-11 17:17:36,166 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2024-10-11 17:17:36,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 116 transitions, 272 flow [2024-10-11 17:17:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-10-11 17:17:36,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-10-11 17:17:36,167 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 251 flow. Second operand 3 states and 416 transitions. [2024-10-11 17:17:36,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 116 transitions, 272 flow [2024-10-11 17:17:36,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 116 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:36,173 INFO L231 Difference]: Finished difference. Result has 123 places, 115 transitions, 252 flow [2024-10-11 17:17:36,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=123, PETRI_TRANSITIONS=115} [2024-10-11 17:17:36,174 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -10 predicate places. [2024-10-11 17:17:36,174 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 115 transitions, 252 flow [2024-10-11 17:17:36,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,174 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:36,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:17:36,175 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:36,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1475737072, now seen corresponding path program 1 times [2024-10-11 17:17:36,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722490670] [2024-10-11 17:17:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722490670] [2024-10-11 17:17:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722490670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394763068] [2024-10-11 17:17:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-10-11 17:17:36,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-10-11 17:17:36,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,265 INFO L124 PetriNetUnfolderBase]: 6/290 cut-off events. [2024-10-11 17:17:36,266 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2024-10-11 17:17:36,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 290 events. 6/290 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1071 event pairs, 2 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 266. Up to 16 conditions per place. [2024-10-11 17:17:36,266 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 6 selfloop transitions, 1 changer transitions 0/114 dead transitions. [2024-10-11 17:17:36,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 264 flow [2024-10-11 17:17:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2024-10-11 17:17:36,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9501133786848073 [2024-10-11 17:17:36,268 INFO L175 Difference]: Start difference. First operand has 123 places, 115 transitions, 252 flow. Second operand 3 states and 419 transitions. [2024-10-11 17:17:36,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 264 flow [2024-10-11 17:17:36,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 114 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:36,269 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 248 flow [2024-10-11 17:17:36,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-10-11 17:17:36,270 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -11 predicate places. [2024-10-11 17:17:36,270 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 248 flow [2024-10-11 17:17:36,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,271 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:36,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:17:36,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:17:36,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash -864598165, now seen corresponding path program 1 times [2024-10-11 17:17:36,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731057063] [2024-10-11 17:17:36,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:36,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731057063] [2024-10-11 17:17:36,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731057063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139332930] [2024-10-11 17:17:36,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-10-11 17:17:36,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-10-11 17:17:36,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,335 INFO L124 PetriNetUnfolderBase]: 8/198 cut-off events. [2024-10-11 17:17:36,335 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2024-10-11 17:17:36,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 198 events. 8/198 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs, 4 based on Foata normal form. 4/192 useless extension candidates. Maximal degree in co-relation 232. Up to 23 conditions per place. [2024-10-11 17:17:36,335 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 0 selfloop transitions, 0 changer transitions 113/113 dead transitions. [2024-10-11 17:17:36,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 113 transitions, 258 flow [2024-10-11 17:17:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-10-11 17:17:36,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478458049886621 [2024-10-11 17:17:36,336 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 248 flow. Second operand 3 states and 418 transitions. [2024-10-11 17:17:36,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 113 transitions, 258 flow [2024-10-11 17:17:36,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 113 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:36,337 INFO L231 Difference]: Finished difference. Result has 122 places, 0 transitions, 0 flow [2024-10-11 17:17:36,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=122, PETRI_TRANSITIONS=0} [2024-10-11 17:17:36,338 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -11 predicate places. [2024-10-11 17:17:36,338 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 0 transitions, 0 flow [2024-10-11 17:17:36,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 33 remaining) [2024-10-11 17:17:36,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2024-10-11 17:17:36,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2024-10-11 17:17:36,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2024-10-11 17:17:36,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2024-10-11 17:17:36,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2024-10-11 17:17:36,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2024-10-11 17:17:36,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2024-10-11 17:17:36,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2024-10-11 17:17:36,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2024-10-11 17:17:36,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2024-10-11 17:17:36,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2024-10-11 17:17:36,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2024-10-11 17:17:36,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:17:36,346 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:36,351 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:17:36,352 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:17:36,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:17:36 BasicIcfg [2024-10-11 17:17:36,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:17:36,355 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:17:36,355 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:17:36,355 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:17:36,356 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:34" (3/4) ... [2024-10-11 17:17:36,357 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:17:36,359 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:17:36,359 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:17:36,365 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 17:17:36,365 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:17:36,365 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:17:36,365 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:17:36,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:17:36,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:17:36,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:17:36,422 INFO L158 Benchmark]: Toolchain (without parser) took 2879.23ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 73.5MB in the beginning and 170.6MB in the end (delta: -97.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:17:36,422 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 142.6MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:17:36,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.52ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 73.2MB in the beginning and 185.4MB in the end (delta: -112.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:36,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.34ms. Allocated memory is still 213.9MB. Free memory was 185.4MB in the beginning and 184.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:36,422 INFO L158 Benchmark]: Boogie Preprocessor took 16.13ms. Allocated memory is still 213.9MB. Free memory was 184.3MB in the beginning and 183.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:36,423 INFO L158 Benchmark]: RCFGBuilder took 481.23ms. Allocated memory is still 213.9MB. Free memory was 182.2MB in the beginning and 166.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:17:36,423 INFO L158 Benchmark]: TraceAbstraction took 2000.93ms. Allocated memory is still 213.9MB. Free memory was 165.4MB in the beginning and 175.9MB in the end (delta: -10.4MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:36,423 INFO L158 Benchmark]: Witness Printer took 66.01ms. Allocated memory is still 213.9MB. Free memory was 175.9MB in the beginning and 170.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:17:36,424 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.10ms. Allocated memory is still 142.6MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.52ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 73.2MB in the beginning and 185.4MB in the end (delta: -112.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.34ms. Allocated memory is still 213.9MB. Free memory was 185.4MB in the beginning and 184.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.13ms. Allocated memory is still 213.9MB. Free memory was 184.3MB in the beginning and 183.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.23ms. Allocated memory is still 213.9MB. Free memory was 182.2MB in the beginning and 166.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2000.93ms. Allocated memory is still 213.9MB. Free memory was 165.4MB in the beginning and 175.9MB in the end (delta: -10.4MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. * Witness Printer took 66.01ms. Allocated memory is still 213.9MB. Free memory was 175.9MB in the beginning and 170.6MB 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: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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, 231 locations, 33 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: 1.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 54 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=0, InterpolantAutomatonStates: 48, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 801 NumberOfCodeBlocks, 801 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:17:36,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE