./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i -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 dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:49:42,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:49:42,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:49:42,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:49:42,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:49:42,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:49:42,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:49:42,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:49:42,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:49:42,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:49:42,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:49:42,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:49:42,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:49:42,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:49:42,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:49:42,829 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:49:42,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:49:42,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:49:42,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:49:42,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:49:42,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:49:42,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:49:42,831 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:49:42,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:49:42,834 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:49:42,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:49:42,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:49:42,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:49:42,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:49:42,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:49:42,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:49:42,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:49:42,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:49:42,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:49:42,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:49:42,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:49:42,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:49:42,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:49:42,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:49:42,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:49:42,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:49:42,838 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 -> dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec [2024-11-16 23:49:43,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:49:43,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:49:43,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:49:43,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:49:43,130 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:49:43,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2024-11-16 23:49:44,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:49:44,864 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:49:44,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2024-11-16 23:49:44,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c268ab864/32d788b6644346e097694f9a8e49add9/FLAG14ad2a091 [2024-11-16 23:49:44,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c268ab864/32d788b6644346e097694f9a8e49add9 [2024-11-16 23:49:44,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:49:44,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:49:44,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:49:44,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:49:44,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:49:44,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:49:44" (1/1) ... [2024-11-16 23:49:44,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7783ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:44, skipping insertion in model container [2024-11-16 23:49:44,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:49:44" (1/1) ... [2024-11-16 23:49:44,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:49:45,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:49:45,417 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:49:45,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:49:45,524 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:49:45,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45 WrapperNode [2024-11-16 23:49:45,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:49:45,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:49:45,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:49:45,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:49:45,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,567 INFO L138 Inliner]: procedures = 273, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-16 23:49:45,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:49:45,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:49:45,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:49:45,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:49:45,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:49:45,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:49:45,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:49:45,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:49:45,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (1/1) ... [2024-11-16 23:49:45,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:49:45,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:49:45,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:49:45,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:49:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:49:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:49:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:49:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:49:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-16 23:49:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-16 23:49:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:49:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:49:45,680 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:49:45,811 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:49:45,813 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:49:46,068 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:49:46,068 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:49:46,084 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:49:46,086 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:49:46,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:49:46 BoogieIcfgContainer [2024-11-16 23:49:46,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:49:46,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:49:46,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:49:46,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:49:46,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:49:44" (1/3) ... [2024-11-16 23:49:46,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e515486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:49:46, skipping insertion in model container [2024-11-16 23:49:46,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:45" (2/3) ... [2024-11-16 23:49:46,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e515486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:49:46, skipping insertion in model container [2024-11-16 23:49:46,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:49:46" (3/3) ... [2024-11-16 23:49:46,096 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race.i [2024-11-16 23:49:46,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:49:46,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-16 23:49:46,117 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:49:46,189 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 23:49:46,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 114 transitions, 235 flow [2024-11-16 23:49:46,293 INFO L124 PetriNetUnfolderBase]: 6/151 cut-off events. [2024-11-16 23:49:46,294 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:49:46,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 151 events. 6/151 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 266 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2024-11-16 23:49:46,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 114 transitions, 235 flow [2024-11-16 23:49:46,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 114 transitions, 235 flow [2024-11-16 23:49:46,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:49:46,317 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;@12ce416b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:49:46,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-16 23:49:46,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:49:46,324 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2024-11-16 23:49:46,324 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:49:46,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:46,325 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] [2024-11-16 23:49:46,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:49:46,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:46,329 INFO L85 PathProgramCache]: Analyzing trace with hash 942237023, now seen corresponding path program 1 times [2024-11-16 23:49:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:46,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434909706] [2024-11-16 23:49:46,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:46,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434909706] [2024-11-16 23:49:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434909706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:46,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:46,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178139987] [2024-11-16 23:49:46,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:46,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:46,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:46,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2024-11-16 23:49:46,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 114 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:46,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:46,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2024-11-16 23:49:46,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:46,771 INFO L124 PetriNetUnfolderBase]: 3/181 cut-off events. [2024-11-16 23:49:46,772 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:49:46,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 181 events. 3/181 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 369 event pairs, 2 based on Foata normal form. 7/168 useless extension candidates. Maximal degree in co-relation 118. Up to 15 conditions per place. [2024-11-16 23:49:46,775 INFO L140 encePairwiseOnDemand]: 108/114 looper letters, 8 selfloop transitions, 2 changer transitions 1/110 dead transitions. [2024-11-16 23:49:46,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 110 transitions, 247 flow [2024-11-16 23:49:46,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2024-11-16 23:49:46,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2024-11-16 23:49:46,791 INFO L175 Difference]: Start difference. First operand has 113 places, 114 transitions, 235 flow. Second operand 3 states and 314 transitions. [2024-11-16 23:49:46,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 110 transitions, 247 flow [2024-11-16 23:49:46,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 110 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:46,802 INFO L231 Difference]: Finished difference. Result has 114 places, 109 transitions, 229 flow [2024-11-16 23:49:46,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=114, PETRI_TRANSITIONS=109} [2024-11-16 23:49:46,811 INFO L277 CegarLoopForPetriNet]: 113 programPoint places, 1 predicate places. [2024-11-16 23:49:46,812 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 109 transitions, 229 flow [2024-11-16 23:49:46,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:46,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:46,813 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] [2024-11-16 23:49:46,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:49:46,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:49:46,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1066575943, now seen corresponding path program 1 times [2024-11-16 23:49:46,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159912324] [2024-11-16 23:49:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:46,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:46,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159912324] [2024-11-16 23:49:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159912324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:46,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:46,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:46,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514907650] [2024-11-16 23:49:46,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:46,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:46,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:46,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:46,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:46,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 114 [2024-11-16 23:49:46,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 109 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:46,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:46,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 114 [2024-11-16 23:49:46,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:47,020 INFO L124 PetriNetUnfolderBase]: 5/190 cut-off events. [2024-11-16 23:49:47,021 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-16 23:49:47,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 190 events. 5/190 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 394 event pairs, 2 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 184. Up to 16 conditions per place. [2024-11-16 23:49:47,022 INFO L140 encePairwiseOnDemand]: 110/114 looper letters, 7 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-11-16 23:49:47,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 247 flow [2024-11-16 23:49:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2024-11-16 23:49:47,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9269005847953217 [2024-11-16 23:49:47,025 INFO L175 Difference]: Start difference. First operand has 114 places, 109 transitions, 229 flow. Second operand 3 states and 317 transitions. [2024-11-16 23:49:47,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 247 flow [2024-11-16 23:49:47,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 109 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:47,028 INFO L231 Difference]: Finished difference. Result has 112 places, 109 transitions, 235 flow [2024-11-16 23:49:47,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=112, PETRI_TRANSITIONS=109} [2024-11-16 23:49:47,029 INFO L277 CegarLoopForPetriNet]: 113 programPoint places, -1 predicate places. [2024-11-16 23:49:47,030 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 109 transitions, 235 flow [2024-11-16 23:49:47,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:47,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:47,030 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] [2024-11-16 23:49:47,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:49:47,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:49:47,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1972394872, now seen corresponding path program 1 times [2024-11-16 23:49:47,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:47,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207371416] [2024-11-16 23:49:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:47,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:47,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207371416] [2024-11-16 23:49:47,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207371416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:47,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:47,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:49:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960609510] [2024-11-16 23:49:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:47,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:49:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:49:47,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:49:47,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2024-11-16 23:49:47,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:47,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:47,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2024-11-16 23:49:47,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:47,943 INFO L124 PetriNetUnfolderBase]: 73/425 cut-off events. [2024-11-16 23:49:47,944 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:49:47,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 425 events. 73/425 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1981 event pairs, 35 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 520. Up to 159 conditions per place. [2024-11-16 23:49:47,947 INFO L140 encePairwiseOnDemand]: 103/114 looper letters, 23 selfloop transitions, 22 changer transitions 0/130 dead transitions. [2024-11-16 23:49:47,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 130 transitions, 367 flow [2024-11-16 23:49:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:49:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:49:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 568 transitions. [2024-11-16 23:49:47,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8304093567251462 [2024-11-16 23:49:47,951 INFO L175 Difference]: Start difference. First operand has 112 places, 109 transitions, 235 flow. Second operand 6 states and 568 transitions. [2024-11-16 23:49:47,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 130 transitions, 367 flow [2024-11-16 23:49:47,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 130 transitions, 367 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:47,955 INFO L231 Difference]: Finished difference. Result has 122 places, 130 transitions, 385 flow [2024-11-16 23:49:47,956 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=122, PETRI_TRANSITIONS=130} [2024-11-16 23:49:47,957 INFO L277 CegarLoopForPetriNet]: 113 programPoint places, 9 predicate places. [2024-11-16 23:49:47,957 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 130 transitions, 385 flow [2024-11-16 23:49:47,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:47,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:47,958 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:47,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:49:47,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:49:47,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1955017553, now seen corresponding path program 1 times [2024-11-16 23:49:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879098149] [2024-11-16 23:49:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879098149] [2024-11-16 23:49:48,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879098149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:48,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:48,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:49:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917093415] [2024-11-16 23:49:48,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:48,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:49:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:48,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:49:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:49:48,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114 [2024-11-16 23:49:48,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 130 transitions, 385 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:48,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114 [2024-11-16 23:49:48,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:48,217 INFO L124 PetriNetUnfolderBase]: 34/286 cut-off events. [2024-11-16 23:49:48,217 INFO L125 PetriNetUnfolderBase]: For 29/44 co-relation queries the response was YES. [2024-11-16 23:49:48,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 286 events. 34/286 cut-off events. For 29/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 952 event pairs, 0 based on Foata normal form. 2/273 useless extension candidates. Maximal degree in co-relation 358. Up to 49 conditions per place. [2024-11-16 23:49:48,221 INFO L140 encePairwiseOnDemand]: 106/114 looper letters, 11 selfloop transitions, 2 changer transitions 5/135 dead transitions. [2024-11-16 23:49:48,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 135 transitions, 431 flow [2024-11-16 23:49:48,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:49:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:49:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2024-11-16 23:49:48,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8874269005847953 [2024-11-16 23:49:48,224 INFO L175 Difference]: Start difference. First operand has 122 places, 130 transitions, 385 flow. Second operand 6 states and 607 transitions. [2024-11-16 23:49:48,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 135 transitions, 431 flow [2024-11-16 23:49:48,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 135 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:48,232 INFO L231 Difference]: Finished difference. Result has 131 places, 130 transitions, 403 flow [2024-11-16 23:49:48,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=131, PETRI_TRANSITIONS=130} [2024-11-16 23:49:48,235 INFO L277 CegarLoopForPetriNet]: 113 programPoint places, 18 predicate places. [2024-11-16 23:49:48,235 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 130 transitions, 403 flow [2024-11-16 23:49:48,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:48,237 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] [2024-11-16 23:49:48,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:49:48,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:49:48,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1487410766, now seen corresponding path program 1 times [2024-11-16 23:49:48,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:48,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020070315] [2024-11-16 23:49:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020070315] [2024-11-16 23:49:48,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020070315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:48,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:48,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:48,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811404999] [2024-11-16 23:49:48,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:48,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:48,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:48,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:48,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 114 [2024-11-16 23:49:48,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 130 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:48,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 114 [2024-11-16 23:49:48,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:48,352 INFO L124 PetriNetUnfolderBase]: 33/271 cut-off events. [2024-11-16 23:49:48,352 INFO L125 PetriNetUnfolderBase]: For 30/39 co-relation queries the response was YES. [2024-11-16 23:49:48,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 271 events. 33/271 cut-off events. For 30/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 906 event pairs, 0 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 374. Up to 49 conditions per place. [2024-11-16 23:49:48,354 INFO L140 encePairwiseOnDemand]: 110/114 looper letters, 5 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-11-16 23:49:48,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 128 transitions, 413 flow [2024-11-16 23:49:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2024-11-16 23:49:48,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9210526315789473 [2024-11-16 23:49:48,356 INFO L175 Difference]: Start difference. First operand has 131 places, 130 transitions, 403 flow. Second operand 3 states and 315 transitions. [2024-11-16 23:49:48,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 128 transitions, 413 flow [2024-11-16 23:49:48,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 399 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-16 23:49:48,361 INFO L231 Difference]: Finished difference. Result has 123 places, 128 transitions, 389 flow [2024-11-16 23:49:48,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=123, PETRI_TRANSITIONS=128} [2024-11-16 23:49:48,362 INFO L277 CegarLoopForPetriNet]: 113 programPoint places, 10 predicate places. [2024-11-16 23:49:48,362 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 128 transitions, 389 flow [2024-11-16 23:49:48,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:48,362 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:48,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:49:48,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:49:48,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash 319243383, now seen corresponding path program 1 times [2024-11-16 23:49:48,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:48,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419139595] [2024-11-16 23:49:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:48,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:48,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:48,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419139595] [2024-11-16 23:49:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419139595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:48,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250786428] [2024-11-16 23:49:48,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:48,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:48,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:48,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:48,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 114 [2024-11-16 23:49:48,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 389 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:48,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 114 [2024-11-16 23:49:48,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:48,478 INFO L124 PetriNetUnfolderBase]: 33/270 cut-off events. [2024-11-16 23:49:48,479 INFO L125 PetriNetUnfolderBase]: For 30/39 co-relation queries the response was YES. [2024-11-16 23:49:48,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 270 events. 33/270 cut-off events. For 30/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 891 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 373. Up to 49 conditions per place. [2024-11-16 23:49:48,481 INFO L140 encePairwiseOnDemand]: 111/114 looper letters, 6 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-11-16 23:49:48,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 127 transitions, 403 flow [2024-11-16 23:49:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2024-11-16 23:49:48,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9210526315789473 [2024-11-16 23:49:48,483 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 389 flow. Second operand 3 states and 315 transitions. [2024-11-16 23:49:48,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 127 transitions, 403 flow [2024-11-16 23:49:48,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 127 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:48,487 INFO L231 Difference]: Finished difference. Result has 122 places, 127 transitions, 387 flow [2024-11-16 23:49:48,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=122, PETRI_TRANSITIONS=127} [2024-11-16 23:49:48,488 INFO L277 CegarLoopForPetriNet]: 113 programPoint places, 9 predicate places. [2024-11-16 23:49:48,488 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 127 transitions, 387 flow [2024-11-16 23:49:48,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:48,489 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:48,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:49:48,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:49:48,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash 177757444, now seen corresponding path program 1 times [2024-11-16 23:49:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:48,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347046470] [2024-11-16 23:49:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:49:48,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:49:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:49:48,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:49:48,565 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:49:48,566 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-11-16 23:49:48,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-16 23:49:48,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-16 23:49:48,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-16 23:49:48,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-16 23:49:48,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-16 23:49:48,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-16 23:49:48,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-16 23:49:48,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-16 23:49:48,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-16 23:49:48,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-16 23:49:48,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-16 23:49:48,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-16 23:49:48,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-16 23:49:48,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-16 23:49:48,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:49:48,576 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:48,579 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:49:48,582 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:49:48,613 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:49:48,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 150 transitions, 316 flow [2024-11-16 23:49:48,644 INFO L124 PetriNetUnfolderBase]: 11/261 cut-off events. [2024-11-16 23:49:48,644 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-16 23:49:48,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 261 events. 11/261 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 612 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2024-11-16 23:49:48,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 150 transitions, 316 flow [2024-11-16 23:49:48,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 150 transitions, 316 flow [2024-11-16 23:49:48,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:49:48,649 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;@12ce416b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:49:48,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-16 23:49:48,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:49:48,652 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2024-11-16 23:49:48,652 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:49:48,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:48,652 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] [2024-11-16 23:49:48,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:48,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash -853875105, now seen corresponding path program 1 times [2024-11-16 23:49:48,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:48,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357805070] [2024-11-16 23:49:48,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:48,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357805070] [2024-11-16 23:49:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357805070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:48,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:48,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:48,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055035723] [2024-11-16 23:49:48,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:48,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:48,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:48,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:48,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:48,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 150 [2024-11-16 23:49:48,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 150 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:48,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 150 [2024-11-16 23:49:48,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:48,780 INFO L124 PetriNetUnfolderBase]: 19/480 cut-off events. [2024-11-16 23:49:48,780 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-16 23:49:48,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 480 events. 19/480 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1995 event pairs, 16 based on Foata normal form. 17/442 useless extension candidates. Maximal degree in co-relation 321. Up to 50 conditions per place. [2024-11-16 23:49:48,785 INFO L140 encePairwiseOnDemand]: 144/150 looper letters, 11 selfloop transitions, 2 changer transitions 1/146 dead transitions. [2024-11-16 23:49:48,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 334 flow [2024-11-16 23:49:48,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-16 23:49:48,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9244444444444444 [2024-11-16 23:49:48,787 INFO L175 Difference]: Start difference. First operand has 150 places, 150 transitions, 316 flow. Second operand 3 states and 416 transitions. [2024-11-16 23:49:48,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 146 transitions, 334 flow [2024-11-16 23:49:48,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 146 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:48,790 INFO L231 Difference]: Finished difference. Result has 151 places, 145 transitions, 310 flow [2024-11-16 23:49:48,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=149, 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=310, PETRI_PLACES=151, PETRI_TRANSITIONS=145} [2024-11-16 23:49:48,792 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 1 predicate places. [2024-11-16 23:49:48,792 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 145 transitions, 310 flow [2024-11-16 23:49:48,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:48,793 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] [2024-11-16 23:49:48,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:49:48,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:48,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1492490545, now seen corresponding path program 1 times [2024-11-16 23:49:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:48,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884888900] [2024-11-16 23:49:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:48,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884888900] [2024-11-16 23:49:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884888900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:48,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:48,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:48,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824468403] [2024-11-16 23:49:48,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:48,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:48,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:48,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 150 [2024-11-16 23:49:48,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 145 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:48,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 150 [2024-11-16 23:49:48,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:48,940 INFO L124 PetriNetUnfolderBase]: 48/641 cut-off events. [2024-11-16 23:49:48,940 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-16 23:49:48,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 641 events. 48/641 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3229 event pairs, 27 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 734. Up to 97 conditions per place. [2024-11-16 23:49:48,945 INFO L140 encePairwiseOnDemand]: 144/150 looper letters, 12 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2024-11-16 23:49:48,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 146 transitions, 347 flow [2024-11-16 23:49:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2024-11-16 23:49:48,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9266666666666666 [2024-11-16 23:49:48,947 INFO L175 Difference]: Start difference. First operand has 151 places, 145 transitions, 310 flow. Second operand 3 states and 417 transitions. [2024-11-16 23:49:48,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 146 transitions, 347 flow [2024-11-16 23:49:48,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 146 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:48,949 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 321 flow [2024-11-16 23:49:48,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=145, 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=321, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2024-11-16 23:49:48,950 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, -2 predicate places. [2024-11-16 23:49:48,950 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 321 flow [2024-11-16 23:49:48,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:48,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:48,951 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] [2024-11-16 23:49:48,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:49:48,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:48,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1653944248, now seen corresponding path program 1 times [2024-11-16 23:49:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:48,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073303912] [2024-11-16 23:49:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:49,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073303912] [2024-11-16 23:49:49,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073303912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:49,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:49,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:49:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177946297] [2024-11-16 23:49:49,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:49,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:49:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:49,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:49:49,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:49:49,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 150 [2024-11-16 23:49:49,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:49,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:49,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 150 [2024-11-16 23:49:49,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:49,916 INFO L124 PetriNetUnfolderBase]: 1014/3255 cut-off events. [2024-11-16 23:49:49,916 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-16 23:49:49,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5144 conditions, 3255 events. 1014/3255 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 25975 event pairs, 580 based on Foata normal form. 0/2838 useless extension candidates. Maximal degree in co-relation 4185. Up to 1589 conditions per place. [2024-11-16 23:49:49,940 INFO L140 encePairwiseOnDemand]: 135/150 looper letters, 30 selfloop transitions, 38 changer transitions 0/183 dead transitions. [2024-11-16 23:49:49,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 183 transitions, 538 flow [2024-11-16 23:49:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:49:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:49:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2024-11-16 23:49:49,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8566666666666667 [2024-11-16 23:49:49,943 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 321 flow. Second operand 6 states and 771 transitions. [2024-11-16 23:49:49,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 183 transitions, 538 flow [2024-11-16 23:49:49,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 183 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:49,947 INFO L231 Difference]: Finished difference. Result has 158 places, 182 transitions, 575 flow [2024-11-16 23:49:49,947 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=158, PETRI_TRANSITIONS=182} [2024-11-16 23:49:49,948 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 8 predicate places. [2024-11-16 23:49:49,949 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 182 transitions, 575 flow [2024-11-16 23:49:49,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:49,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:49,950 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:49,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:49:49,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:49,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1057915141, now seen corresponding path program 1 times [2024-11-16 23:49:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:49,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258343999] [2024-11-16 23:49:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:49,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258343999] [2024-11-16 23:49:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258343999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:50,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:49:50,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320926631] [2024-11-16 23:49:50,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:50,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:49:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:49:50,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:49:50,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 150 [2024-11-16 23:49:50,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 182 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:50,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:50,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 150 [2024-11-16 23:49:50,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:50,451 INFO L124 PetriNetUnfolderBase]: 492/1933 cut-off events. [2024-11-16 23:49:50,451 INFO L125 PetriNetUnfolderBase]: For 379/590 co-relation queries the response was YES. [2024-11-16 23:49:50,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1933 events. 492/1933 cut-off events. For 379/590 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 13592 event pairs, 135 based on Foata normal form. 2/1775 useless extension candidates. Maximal degree in co-relation 2844. Up to 612 conditions per place. [2024-11-16 23:49:50,468 INFO L140 encePairwiseOnDemand]: 142/150 looper letters, 14 selfloop transitions, 2 changer transitions 5/188 dead transitions. [2024-11-16 23:49:50,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 188 transitions, 629 flow [2024-11-16 23:49:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:49:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:49:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 814 transitions. [2024-11-16 23:49:50,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9044444444444445 [2024-11-16 23:49:50,470 INFO L175 Difference]: Start difference. First operand has 158 places, 182 transitions, 575 flow. Second operand 6 states and 814 transitions. [2024-11-16 23:49:50,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 188 transitions, 629 flow [2024-11-16 23:49:50,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 188 transitions, 629 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:50,477 INFO L231 Difference]: Finished difference. Result has 167 places, 183 transitions, 597 flow [2024-11-16 23:49:50,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=597, PETRI_PLACES=167, PETRI_TRANSITIONS=183} [2024-11-16 23:49:50,478 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 17 predicate places. [2024-11-16 23:49:50,478 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 183 transitions, 597 flow [2024-11-16 23:49:50,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:50,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:50,479 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] [2024-11-16 23:49:50,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:49:50,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:50,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:50,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2010453930, now seen corresponding path program 1 times [2024-11-16 23:49:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:50,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772443678] [2024-11-16 23:49:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:50,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772443678] [2024-11-16 23:49:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772443678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:50,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829374474] [2024-11-16 23:49:50,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:50,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:50,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:50,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:50,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 150 [2024-11-16 23:49:50,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 183 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:50,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:50,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 150 [2024-11-16 23:49:50,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:51,028 INFO L124 PetriNetUnfolderBase]: 839/3677 cut-off events. [2024-11-16 23:49:51,029 INFO L125 PetriNetUnfolderBase]: For 646/769 co-relation queries the response was YES. [2024-11-16 23:49:51,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6587 conditions, 3677 events. 839/3677 cut-off events. For 646/769 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 33465 event pairs, 155 based on Foata normal form. 0/3428 useless extension candidates. Maximal degree in co-relation 6494. Up to 1045 conditions per place. [2024-11-16 23:49:51,059 INFO L140 encePairwiseOnDemand]: 136/150 looper letters, 21 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2024-11-16 23:49:51,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 196 transitions, 696 flow [2024-11-16 23:49:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2024-11-16 23:49:51,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9377777777777778 [2024-11-16 23:49:51,061 INFO L175 Difference]: Start difference. First operand has 167 places, 183 transitions, 597 flow. Second operand 3 states and 422 transitions. [2024-11-16 23:49:51,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 196 transitions, 696 flow [2024-11-16 23:49:51,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 196 transitions, 684 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-16 23:49:51,074 INFO L231 Difference]: Finished difference. Result has 164 places, 193 transitions, 673 flow [2024-11-16 23:49:51,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=164, PETRI_TRANSITIONS=193} [2024-11-16 23:49:51,076 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 14 predicate places. [2024-11-16 23:49:51,076 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 193 transitions, 673 flow [2024-11-16 23:49:51,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:51,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:51,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:51,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:49:51,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:51,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1515641489, now seen corresponding path program 1 times [2024-11-16 23:49:51,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:51,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122157765] [2024-11-16 23:49:51,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:51,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:51,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122157765] [2024-11-16 23:49:51,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122157765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:51,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:51,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:51,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225654995] [2024-11-16 23:49:51,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:51,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:51,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:51,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:51,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 150 [2024-11-16 23:49:51,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 193 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:51,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:51,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 150 [2024-11-16 23:49:51,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:51,760 INFO L124 PetriNetUnfolderBase]: 954/4324 cut-off events. [2024-11-16 23:49:51,761 INFO L125 PetriNetUnfolderBase]: For 883/1058 co-relation queries the response was YES. [2024-11-16 23:49:51,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7791 conditions, 4324 events. 954/4324 cut-off events. For 883/1058 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 41583 event pairs, 157 based on Foata normal form. 5/4019 useless extension candidates. Maximal degree in co-relation 4330. Up to 1187 conditions per place. [2024-11-16 23:49:51,798 INFO L140 encePairwiseOnDemand]: 143/150 looper letters, 20 selfloop transitions, 9 changer transitions 0/202 dead transitions. [2024-11-16 23:49:51,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 202 transitions, 773 flow [2024-11-16 23:49:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2024-11-16 23:49:51,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9355555555555556 [2024-11-16 23:49:51,801 INFO L175 Difference]: Start difference. First operand has 164 places, 193 transitions, 673 flow. Second operand 3 states and 421 transitions. [2024-11-16 23:49:51,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 202 transitions, 773 flow [2024-11-16 23:49:51,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 202 transitions, 747 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:51,814 INFO L231 Difference]: Finished difference. Result has 166 places, 200 transitions, 729 flow [2024-11-16 23:49:51,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=729, PETRI_PLACES=166, PETRI_TRANSITIONS=200} [2024-11-16 23:49:51,815 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 16 predicate places. [2024-11-16 23:49:51,815 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 200 transitions, 729 flow [2024-11-16 23:49:51,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:51,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:51,816 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:51,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:49:51,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:51,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1792574589, now seen corresponding path program 1 times [2024-11-16 23:49:51,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:51,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089687500] [2024-11-16 23:49:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:49:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:52,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089687500] [2024-11-16 23:49:52,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089687500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:52,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:52,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:49:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227253641] [2024-11-16 23:49:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:52,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:49:52,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:52,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:49:52,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:49:52,280 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 150 [2024-11-16 23:49:52,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 200 transitions, 729 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:52,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:52,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 150 [2024-11-16 23:49:52,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:53,432 INFO L124 PetriNetUnfolderBase]: 2271/7664 cut-off events. [2024-11-16 23:49:53,433 INFO L125 PetriNetUnfolderBase]: For 2250/9214 co-relation queries the response was YES. [2024-11-16 23:49:53,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16627 conditions, 7664 events. 2271/7664 cut-off events. For 2250/9214 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 78628 event pairs, 543 based on Foata normal form. 241/7200 useless extension candidates. Maximal degree in co-relation 14173. Up to 3742 conditions per place. [2024-11-16 23:49:53,493 INFO L140 encePairwiseOnDemand]: 135/150 looper letters, 64 selfloop transitions, 38 changer transitions 0/239 dead transitions. [2024-11-16 23:49:53,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 239 transitions, 1081 flow [2024-11-16 23:49:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:49:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:49:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 782 transitions. [2024-11-16 23:49:53,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8688888888888889 [2024-11-16 23:49:53,496 INFO L175 Difference]: Start difference. First operand has 166 places, 200 transitions, 729 flow. Second operand 6 states and 782 transitions. [2024-11-16 23:49:53,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 239 transitions, 1081 flow [2024-11-16 23:49:53,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 239 transitions, 1063 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:53,510 INFO L231 Difference]: Finished difference. Result has 174 places, 237 transitions, 1029 flow [2024-11-16 23:49:53,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1029, PETRI_PLACES=174, PETRI_TRANSITIONS=237} [2024-11-16 23:49:53,512 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 24 predicate places. [2024-11-16 23:49:53,512 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 237 transitions, 1029 flow [2024-11-16 23:49:53,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:53,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:53,513 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] [2024-11-16 23:49:53,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:49:53,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:53,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1887010082, now seen corresponding path program 1 times [2024-11-16 23:49:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:53,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242283407] [2024-11-16 23:49:53,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:53,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242283407] [2024-11-16 23:49:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242283407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:53,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:53,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:49:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982849104] [2024-11-16 23:49:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:49:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:53,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:49:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:49:53,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 150 [2024-11-16 23:49:53,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 237 transitions, 1029 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:53,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:53,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 150 [2024-11-16 23:49:53,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:55,987 INFO L124 PetriNetUnfolderBase]: 5049/15353 cut-off events. [2024-11-16 23:49:55,988 INFO L125 PetriNetUnfolderBase]: For 9197/19704 co-relation queries the response was YES. [2024-11-16 23:49:56,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39467 conditions, 15353 events. 5049/15353 cut-off events. For 9197/19704 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 162534 event pairs, 836 based on Foata normal form. 40/14255 useless extension candidates. Maximal degree in co-relation 35439. Up to 6573 conditions per place. [2024-11-16 23:49:56,112 INFO L140 encePairwiseOnDemand]: 131/150 looper letters, 127 selfloop transitions, 118 changer transitions 0/384 dead transitions. [2024-11-16 23:49:56,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 384 transitions, 2377 flow [2024-11-16 23:49:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:49:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:49:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2024-11-16 23:49:56,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2024-11-16 23:49:56,115 INFO L175 Difference]: Start difference. First operand has 174 places, 237 transitions, 1029 flow. Second operand 6 states and 816 transitions. [2024-11-16 23:49:56,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 384 transitions, 2377 flow [2024-11-16 23:49:56,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 384 transitions, 2245 flow, removed 66 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:56,176 INFO L231 Difference]: Finished difference. Result has 183 places, 349 transitions, 2095 flow [2024-11-16 23:49:56,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2095, PETRI_PLACES=183, PETRI_TRANSITIONS=349} [2024-11-16 23:49:56,177 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 33 predicate places. [2024-11-16 23:49:56,177 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 349 transitions, 2095 flow [2024-11-16 23:49:56,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:56,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:56,178 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:56,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:49:56,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:56,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:56,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1263278872, now seen corresponding path program 1 times [2024-11-16 23:49:56,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:56,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073563582] [2024-11-16 23:49:56,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:56,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:49:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073563582] [2024-11-16 23:49:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073563582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:56,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918845070] [2024-11-16 23:49:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:56,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:56,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 150 [2024-11-16 23:49:56,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 349 transitions, 2095 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:56,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:56,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 150 [2024-11-16 23:49:56,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:57,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] threadEXIT-->L1061: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem15#1_8|) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][261], [Black: 194#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 192#true, 213#true, Black: 196#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 158#(= |#race~datas~0| 0), Black: 208#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 205#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 207#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 45#L1048-3true, 126#L1061true, Black: 156#true, Black: 162#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 164#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 165#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 148#true, Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 151#true, 197#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 203#true, Black: 173#(= |ULTIMATE.start_main_~i~0#1| 0), 160#true, Black: 182#true, Black: 189#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-11-16 23:49:57,376 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2024-11-16 23:49:57,377 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:49:57,377 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:49:57,377 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:49:57,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] threadEXIT-->L1061: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem15#1_8|) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][307], [Black: 194#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 192#true, Black: 196#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 158#(= |#race~datas~0| 0), Black: 208#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 205#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 207#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 126#L1061true, Black: 156#true, Black: 162#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), 110#L1048-1true, Black: 164#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 165#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 148#true, Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 151#true, 215#(= |threadThread2of2ForFork0_#t~nondet4| |#race~next_j~0|), 197#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 203#true, Black: 173#(= |ULTIMATE.start_main_~i~0#1| 0), 160#true, Black: 184#(= |#race~next_j~0| 0), Black: 189#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-11-16 23:49:57,451 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-11-16 23:49:57,451 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-16 23:49:57,452 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-16 23:49:57,452 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-16 23:49:57,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([282] L1061-6-->L1061-5: Formula: (= (store |v_#race_10| |v_ULTIMATE.start_main_~tids~0#1.base_8| (store (select |v_#race_10| |v_ULTIMATE.start_main_~tids~0#1.base_8|) (+ (* |v_ULTIMATE.start_main_~i~1#1_10| 4) |v_ULTIMATE.start_main_~tids~0#1.offset_8|) 0)) |v_#race_9|) InVars {#race=|v_#race_10|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_8|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_10|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_8|} OutVars{#race=|v_#race_9|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_8|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_10|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_8|} AuxVars[] AssignedVars[#race][122], [Black: 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 192#true, Black: 196#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 213#true, Black: 197#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 158#(= |#race~datas~0| 0), Black: 208#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 205#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 207#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 194#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 156#true, 99#L1049-1true, Black: 162#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 164#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 165#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 149#true, 203#true, 150#true, Black: 173#(= |ULTIMATE.start_main_~i~0#1| 0), 160#true, Black: 184#(= |#race~next_j~0| 0), 64#L1061-5true, Black: 189#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-11-16 23:49:57,978 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-11-16 23:49:57,978 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-11-16 23:49:57,978 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-11-16 23:49:57,978 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-16 23:49:57,996 INFO L124 PetriNetUnfolderBase]: 3999/13264 cut-off events. [2024-11-16 23:49:57,996 INFO L125 PetriNetUnfolderBase]: For 10408/11681 co-relation queries the response was YES. [2024-11-16 23:49:58,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36666 conditions, 13264 events. 3999/13264 cut-off events. For 10408/11681 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 143864 event pairs, 283 based on Foata normal form. 11/12698 useless extension candidates. Maximal degree in co-relation 32722. Up to 3169 conditions per place. [2024-11-16 23:49:58,104 INFO L140 encePairwiseOnDemand]: 143/150 looper letters, 22 selfloop transitions, 11 changer transitions 0/357 dead transitions. [2024-11-16 23:49:58,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 357 transitions, 2194 flow [2024-11-16 23:49:58,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2024-11-16 23:49:58,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-11-16 23:49:58,106 INFO L175 Difference]: Start difference. First operand has 183 places, 349 transitions, 2095 flow. Second operand 3 states and 420 transitions. [2024-11-16 23:49:58,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 357 transitions, 2194 flow [2024-11-16 23:49:58,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 357 transitions, 2158 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:58,330 INFO L231 Difference]: Finished difference. Result has 187 places, 356 transitions, 2147 flow [2024-11-16 23:49:58,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=2059, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2147, PETRI_PLACES=187, PETRI_TRANSITIONS=356} [2024-11-16 23:49:58,333 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 37 predicate places. [2024-11-16 23:49:58,333 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 356 transitions, 2147 flow [2024-11-16 23:49:58,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:58,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:58,333 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:58,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:49:58,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:49:58,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash 305163062, now seen corresponding path program 1 times [2024-11-16 23:49:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44866786] [2024-11-16 23:49:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:49:58,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:49:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:49:58,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:49:58,381 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:49:58,382 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr4ASSERT_VIOLATIONDATA_RACE (19 of 20 remaining) [2024-11-16 23:49:58,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-16 23:49:58,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-16 23:49:58,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-16 23:49:58,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-16 23:49:58,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 20 remaining) [2024-11-16 23:49:58,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-16 23:49:58,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-16 23:49:58,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-16 23:49:58,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-16 23:49:58,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-16 23:49:58,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-16 23:49:58,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-16 23:49:58,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-16 23:49:58,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-16 23:49:58,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-16 23:49:58,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-16 23:49:58,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-16 23:49:58,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-16 23:49:58,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-16 23:49:58,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:49:58,385 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:58,440 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-16 23:49:58,440 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:49:58,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:49:58 BasicIcfg [2024-11-16 23:49:58,445 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:49:58,446 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:49:58,446 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:49:58,446 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:49:58,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:49:46" (3/4) ... [2024-11-16 23:49:58,449 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 23:49:58,521 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:49:58,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:49:58,521 INFO L158 Benchmark]: Toolchain (without parser) took 13621.27ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 107.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 627.0MB. Max. memory is 16.1GB. [2024-11-16 23:49:58,522 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:49:58,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.90ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 131.2MB in the end (delta: -24.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-16 23:49:58,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.50ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 128.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:49:58,522 INFO L158 Benchmark]: Boogie Preprocessor took 24.42ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 127.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:49:58,523 INFO L158 Benchmark]: IcfgBuilder took 492.95ms. Allocated memory is still 176.2MB. Free memory was 127.1MB in the beginning and 109.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 23:49:58,523 INFO L158 Benchmark]: TraceAbstraction took 12356.96ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 108.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 618.5MB. Max. memory is 16.1GB. [2024-11-16 23:49:58,523 INFO L158 Benchmark]: Witness Printer took 75.16ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 23:49:58,527 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.19ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 622.90ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 131.2MB in the end (delta: -24.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.50ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 128.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.42ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 127.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 492.95ms. Allocated memory is still 176.2MB. Free memory was 127.1MB in the beginning and 109.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12356.96ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 108.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 618.5MB. Max. memory is 16.1GB. * Witness Printer took 75.16ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1047]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int *datas; VAL [datas={0:0}] [L1044] 0 int next_j = 0; VAL [datas={0:0}, next_j=0] [L1053] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, next_j=0, threads_total=2] [L1054] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, next_j=0] [L1054] RET 0 assume_abort_if_not(threads_total >= 0) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, next_j=0, threads_total=2, tids={-2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-3:0}, next_j=0, threads_total=2, tids={-2:0}] [L1057] 0 int i = 0; VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1057] 0 i++ VAL [\old(arg)={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1046] 2 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1046] 1 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1047] 1 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=0] [L1048] 1 next_j++ VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] [L1047] 2 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] Now there is a data race on ~next_j~0 between C: next_j++ [1048] and C: j = next_j [1047] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 146 locations, 15 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.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389 IncrementalHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 62 mSDtfsCounter, 389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=4, InterpolantAutomatonStates: 24, 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.8s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 181 locations, 20 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: 9.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 549 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 287 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 939 IncrementalHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 134 mSDtfsCounter, 939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2147occurred in iteration=9, InterpolantAutomatonStates: 39, 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, 1.0s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 413 ConstructedInterpolants, 0 QuantifiedInterpolants, 788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14/14 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-16 23:49:58,559 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE