./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 17:13:14,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:13:14,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:13:14,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:13:14,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:13:14,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:13:14,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:13:14,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:13:14,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:13:14,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:13:14,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:13:14,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:13:14,655 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:13:14,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:13:14,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:13:14,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:13:14,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:13:14,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:13:14,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:13:14,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:13:14,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:13:14,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:13:14,661 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:13:14,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:13:14,661 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:13:14,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:13:14,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:13:14,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:13:14,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:13:14,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:13:14,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:13:14,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:13:14,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:13:14,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:13:14,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:13:14,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:13:14,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:13:14,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:13:14,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:13:14,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:13:14,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:13:14,666 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-10-14 17:13:14,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:13:14,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:13:14,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:13:14,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:13:14,929 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:13:14,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2024-10-14 17:13:16,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:13:16,489 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:13:16,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2024-10-14 17:13:16,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d916ee596/75b513fc79524964852ef52375008660/FLAG13f1d4e47 [2024-10-14 17:13:16,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d916ee596/75b513fc79524964852ef52375008660 [2024-10-14 17:13:16,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:13:16,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:13:16,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:13:16,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:13:16,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:13:16,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b01384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16, skipping insertion in model container [2024-10-14 17:13:16,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:13:16,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:13:16,791 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:13:16,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:13:16,839 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:13:16,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16 WrapperNode [2024-10-14 17:13:16,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:13:16,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:13:16,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:13:16,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:13:16,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,871 INFO L138 Inliner]: procedures = 21, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-10-14 17:13:16,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:13:16,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:13:16,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:13:16,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:13:16,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:13:16,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:13:16,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:13:16,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:13:16,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (1/1) ... [2024-10-14 17:13:16,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:13:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:13:16,941 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-10-14 17:13:16,943 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-10-14 17:13:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:13:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:13:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:13:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:13:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:13:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:13:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:13:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:13:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:13:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:13:16,981 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:13:17,094 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:13:17,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:13:17,317 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:13:17,317 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:13:17,333 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:13:17,333 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 17:13:17,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:17 BoogieIcfgContainer [2024-10-14 17:13:17,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:13:17,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:13:17,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:13:17,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:13:17,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:13:16" (1/3) ... [2024-10-14 17:13:17,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28284701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:17, skipping insertion in model container [2024-10-14 17:13:17,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:16" (2/3) ... [2024-10-14 17:13:17,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28284701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:17, skipping insertion in model container [2024-10-14 17:13:17,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:17" (3/3) ... [2024-10-14 17:13:17,345 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2024-10-14 17:13:17,358 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:13:17,358 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-10-14 17:13:17,358 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:13:17,444 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:13:17,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 363 flow [2024-10-14 17:13:17,568 INFO L124 PetriNetUnfolderBase]: 7/168 cut-off events. [2024-10-14 17:13:17,568 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:13:17,577 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 260 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-10-14 17:13:17,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 363 flow [2024-10-14 17:13:17,583 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 151 transitions, 320 flow [2024-10-14 17:13:17,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:13:17,601 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;@e7e177c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:13:17,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-10-14 17:13:17,611 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:13:17,611 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-10-14 17:13:17,611 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:13:17,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:17,614 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:17,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:17,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash -627681014, now seen corresponding path program 1 times [2024-10-14 17:13:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:17,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79818924] [2024-10-14 17:13:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:17,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79818924] [2024-10-14 17:13:17,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79818924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:17,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659614523] [2024-10-14 17:13:17,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:17,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:17,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:17,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2024-10-14 17:13:17,896 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-10-14 17:13:17,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:17,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2024-10-14 17:13:17,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:17,987 INFO L124 PetriNetUnfolderBase]: 10/216 cut-off events. [2024-10-14 17:13:17,989 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-14 17:13:17,993 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 677 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-10-14 17:13:17,996 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-10-14 17:13:17,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 338 flow [2024-10-14 17:13:17,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2024-10-14 17:13:18,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2024-10-14 17:13:18,015 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 320 flow. Second operand 3 states and 470 transitions. [2024-10-14 17:13:18,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 338 flow [2024-10-14 17:13:18,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 326 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 17:13:18,023 INFO L231 Difference]: Finished difference. Result has 150 places, 147 transitions, 304 flow [2024-10-14 17:13:18,026 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-10-14 17:13:18,032 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -5 predicate places. [2024-10-14 17:13:18,032 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 147 transitions, 304 flow [2024-10-14 17:13:18,033 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-10-14 17:13:18,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:18,033 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-10-14 17:13:18,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:13:18,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:18,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash 595083197, now seen corresponding path program 1 times [2024-10-14 17:13:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:18,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938458974] [2024-10-14 17:13:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:18,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938458974] [2024-10-14 17:13:18,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938458974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932652817] [2024-10-14 17:13:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:18,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:18,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:18,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:18,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:18,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2024-10-14 17:13:18,147 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-10-14 17:13:18,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:18,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2024-10-14 17:13:18,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:18,244 INFO L124 PetriNetUnfolderBase]: 11/188 cut-off events. [2024-10-14 17:13:18,244 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:13:18,245 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 492 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-10-14 17:13:18,246 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2024-10-14 17:13:18,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 328 flow [2024-10-14 17:13:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2024-10-14 17:13:18,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9103313840155945 [2024-10-14 17:13:18,249 INFO L175 Difference]: Start difference. First operand has 150 places, 147 transitions, 304 flow. Second operand 3 states and 467 transitions. [2024-10-14 17:13:18,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 146 transitions, 328 flow [2024-10-14 17:13:18,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 146 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:18,255 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 302 flow [2024-10-14 17:13:18,255 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-10-14 17:13:18,256 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -6 predicate places. [2024-10-14 17:13:18,256 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 302 flow [2024-10-14 17:13:18,257 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-10-14 17:13:18,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:18,257 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-10-14 17:13:18,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:13:18,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:18,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1025320405, now seen corresponding path program 1 times [2024-10-14 17:13:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925550272] [2024-10-14 17:13:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925550272] [2024-10-14 17:13:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925550272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:18,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:18,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454443517] [2024-10-14 17:13:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:18,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:18,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:18,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2024-10-14 17:13:18,354 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-10-14 17:13:18,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:18,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2024-10-14 17:13:18,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:18,415 INFO L124 PetriNetUnfolderBase]: 30/404 cut-off events. [2024-10-14 17:13:18,416 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:13:18,417 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 22. Compared 1970 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-10-14 17:13:18,419 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-10-14 17:13:18,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 145 transitions, 328 flow [2024-10-14 17:13:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2024-10-14 17:13:18,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9064327485380117 [2024-10-14 17:13:18,422 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 302 flow. Second operand 3 states and 465 transitions. [2024-10-14 17:13:18,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 145 transitions, 328 flow [2024-10-14 17:13:18,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:18,425 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 300 flow [2024-10-14 17:13:18,426 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-10-14 17:13:18,427 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -7 predicate places. [2024-10-14 17:13:18,427 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 300 flow [2024-10-14 17:13:18,427 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-10-14 17:13:18,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:18,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:18,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:13:18,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:18,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1264360153, now seen corresponding path program 1 times [2024-10-14 17:13:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:18,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607329827] [2024-10-14 17:13:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:18,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607329827] [2024-10-14 17:13:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607329827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:18,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:18,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456253237] [2024-10-14 17:13:18,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:18,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:18,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:18,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2024-10-14 17:13:18,526 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-10-14 17:13:18,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:18,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2024-10-14 17:13:18,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:18,639 INFO L124 PetriNetUnfolderBase]: 97/835 cut-off events. [2024-10-14 17:13:18,639 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-14 17:13:18,642 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 5812 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-10-14 17:13:18,646 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 15 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2024-10-14 17:13:18,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 147 transitions, 342 flow [2024-10-14 17:13:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2024-10-14 17:13:18,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2024-10-14 17:13:18,650 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 300 flow. Second operand 3 states and 471 transitions. [2024-10-14 17:13:18,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 147 transitions, 342 flow [2024-10-14 17:13:18,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 147 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:18,655 INFO L231 Difference]: Finished difference. Result has 146 places, 145 transitions, 311 flow [2024-10-14 17:13:18,655 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-10-14 17:13:18,656 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2024-10-14 17:13:18,657 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 311 flow [2024-10-14 17:13:18,657 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-10-14 17:13:18,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:18,657 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-10-14 17:13:18,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:13:18,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:18,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 310274100, now seen corresponding path program 1 times [2024-10-14 17:13:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:18,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457814029] [2024-10-14 17:13:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:18,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457814029] [2024-10-14 17:13:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457814029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:18,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:18,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:18,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020179450] [2024-10-14 17:13:18,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:18,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:18,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:18,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:18,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-10-14 17:13:18,756 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-10-14 17:13:18,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:18,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-10-14 17:13:18,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:18,808 INFO L124 PetriNetUnfolderBase]: 27/356 cut-off events. [2024-10-14 17:13:18,808 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-10-14 17:13:18,810 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-10-14 17:13:18,811 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2024-10-14 17:13:18,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 145 transitions, 339 flow [2024-10-14 17:13:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-10-14 17:13:18,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-10-14 17:13:18,813 INFO L175 Difference]: Start difference. First operand has 146 places, 145 transitions, 311 flow. Second operand 3 states and 474 transitions. [2024-10-14 17:13:18,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 145 transitions, 339 flow [2024-10-14 17:13:18,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 145 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:13:18,816 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 313 flow [2024-10-14 17:13:18,816 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-10-14 17:13:18,817 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2024-10-14 17:13:18,817 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 313 flow [2024-10-14 17:13:18,818 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-10-14 17:13:18,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:18,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:18,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:13:18,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:18,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:18,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1820679926, now seen corresponding path program 1 times [2024-10-14 17:13:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:18,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796676264] [2024-10-14 17:13:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:18,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796676264] [2024-10-14 17:13:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796676264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:18,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:18,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242092873] [2024-10-14 17:13:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:18,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:18,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:18,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:18,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-10-14 17:13:18,889 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-10-14 17:13:18,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:18,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-10-14 17:13:18,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:18,980 INFO L124 PetriNetUnfolderBase]: 71/676 cut-off events. [2024-10-14 17:13:18,980 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2024-10-14 17:13:18,983 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 3844 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-10-14 17:13:18,987 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 16 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2024-10-14 17:13:18,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 148 transitions, 364 flow [2024-10-14 17:13:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2024-10-14 17:13:18,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337231968810916 [2024-10-14 17:13:18,989 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 313 flow. Second operand 3 states and 479 transitions. [2024-10-14 17:13:18,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 148 transitions, 364 flow [2024-10-14 17:13:18,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 148 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:18,992 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 317 flow [2024-10-14 17:13:18,992 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-10-14 17:13:18,993 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2024-10-14 17:13:18,993 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 317 flow [2024-10-14 17:13:18,994 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-10-14 17:13:18,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:18,994 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-10-14 17:13:18,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:13:18,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:18,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash -587933639, now seen corresponding path program 1 times [2024-10-14 17:13:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:18,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465590170] [2024-10-14 17:13:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465590170] [2024-10-14 17:13:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465590170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:19,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:19,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:19,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015251570] [2024-10-14 17:13:19,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:19,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:19,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:19,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:19,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-10-14 17:13:19,053 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-10-14 17:13:19,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:19,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-10-14 17:13:19,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:19,158 INFO L124 PetriNetUnfolderBase]: 59/689 cut-off events. [2024-10-14 17:13:19,158 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-10-14 17:13:19,161 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 4213 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-10-14 17:13:19,164 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-10-14 17:13:19,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 144 transitions, 349 flow [2024-10-14 17:13:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-10-14 17:13:19,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-10-14 17:13:19,167 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 317 flow. Second operand 3 states and 474 transitions. [2024-10-14 17:13:19,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 144 transitions, 349 flow [2024-10-14 17:13:19,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 144 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:13:19,171 INFO L231 Difference]: Finished difference. Result has 146 places, 142 transitions, 319 flow [2024-10-14 17:13:19,171 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-10-14 17:13:19,172 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2024-10-14 17:13:19,172 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 142 transitions, 319 flow [2024-10-14 17:13:19,172 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-10-14 17:13:19,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:19,173 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-10-14 17:13:19,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:13:19,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:19,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash -142452217, now seen corresponding path program 1 times [2024-10-14 17:13:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163550998] [2024-10-14 17:13:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:19,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:19,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163550998] [2024-10-14 17:13:19,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163550998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:19,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:19,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:19,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784971607] [2024-10-14 17:13:19,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:19,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:19,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:19,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:19,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-10-14 17:13:19,226 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-10-14 17:13:19,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:19,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-10-14 17:13:19,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:19,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-8-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][92], [115#L58-2true, 200#true, Black: 193#true, 195#(= |#race~a~0| 0), 141#L75-4true, 80#L50-2true, 148#L42-2true, Black: 186#true, 197#true, 188#(= |#race~c~0| 0)]) [2024-10-14 17:13:19,308 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-10-14 17:13:19,308 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-10-14 17:13:19,308 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-10-14 17:13:19,308 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-10-14 17:13:19,315 INFO L124 PetriNetUnfolderBase]: 65/617 cut-off events. [2024-10-14 17:13:19,316 INFO L125 PetriNetUnfolderBase]: For 14/17 co-relation queries the response was YES. [2024-10-14 17:13:19,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 617 events. 65/617 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3410 event pairs, 12 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 574. Up to 55 conditions per place. [2024-10-14 17:13:19,321 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2024-10-14 17:13:19,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 142 transitions, 347 flow [2024-10-14 17:13:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-10-14 17:13:19,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-10-14 17:13:19,324 INFO L175 Difference]: Start difference. First operand has 146 places, 142 transitions, 319 flow. Second operand 3 states and 474 transitions. [2024-10-14 17:13:19,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 142 transitions, 347 flow [2024-10-14 17:13:19,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:19,328 INFO L231 Difference]: Finished difference. Result has 144 places, 140 transitions, 317 flow [2024-10-14 17:13:19,328 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-10-14 17:13:19,329 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -11 predicate places. [2024-10-14 17:13:19,330 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 140 transitions, 317 flow [2024-10-14 17:13:19,331 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-10-14 17:13:19,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:19,331 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:19,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:13:19,331 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:19,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash 542387017, now seen corresponding path program 1 times [2024-10-14 17:13:19,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:19,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582248431] [2024-10-14 17:13:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:19,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:19,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582248431] [2024-10-14 17:13:19,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582248431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:19,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:19,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:19,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896963896] [2024-10-14 17:13:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:19,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:19,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-10-14 17:13:19,405 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-10-14 17:13:19,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:19,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-10-14 17:13:19,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:19,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-8-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][91], [115#L58-2true, 205#(= |#race~b~0| 0), 200#true, Black: 193#true, 195#(= |#race~a~0| 0), 141#L75-4true, 80#L50-2true, 148#L42-2true, Black: 186#true, 188#(= |#race~c~0| 0)]) [2024-10-14 17:13:19,525 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-10-14 17:13:19,525 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-10-14 17:13:19,525 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-10-14 17:13:19,525 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-10-14 17:13:19,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-8-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][91], [115#L58-2true, 205#(= |#race~b~0| 0), 200#true, Black: 193#true, 195#(= |#race~a~0| 0), 138#L76-1true, 80#L50-2true, Black: 186#true, 188#(= |#race~c~0| 0)]) [2024-10-14 17:13:19,532 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-10-14 17:13:19,533 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-10-14 17:13:19,533 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-10-14 17:13:19,533 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-10-14 17:13:19,534 INFO L124 PetriNetUnfolderBase]: 138/960 cut-off events. [2024-10-14 17:13:19,534 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2024-10-14 17:13:19,537 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 6653 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-10-14 17:13:19,539 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-10-14 17:13:19,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 144 transitions, 363 flow [2024-10-14 17:13:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2024-10-14 17:13:19,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9317738791423001 [2024-10-14 17:13:19,542 INFO L175 Difference]: Start difference. First operand has 144 places, 140 transitions, 317 flow. Second operand 3 states and 478 transitions. [2024-10-14 17:13:19,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 144 transitions, 363 flow [2024-10-14 17:13:19,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 144 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:19,546 INFO L231 Difference]: Finished difference. Result has 143 places, 140 transitions, 321 flow [2024-10-14 17:13:19,547 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-10-14 17:13:19,548 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -12 predicate places. [2024-10-14 17:13:19,548 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 140 transitions, 321 flow [2024-10-14 17:13:19,548 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-10-14 17:13:19,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:19,548 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:19,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:13:19,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:19,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1866530721, now seen corresponding path program 1 times [2024-10-14 17:13:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:19,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691017977] [2024-10-14 17:13:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:19,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-10-14 17:13:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:19,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691017977] [2024-10-14 17:13:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691017977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:19,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:19,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265098044] [2024-10-14 17:13:19,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:19,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:19,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:19,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-10-14 17:13:19,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 140 transitions, 321 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-10-14 17:13:19,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:19,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-10-14 17:13:19,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:19,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-8-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][91], [115#L58-2true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 141#L75-4true, 80#L50-2true, 207#true, 148#L42-2true, Black: 186#true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2024-10-14 17:13:19,699 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-10-14 17:13:19,700 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-10-14 17:13:19,700 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-10-14 17:13:19,700 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-10-14 17:13:19,707 INFO L124 PetriNetUnfolderBase]: 96/659 cut-off events. [2024-10-14 17:13:19,707 INFO L125 PetriNetUnfolderBase]: For 31/47 co-relation queries the response was YES. [2024-10-14 17:13:19,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 659 events. 96/659 cut-off events. For 31/47 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3910 event pairs, 14 based on Foata normal form. 6/611 useless extension candidates. Maximal degree in co-relation 671. Up to 70 conditions per place. [2024-10-14 17:13:19,713 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 8 selfloop transitions, 2 changer transitions 6/140 dead transitions. [2024-10-14 17:13:19,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 347 flow [2024-10-14 17:13:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2024-10-14 17:13:19,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9220272904483431 [2024-10-14 17:13:19,715 INFO L175 Difference]: Start difference. First operand has 143 places, 140 transitions, 321 flow. Second operand 3 states and 473 transitions. [2024-10-14 17:13:19,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 347 flow [2024-10-14 17:13:19,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:13:19,719 INFO L231 Difference]: Finished difference. Result has 143 places, 132 transitions, 308 flow [2024-10-14 17:13:19,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2024-10-14 17:13:19,720 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -12 predicate places. [2024-10-14 17:13:19,721 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 308 flow [2024-10-14 17:13:19,722 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-10-14 17:13:19,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:19,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:19,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:13:19,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:19,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash 958101900, now seen corresponding path program 1 times [2024-10-14 17:13:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:19,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947871773] [2024-10-14 17:13:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:19,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:19,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947871773] [2024-10-14 17:13:19,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947871773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:19,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:19,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:19,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151374519] [2024-10-14 17:13:19,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:19,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:19,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:19,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:19,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:19,793 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-10-14 17:13:19,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 308 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-10-14 17:13:19,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:19,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-10-14 17:13:19,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:19,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-8-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][91], [115#L58-2true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 141#L75-4true, 80#L50-2true, 210#true, 148#L42-2true, 207#true, Black: 186#true, 188#(= |#race~c~0| 0), Black: 203#true]) [2024-10-14 17:13:19,874 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-10-14 17:13:19,874 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-10-14 17:13:19,874 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-10-14 17:13:19,874 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-10-14 17:13:19,884 INFO L124 PetriNetUnfolderBase]: 117/824 cut-off events. [2024-10-14 17:13:19,885 INFO L125 PetriNetUnfolderBase]: For 26/30 co-relation queries the response was YES. [2024-10-14 17:13:19,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 824 events. 117/824 cut-off events. For 26/30 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5204 event pairs, 40 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 861. Up to 84 conditions per place. [2024-10-14 17:13:19,892 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 10 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2024-10-14 17:13:19,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 336 flow [2024-10-14 17:13:19,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2024-10-14 17:13:19,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9200779727095516 [2024-10-14 17:13:19,894 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 308 flow. Second operand 3 states and 472 transitions. [2024-10-14 17:13:19,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 336 flow [2024-10-14 17:13:19,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:19,897 INFO L231 Difference]: Finished difference. Result has 136 places, 131 transitions, 306 flow [2024-10-14 17:13:19,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=136, PETRI_TRANSITIONS=131} [2024-10-14 17:13:19,898 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -19 predicate places. [2024-10-14 17:13:19,898 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 306 flow [2024-10-14 17:13:19,899 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-10-14 17:13:19,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:19,899 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-10-14 17:13:19,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:13:19,899 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-14 17:13:19,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1598053624, now seen corresponding path program 1 times [2024-10-14 17:13:19,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:19,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88201807] [2024-10-14 17:13:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:19,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:19,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88201807] [2024-10-14 17:13:19,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88201807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:19,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:19,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:19,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849080981] [2024-10-14 17:13:19,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:19,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:19,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:19,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:19,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2024-10-14 17:13:19,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 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-10-14 17:13:19,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:19,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2024-10-14 17:13:19,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:20,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L58-8-->L58-2: Formula: (= |v_#race~c~0_7| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_7|} AuxVars[] AssignedVars[#race~c~0][91], [115#L58-2true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 141#L75-4true, 80#L50-2true, 210#true, 213#true, 148#L42-2true, Black: 186#true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2024-10-14 17:13:20,050 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-10-14 17:13:20,050 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-10-14 17:13:20,050 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-10-14 17:13:20,050 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-10-14 17:13:20,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([443] L59-7-->L59-8: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet5=|v_thread3Thread1of1ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet5][122], [205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 96#L59-8true, 210#true, 213#true, 91#L77true, Black: 186#true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2024-10-14 17:13:20,057 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2024-10-14 17:13:20,057 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-14 17:13:20,057 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-14 17:13:20,057 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-14 17:13:20,057 INFO L124 PetriNetUnfolderBase]: 106/653 cut-off events. [2024-10-14 17:13:20,057 INFO L125 PetriNetUnfolderBase]: For 37/61 co-relation queries the response was YES. [2024-10-14 17:13:20,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 653 events. 106/653 cut-off events. For 37/61 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3845 event pairs, 29 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 783. Up to 85 conditions per place. [2024-10-14 17:13:20,061 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 0 selfloop transitions, 0 changer transitions 132/132 dead transitions. [2024-10-14 17:13:20,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 132 transitions, 334 flow [2024-10-14 17:13:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2024-10-14 17:13:20,063 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9200779727095516 [2024-10-14 17:13:20,063 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 306 flow. Second operand 3 states and 472 transitions. [2024-10-14 17:13:20,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 132 transitions, 334 flow [2024-10-14 17:13:20,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:20,066 INFO L231 Difference]: Finished difference. Result has 135 places, 0 transitions, 0 flow [2024-10-14 17:13:20,067 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-10-14 17:13:20,068 INFO L277 CegarLoopForPetriNet]: 155 programPoint places, -20 predicate places. [2024-10-14 17:13:20,069 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 0 transitions, 0 flow [2024-10-14 17:13:20,069 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-10-14 17:13:20,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2024-10-14 17:13:20,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2024-10-14 17:13:20,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2024-10-14 17:13:20,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2024-10-14 17:13:20,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2024-10-14 17:13:20,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2024-10-14 17:13:20,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2024-10-14 17:13:20,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2024-10-14 17:13:20,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2024-10-14 17:13:20,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2024-10-14 17:13:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 35 remaining) [2024-10-14 17:13:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2024-10-14 17:13:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2024-10-14 17:13:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2024-10-14 17:13:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2024-10-14 17:13:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2024-10-14 17:13:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2024-10-14 17:13:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2024-10-14 17:13:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2024-10-14 17:13:20,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2024-10-14 17:13:20,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2024-10-14 17:13:20,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2024-10-14 17:13:20,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2024-10-14 17:13:20,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2024-10-14 17:13:20,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2024-10-14 17:13:20,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2024-10-14 17:13:20,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:13:20,077 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:20,082 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:13:20,083 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:13:20,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:13:20 BasicIcfg [2024-10-14 17:13:20,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:13:20,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:13:20,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:13:20,089 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:13:20,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:17" (3/4) ... [2024-10-14 17:13:20,091 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:13:20,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:13:20,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:13:20,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-14 17:13:20,099 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 17:13:20,100 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:13:20,100 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:13:20,100 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:13:20,187 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:13:20,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:13:20,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:13:20,189 INFO L158 Benchmark]: Toolchain (without parser) took 3662.28ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 75.3MB in the beginning and 128.9MB in the end (delta: -53.6MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-10-14 17:13:20,189 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:13:20,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.28ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 62.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:13:20,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.16ms. Allocated memory is still 144.7MB. Free memory was 62.6MB in the beginning and 61.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:13:20,192 INFO L158 Benchmark]: Boogie Preprocessor took 26.85ms. Allocated memory is still 144.7MB. Free memory was 61.2MB in the beginning and 59.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:13:20,192 INFO L158 Benchmark]: RCFGBuilder took 433.52ms. Allocated memory is still 144.7MB. Free memory was 59.7MB in the beginning and 105.7MB in the end (delta: -46.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:13:20,192 INFO L158 Benchmark]: TraceAbstraction took 2752.74ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 105.0MB in the beginning and 133.1MB in the end (delta: -28.1MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. [2024-10-14 17:13:20,193 INFO L158 Benchmark]: Witness Printer took 99.69ms. Allocated memory is still 199.2MB. Free memory was 133.1MB in the beginning and 128.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:13:20,194 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.28ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 62.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.16ms. Allocated memory is still 144.7MB. Free memory was 62.6MB in the beginning and 61.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.85ms. Allocated memory is still 144.7MB. Free memory was 61.2MB in the beginning and 59.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 433.52ms. Allocated memory is still 144.7MB. Free memory was 59.7MB in the beginning and 105.7MB in the end (delta: -46.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2752.74ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 105.0MB in the beginning and 133.1MB in the end (delta: -28.1MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. * Witness Printer took 99.69ms. Allocated memory is still 199.2MB. Free memory was 133.1MB in the beginning and 128.9MB 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.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, 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, 334 IncrementalHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 72 mSDtfsCounter, 334 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=321occurred in iteration=9, 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-10-14 17:13:20,225 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