./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:37:49,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:37:49,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:37:49,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:37:49,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:37:49,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:37:49,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:37:49,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:37:49,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:37:49,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:37:49,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:37:49,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:37:49,183 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:37:49,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:37:49,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:37:49,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:37:49,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:37:49,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:37:49,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:37:49,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:37:49,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:37:49,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:37:49,189 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:37:49,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:37:49,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:37:49,189 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:37:49,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:37:49,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:37:49,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:37:49,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:37:49,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:37:49,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:37:49,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:37:49,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:37:49,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:37:49,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:37:49,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:37:49,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:37:49,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:37:49,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:37:49,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:37:49,195 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc [2024-11-10 14:37:49,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:37:49,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:37:49,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:37:49,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:37:49,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:37:49,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2024-11-10 14:37:50,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:37:51,101 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:37:51,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2024-11-10 14:37:51,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6819ece2/5c098614a04d4f5880832e888b886e6b/FLAGfcedc54a4 [2024-11-10 14:37:51,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6819ece2/5c098614a04d4f5880832e888b886e6b [2024-11-10 14:37:51,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:37:51,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:37:51,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:37:51,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:37:51,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:37:51,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf82e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51, skipping insertion in model container [2024-11-10 14:37:51,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:37:51,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:37:51,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:37:51,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:37:51,764 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:37:51,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51 WrapperNode [2024-11-10 14:37:51,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:37:51,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:37:51,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:37:51,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:37:51,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,804 INFO L138 Inliner]: procedures = 21, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-10 14:37:51,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:37:51,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:37:51,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:37:51,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:37:51,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:37:51,829 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:37:51,829 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:37:51,829 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:37:51,830 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (1/1) ... [2024-11-10 14:37:51,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:37:51,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:37:51,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:37:51,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:37:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:37:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:37:51,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:37:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:37:51,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:37:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:37:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:37:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:37:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:37:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:37:51,937 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:37:52,098 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:37:52,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:37:52,402 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:37:52,402 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:37:52,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:37:52,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:37:52,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:52 BoogieIcfgContainer [2024-11-10 14:37:52,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:37:52,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:37:52,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:37:52,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:37:52,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:37:51" (1/3) ... [2024-11-10 14:37:52,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6ab46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:37:52, skipping insertion in model container [2024-11-10 14:37:52,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:51" (2/3) ... [2024-11-10 14:37:52,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6ab46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:37:52, skipping insertion in model container [2024-11-10 14:37:52,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:52" (3/3) ... [2024-11-10 14:37:52,426 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2024-11-10 14:37:52,445 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:37:52,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-11-10 14:37:52,446 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:37:52,531 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:37:52,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 363 flow [2024-11-10 14:37:52,641 INFO L124 PetriNetUnfolderBase]: 7/168 cut-off events. [2024-11-10 14:37:52,641 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:37:52,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 7/168 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 280 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2024-11-10 14:37:52,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 363 flow [2024-11-10 14:37:52,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 151 transitions, 320 flow [2024-11-10 14:37:52,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:37:52,673 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;@4eed1601, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:37:52,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-10 14:37:52,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:37:52,686 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-11-10 14:37:52,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:37:52,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:52,690 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-11-10 14:37:52,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:52,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 443939378, now seen corresponding path program 1 times [2024-11-10 14:37:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:52,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236947140] [2024-11-10 14:37:52,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:52,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:52,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236947140] [2024-11-10 14:37:52,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236947140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:52,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:52,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744560051] [2024-11-10 14:37:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:52,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:52,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:53,003 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2024-11-10 14:37:53,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:53,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:53,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2024-11-10 14:37:53,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:53,101 INFO L124 PetriNetUnfolderBase]: 10/216 cut-off events. [2024-11-10 14:37:53,104 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:37:53,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 216 events. 10/216 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 686 event pairs, 5 based on Foata normal form. 16/200 useless extension candidates. Maximal degree in co-relation 175. Up to 22 conditions per place. [2024-11-10 14:37:53,110 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-11-10 14:37:53,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 338 flow [2024-11-10 14:37:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2024-11-10 14:37:53,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2024-11-10 14:37:53,128 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 320 flow. Second operand 3 states and 470 transitions. [2024-11-10 14:37:53,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 338 flow [2024-11-10 14:37:53,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 326 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:37:53,137 INFO L231 Difference]: Finished difference. Result has 150 places, 147 transitions, 304 flow [2024-11-10 14:37:53,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=150, PETRI_TRANSITIONS=147} [2024-11-10 14:37:53,145 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -5 predicate places. [2024-11-10 14:37:53,145 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 147 transitions, 304 flow [2024-11-10 14:37:53,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:53,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:53,146 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] [2024-11-10 14:37:53,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:37:53,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:53,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:53,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1574475494, now seen corresponding path program 1 times [2024-11-10 14:37:53,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737035237] [2024-11-10 14:37:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:53,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:53,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:53,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737035237] [2024-11-10 14:37:53,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737035237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:53,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:53,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992912498] [2024-11-10 14:37:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:53,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:53,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:53,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:53,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:53,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2024-11-10 14:37:53,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 147 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:53,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:53,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2024-11-10 14:37:53,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:53,317 INFO L124 PetriNetUnfolderBase]: 11/188 cut-off events. [2024-11-10 14:37:53,318 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:37:53,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 188 events. 11/188 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 504 event pairs, 7 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 193. Up to 25 conditions per place. [2024-11-10 14:37:53,323 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2024-11-10 14:37:53,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 328 flow [2024-11-10 14:37:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2024-11-10 14:37:53,329 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9103313840155945 [2024-11-10 14:37:53,329 INFO L175 Difference]: Start difference. First operand has 150 places, 147 transitions, 304 flow. Second operand 3 states and 467 transitions. [2024-11-10 14:37:53,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 146 transitions, 328 flow [2024-11-10 14:37:53,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 146 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:53,333 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 302 flow [2024-11-10 14:37:53,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2024-11-10 14:37:53,335 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -6 predicate places. [2024-11-10 14:37:53,335 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 302 flow [2024-11-10 14:37:53,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:53,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:53,336 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] [2024-11-10 14:37:53,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:37:53,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:53,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash -312121688, now seen corresponding path program 1 times [2024-11-10 14:37:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:53,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974422850] [2024-11-10 14:37:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:53,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:53,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974422850] [2024-11-10 14:37:53,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974422850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:53,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:53,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:53,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996945225] [2024-11-10 14:37:53,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:53,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:53,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:53,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:53,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:53,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2024-11-10 14:37:53,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:53,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:53,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2024-11-10 14:37:53,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:53,553 INFO L124 PetriNetUnfolderBase]: 30/404 cut-off events. [2024-11-10 14:37:53,556 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:37:53,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 404 events. 30/404 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1985 event pairs, 15 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 432. Up to 52 conditions per place. [2024-11-10 14:37:53,560 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-11-10 14:37:53,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 145 transitions, 328 flow [2024-11-10 14:37:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2024-11-10 14:37:53,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9064327485380117 [2024-11-10 14:37:53,564 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 302 flow. Second operand 3 states and 465 transitions. [2024-11-10 14:37:53,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 145 transitions, 328 flow [2024-11-10 14:37:53,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:53,573 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 300 flow [2024-11-10 14:37:53,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2024-11-10 14:37:53,580 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -7 predicate places. [2024-11-10 14:37:53,581 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 300 flow [2024-11-10 14:37:53,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:53,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:53,585 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-11-10 14:37:53,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:37:53,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:53,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1507956943, now seen corresponding path program 1 times [2024-11-10 14:37:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:53,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132932080] [2024-11-10 14:37:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:53,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:53,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132932080] [2024-11-10 14:37:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132932080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:53,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:53,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:53,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740849117] [2024-11-10 14:37:53,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:53,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:53,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:53,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2024-11-10 14:37:53,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:53,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:53,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2024-11-10 14:37:53,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:53,887 INFO L124 PetriNetUnfolderBase]: 97/835 cut-off events. [2024-11-10 14:37:53,887 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:37:53,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 835 events. 97/835 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5794 event pairs, 34 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 959. Up to 146 conditions per place. [2024-11-10 14:37:53,895 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 15 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2024-11-10 14:37:53,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 147 transitions, 342 flow [2024-11-10 14:37:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2024-11-10 14:37:53,899 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2024-11-10 14:37:53,900 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 300 flow. Second operand 3 states and 471 transitions. [2024-11-10 14:37:53,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 147 transitions, 342 flow [2024-11-10 14:37:53,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 147 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:53,904 INFO L231 Difference]: Finished difference. Result has 146 places, 145 transitions, 311 flow [2024-11-10 14:37:53,905 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=146, PETRI_TRANSITIONS=145} [2024-11-10 14:37:53,907 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2024-11-10 14:37:53,907 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 311 flow [2024-11-10 14:37:53,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:53,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:53,908 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] [2024-11-10 14:37:53,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:37:53,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1812940108, now seen corresponding path program 1 times [2024-11-10 14:37:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819846374] [2024-11-10 14:37:53,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819846374] [2024-11-10 14:37:53,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819846374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:53,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:53,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:53,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951679799] [2024-11-10 14:37:53,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:53,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:53,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:53,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:53,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-11-10 14:37:54,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 145 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-11-10 14:37:54,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,062 INFO L124 PetriNetUnfolderBase]: 27/356 cut-off events. [2024-11-10 14:37:54,063 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-11-10 14:37:54,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 356 events. 27/356 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1609 event pairs, 4 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 279. Up to 29 conditions per place. [2024-11-10 14:37:54,067 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2024-11-10 14:37:54,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 145 transitions, 339 flow [2024-11-10 14:37:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-11-10 14:37:54,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-11-10 14:37:54,069 INFO L175 Difference]: Start difference. First operand has 146 places, 145 transitions, 311 flow. Second operand 3 states and 474 transitions. [2024-11-10 14:37:54,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 145 transitions, 339 flow [2024-11-10 14:37:54,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 145 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:54,073 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 313 flow [2024-11-10 14:37:54,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2024-11-10 14:37:54,076 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2024-11-10 14:37:54,076 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 313 flow [2024-11-10 14:37:54,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:54,077 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-11-10 14:37:54,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:37:54,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:54,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1521268115, now seen corresponding path program 1 times [2024-11-10 14:37:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:54,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274052173] [2024-11-10 14:37:54,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:54,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:54,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274052173] [2024-11-10 14:37:54,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274052173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:54,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:54,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:54,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488527108] [2024-11-10 14:37:54,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:54,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:54,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:54,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:54,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-11-10 14:37:54,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-11-10 14:37:54,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,257 INFO L124 PetriNetUnfolderBase]: 71/676 cut-off events. [2024-11-10 14:37:54,258 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2024-11-10 14:37:54,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 676 events. 71/676 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3838 event pairs, 16 based on Foata normal form. 1/573 useless extension candidates. Maximal degree in co-relation 655. Up to 62 conditions per place. [2024-11-10 14:37:54,264 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 16 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2024-11-10 14:37:54,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 148 transitions, 364 flow [2024-11-10 14:37:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2024-11-10 14:37:54,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337231968810916 [2024-11-10 14:37:54,266 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 313 flow. Second operand 3 states and 479 transitions. [2024-11-10 14:37:54,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 148 transitions, 364 flow [2024-11-10 14:37:54,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 148 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:54,270 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 317 flow [2024-11-10 14:37:54,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2024-11-10 14:37:54,273 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2024-11-10 14:37:54,273 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 317 flow [2024-11-10 14:37:54,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:54,275 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:54,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:37:54,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:54,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash -583630609, now seen corresponding path program 1 times [2024-11-10 14:37:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:54,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035109026] [2024-11-10 14:37:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:54,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:54,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035109026] [2024-11-10 14:37:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035109026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:54,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:54,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135239592] [2024-11-10 14:37:54,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:54,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:54,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:54,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-11-10 14:37:54,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-11-10 14:37:54,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,428 INFO L124 PetriNetUnfolderBase]: 59/689 cut-off events. [2024-11-10 14:37:54,428 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-11-10 14:37:54,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 689 events. 59/689 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4208 event pairs, 19 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 665. Up to 59 conditions per place. [2024-11-10 14:37:54,434 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-11-10 14:37:54,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 144 transitions, 349 flow [2024-11-10 14:37:54,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-11-10 14:37:54,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-11-10 14:37:54,436 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 317 flow. Second operand 3 states and 474 transitions. [2024-11-10 14:37:54,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 144 transitions, 349 flow [2024-11-10 14:37:54,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 144 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:54,439 INFO L231 Difference]: Finished difference. Result has 146 places, 142 transitions, 319 flow [2024-11-10 14:37:54,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=146, PETRI_TRANSITIONS=142} [2024-11-10 14:37:54,439 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2024-11-10 14:37:54,440 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 142 transitions, 319 flow [2024-11-10 14:37:54,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:54,440 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:54,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:37:54,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:54,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash -678049384, now seen corresponding path program 1 times [2024-11-10 14:37:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:54,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988662978] [2024-11-10 14:37:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:54,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:54,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988662978] [2024-11-10 14:37:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988662978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:54,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331568114] [2024-11-10 14:37:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:54,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:54,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:54,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-11-10 14:37:54,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 142 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-11-10 14:37:54,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,550 INFO L124 PetriNetUnfolderBase]: 57/558 cut-off events. [2024-11-10 14:37:54,550 INFO L125 PetriNetUnfolderBase]: For 12/15 co-relation queries the response was YES. [2024-11-10 14:37:54,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 558 events. 57/558 cut-off events. For 12/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3040 event pairs, 13 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 502. Up to 49 conditions per place. [2024-11-10 14:37:54,556 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2024-11-10 14:37:54,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 142 transitions, 347 flow [2024-11-10 14:37:54,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-11-10 14:37:54,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-11-10 14:37:54,558 INFO L175 Difference]: Start difference. First operand has 146 places, 142 transitions, 319 flow. Second operand 3 states and 474 transitions. [2024-11-10 14:37:54,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 142 transitions, 347 flow [2024-11-10 14:37:54,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:54,561 INFO L231 Difference]: Finished difference. Result has 144 places, 140 transitions, 317 flow [2024-11-10 14:37:54,561 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=144, PETRI_TRANSITIONS=140} [2024-11-10 14:37:54,562 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -11 predicate places. [2024-11-10 14:37:54,562 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 140 transitions, 317 flow [2024-11-10 14:37:54,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:54,563 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-11-10 14:37:54,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:37:54,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:54,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1229582073, now seen corresponding path program 1 times [2024-11-10 14:37:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:54,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387400514] [2024-11-10 14:37:54,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:54,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:54,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387400514] [2024-11-10 14:37:54,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387400514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:54,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:54,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:54,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262742500] [2024-11-10 14:37:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:54,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:54,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-11-10 14:37:54,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 140 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-11-10 14:37:54,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,724 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][94], [38#L75-1true, 205#(= |#race~b~0| 0), 200#true, Black: 193#true, 195#(= |#race~a~0| 0), 14#L42-6true, 88#L50-6true, 22#L58-6true, Black: 186#true, 188#(= |#race~c~0| 0)]) [2024-11-10 14:37:54,725 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-11-10 14:37:54,725 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-10 14:37:54,725 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-10 14:37:54,725 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-10 14:37:54,732 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][94], [205#(= |#race~b~0| 0), 200#true, Black: 193#true, 195#(= |#race~a~0| 0), 88#L50-6true, 91#L77true, 22#L58-6true, Black: 186#true, 188#(= |#race~c~0| 0)]) [2024-11-10 14:37:54,733 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-10 14:37:54,733 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-10 14:37:54,733 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-10 14:37:54,733 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-10 14:37:54,734 INFO L124 PetriNetUnfolderBase]: 138/960 cut-off events. [2024-11-10 14:37:54,734 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2024-11-10 14:37:54,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 960 events. 138/960 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6579 event pairs, 21 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 944. Up to 143 conditions per place. [2024-11-10 14:37:54,742 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-11-10 14:37:54,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 144 transitions, 363 flow [2024-11-10 14:37:54,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2024-11-10 14:37:54,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9317738791423001 [2024-11-10 14:37:54,744 INFO L175 Difference]: Start difference. First operand has 144 places, 140 transitions, 317 flow. Second operand 3 states and 478 transitions. [2024-11-10 14:37:54,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 144 transitions, 363 flow [2024-11-10 14:37:54,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 144 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:54,748 INFO L231 Difference]: Finished difference. Result has 143 places, 140 transitions, 321 flow [2024-11-10 14:37:54,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=143, PETRI_TRANSITIONS=140} [2024-11-10 14:37:54,749 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -12 predicate places. [2024-11-10 14:37:54,749 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 140 transitions, 321 flow [2024-11-10 14:37:54,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:54,750 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:54,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:37:54,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:54,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1526974981, now seen corresponding path program 1 times [2024-11-10 14:37:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492521426] [2024-11-10 14:37:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:54,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:54,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492521426] [2024-11-10 14:37:54,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492521426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:54,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552405046] [2024-11-10 14:37:54,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:54,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:54,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:54,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:54,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-11-10 14:37:54,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 140 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-11-10 14:37:54,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][93], [38#L75-1true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 14#L42-6true, 88#L50-6true, 22#L58-6true, 207#true, Black: 186#true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2024-11-10 14:37:54,919 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-11-10 14:37:54,919 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-10 14:37:54,920 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-10 14:37:54,920 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-10 14:37:54,931 INFO L124 PetriNetUnfolderBase]: 127/960 cut-off events. [2024-11-10 14:37:54,931 INFO L125 PetriNetUnfolderBase]: For 27/33 co-relation queries the response was YES. [2024-11-10 14:37:54,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 960 events. 127/960 cut-off events. For 27/33 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6508 event pairs, 42 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 898. Up to 96 conditions per place. [2024-11-10 14:37:54,939 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2024-11-10 14:37:54,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 141 transitions, 353 flow [2024-11-10 14:37:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-11-10 14:37:54,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-11-10 14:37:54,941 INFO L175 Difference]: Start difference. First operand has 143 places, 140 transitions, 321 flow. Second operand 3 states and 474 transitions. [2024-11-10 14:37:54,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 141 transitions, 353 flow [2024-11-10 14:37:54,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:54,945 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 323 flow [2024-11-10 14:37:54,945 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2024-11-10 14:37:54,946 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -11 predicate places. [2024-11-10 14:37:54,947 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 323 flow [2024-11-10 14:37:54,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:54,948 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] [2024-11-10 14:37:54,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:37:54,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:54,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1222783087, now seen corresponding path program 1 times [2024-11-10 14:37:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335669907] [2024-11-10 14:37:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:54,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:54,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335669907] [2024-11-10 14:37:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335669907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:54,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:55,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259643306] [2024-11-10 14:37:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:55,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:55,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:55,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:55,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:55,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-11-10 14:37:55,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:55,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-11-10 14:37:55,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:55,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][93], [38#L75-1true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 88#L50-6true, 14#L42-6true, 210#true, 207#true, 22#L58-6true, Black: 186#true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2024-11-10 14:37:55,087 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-11-10 14:37:55,087 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-10 14:37:55,087 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-10 14:37:55,087 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-10 14:37:55,096 INFO L124 PetriNetUnfolderBase]: 96/655 cut-off events. [2024-11-10 14:37:55,097 INFO L125 PetriNetUnfolderBase]: For 31/47 co-relation queries the response was YES. [2024-11-10 14:37:55,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 655 events. 96/655 cut-off events. For 31/47 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3834 event pairs, 14 based on Foata normal form. 6/611 useless extension candidates. Maximal degree in co-relation 766. Up to 70 conditions per place. [2024-11-10 14:37:55,103 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 8 selfloop transitions, 2 changer transitions 6/139 dead transitions. [2024-11-10 14:37:55,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 349 flow [2024-11-10 14:37:55,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2024-11-10 14:37:55,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9220272904483431 [2024-11-10 14:37:55,107 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 323 flow. Second operand 3 states and 473 transitions. [2024-11-10 14:37:55,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 139 transitions, 349 flow [2024-11-10 14:37:55,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:55,110 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 306 flow [2024-11-10 14:37:55,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2024-11-10 14:37:55,112 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -13 predicate places. [2024-11-10 14:37:55,112 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 306 flow [2024-11-10 14:37:55,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:55,113 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] [2024-11-10 14:37:55,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:37:55,114 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-11-10 14:37:55,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:55,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1612704621, now seen corresponding path program 1 times [2024-11-10 14:37:55,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:55,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718616402] [2024-11-10 14:37:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:55,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718616402] [2024-11-10 14:37:55,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718616402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:55,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:55,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:55,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595975807] [2024-11-10 14:37:55,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:55,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:55,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:55,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:55,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:55,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-11-10 14:37:55,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:55,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-11-10 14:37:55,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:55,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][93], [38#L75-1true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 88#L50-6true, 14#L42-6true, 210#true, 213#true, 22#L58-6true, Black: 186#true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2024-11-10 14:37:55,250 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-11-10 14:37:55,251 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-10 14:37:55,251 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-10 14:37:55,251 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-10 14:37:55,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L59-3-->L59-2: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5][122], [27#L78true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 213#true, 108#L59-2true, Black: 186#true, 188#(= |#race~c~0| 0), Black: 203#true, 212#(= |#race~x_3~0| 0)]) [2024-11-10 14:37:55,255 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2024-11-10 14:37:55,256 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-10 14:37:55,256 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-10 14:37:55,256 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-10 14:37:55,256 INFO L124 PetriNetUnfolderBase]: 106/653 cut-off events. [2024-11-10 14:37:55,256 INFO L125 PetriNetUnfolderBase]: For 62/86 co-relation queries the response was YES. [2024-11-10 14:37:55,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 653 events. 106/653 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3813 event pairs, 29 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 701. Up to 85 conditions per place. [2024-11-10 14:37:55,260 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 0 selfloop transitions, 0 changer transitions 132/132 dead transitions. [2024-11-10 14:37:55,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 132 transitions, 334 flow [2024-11-10 14:37:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2024-11-10 14:37:55,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9200779727095516 [2024-11-10 14:37:55,262 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 306 flow. Second operand 3 states and 472 transitions. [2024-11-10 14:37:55,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 132 transitions, 334 flow [2024-11-10 14:37:55,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:55,266 INFO L231 Difference]: Finished difference. Result has 135 places, 0 transitions, 0 flow [2024-11-10 14:37:55,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=135, PETRI_TRANSITIONS=0} [2024-11-10 14:37:55,267 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -20 predicate places. [2024-11-10 14:37:55,268 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 0 transitions, 0 flow [2024-11-10 14:37:55,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2024-11-10 14:37:55,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2024-11-10 14:37:55,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2024-11-10 14:37:55,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2024-11-10 14:37:55,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2024-11-10 14:37:55,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2024-11-10 14:37:55,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2024-11-10 14:37:55,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2024-11-10 14:37:55,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2024-11-10 14:37:55,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2024-11-10 14:37:55,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2024-11-10 14:37:55,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2024-11-10 14:37:55,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2024-11-10 14:37:55,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2024-11-10 14:37:55,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2024-11-10 14:37:55,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2024-11-10 14:37:55,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2024-11-10 14:37:55,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2024-11-10 14:37:55,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2024-11-10 14:37:55,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 35 remaining) [2024-11-10 14:37:55,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2024-11-10 14:37:55,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2024-11-10 14:37:55,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2024-11-10 14:37:55,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2024-11-10 14:37:55,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2024-11-10 14:37:55,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2024-11-10 14:37:55,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2024-11-10 14:37:55,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2024-11-10 14:37:55,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2024-11-10 14:37:55,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2024-11-10 14:37:55,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2024-11-10 14:37:55,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2024-11-10 14:37:55,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2024-11-10 14:37:55,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2024-11-10 14:37:55,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2024-11-10 14:37:55,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:37:55,280 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:55,285 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:37:55,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:37:55,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:37:55 BasicIcfg [2024-11-10 14:37:55,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:37:55,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:37:55,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:37:55,293 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:37:55,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:52" (3/4) ... [2024-11-10 14:37:55,294 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:37:55,298 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:37:55,298 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:37:55,298 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:37:55,303 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-10 14:37:55,303 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:37:55,303 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:37:55,304 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:37:55,381 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:37:55,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:37:55,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:37:55,382 INFO L158 Benchmark]: Toolchain (without parser) took 3881.30ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 103.2MB in the beginning and 74.0MB in the end (delta: 29.2MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2024-11-10 14:37:55,383 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:37:55,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.33ms. Allocated memory is still 180.4MB. Free memory was 102.9MB in the beginning and 89.7MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:37:55,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.18ms. Allocated memory is still 180.4MB. Free memory was 89.7MB in the beginning and 88.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:37:55,383 INFO L158 Benchmark]: Boogie Preprocessor took 22.82ms. Allocated memory is still 180.4MB. Free memory was 88.2MB in the beginning and 87.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:37:55,384 INFO L158 Benchmark]: IcfgBuilder took 590.95ms. Allocated memory is still 180.4MB. Free memory was 86.8MB in the beginning and 140.9MB in the end (delta: -54.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-10 14:37:55,384 INFO L158 Benchmark]: TraceAbstraction took 2870.56ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 140.1MB in the beginning and 78.2MB in the end (delta: 62.0MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2024-11-10 14:37:55,384 INFO L158 Benchmark]: Witness Printer took 89.59ms. Allocated memory is still 228.6MB. Free memory was 78.2MB in the beginning and 74.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:37:55,386 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.12ms. Allocated memory is still 180.4MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.33ms. Allocated memory is still 180.4MB. Free memory was 102.9MB in the beginning and 89.7MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.18ms. Allocated memory is still 180.4MB. Free memory was 89.7MB in the beginning and 88.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.82ms. Allocated memory is still 180.4MB. Free memory was 88.2MB in the beginning and 87.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 590.95ms. Allocated memory is still 180.4MB. Free memory was 86.8MB in the beginning and 140.9MB in the end (delta: -54.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2870.56ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 140.1MB in the beginning and 78.2MB in the end (delta: 62.0MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. * Witness Printer took 89.59ms. Allocated memory is still 228.6MB. Free memory was 78.2MB in the beginning and 74.0MB in the end (delta: 4.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: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 246 locations, 35 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: 2.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 336 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 72 mSDtfsCounter, 336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=10, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:37:55,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE