./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 3061b6dc 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:03:36,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:03:36,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:03:36,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:03:36,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:03:36,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:03:36,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:03:36,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:03:36,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:03:36,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:03:36,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:03:36,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:03:36,942 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:03:36,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:03:36,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:03:36,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:03:36,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:03:36,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:03:36,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:03:36,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:03:36,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:03:36,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:03:36,950 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:03:36,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:03:36,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:03:36,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:03:36,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:03:36,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:03:36,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:03:36,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:03:36,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:03:36,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:03:36,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:03:36,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:03:36,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:03:36,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:03:36,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:03:36,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:03:36,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:03:36,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:03:36,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:03:36,957 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-19 06:03:37,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:03:37,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:03:37,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:03:37,265 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:03:37,265 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:03:37,266 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-19 06:03:38,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:03:39,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:03:39,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2024-11-19 06:03:39,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1b14169/ce8a954a929047018a8b1bbe5e78a59c/FLAGb735a2662 [2024-11-19 06:03:39,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1b14169/ce8a954a929047018a8b1bbe5e78a59c [2024-11-19 06:03:39,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:03:39,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:03:39,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:03:39,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:03:39,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:03:39,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ec503c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39, skipping insertion in model container [2024-11-19 06:03:39,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:03:39,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:03:39,643 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:03:39,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:03:39,767 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:03:39,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39 WrapperNode [2024-11-19 06:03:39,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:03:39,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:03:39,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:03:39,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:03:39,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,821 INFO L138 Inliner]: procedures = 273, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-19 06:03:39,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:03:39,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:03:39,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:03:39,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:03:39,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:03:39,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:03:39,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:03:39,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:03:39,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (1/1) ... [2024-11-19 06:03:39,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:03:39,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:03:39,919 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-19 06:03:39,923 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-19 06:03:39,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:03:39,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 06:03:39,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 06:03:39,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:03:39,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-19 06:03:39,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-19 06:03:39,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:03:39,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:03:39,978 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 06:03:40,137 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:03:40,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:03:40,348 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:03:40,348 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:03:40,370 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:03:40,371 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:03:40,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:03:40 BoogieIcfgContainer [2024-11-19 06:03:40,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:03:40,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:03:40,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:03:40,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:03:40,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:03:39" (1/3) ... [2024-11-19 06:03:40,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffc2912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:03:40, skipping insertion in model container [2024-11-19 06:03:40,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:39" (2/3) ... [2024-11-19 06:03:40,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffc2912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:03:40, skipping insertion in model container [2024-11-19 06:03:40,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:03:40" (3/3) ... [2024-11-19 06:03:40,381 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race.i [2024-11-19 06:03:40,396 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:03:40,396 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-19 06:03:40,396 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:03:40,469 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 06:03:40,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 112 transitions, 231 flow [2024-11-19 06:03:40,559 INFO L124 PetriNetUnfolderBase]: 6/147 cut-off events. [2024-11-19 06:03:40,559 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 06:03:40,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 147 events. 6/147 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 247 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2024-11-19 06:03:40,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 112 transitions, 231 flow [2024-11-19 06:03:40,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 112 transitions, 231 flow [2024-11-19 06:03:40,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:03:40,589 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;@77aff6e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:03:40,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-19 06:03:40,596 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:03:40,596 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2024-11-19 06:03:40,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:03:40,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:40,598 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-19 06:03:40,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:03:40,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1757414955, now seen corresponding path program 1 times [2024-11-19 06:03:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:40,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843559660] [2024-11-19 06:03:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:40,869 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-19 06:03:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:40,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843559660] [2024-11-19 06:03:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843559660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:40,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067297405] [2024-11-19 06:03:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:40,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:40,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:40,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:40,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2024-11-19 06:03:40,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-19 06:03:40,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:40,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2024-11-19 06:03:40,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:41,017 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2024-11-19 06:03:41,018 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-19 06:03:41,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 151 events. 3/151 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 296 event pairs, 2 based on Foata normal form. 7/140 useless extension candidates. Maximal degree in co-relation 90. Up to 15 conditions per place. [2024-11-19 06:03:41,023 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 8 selfloop transitions, 2 changer transitions 1/108 dead transitions. [2024-11-19 06:03:41,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 243 flow [2024-11-19 06:03:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2024-11-19 06:03:41,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2024-11-19 06:03:41,041 INFO L175 Difference]: Start difference. First operand has 111 places, 112 transitions, 231 flow. Second operand 3 states and 308 transitions. [2024-11-19 06:03:41,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 243 flow [2024-11-19 06:03:41,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:41,053 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 225 flow [2024-11-19 06:03:41,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2024-11-19 06:03:41,062 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2024-11-19 06:03:41,062 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 225 flow [2024-11-19 06:03:41,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-19 06:03:41,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:41,063 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] [2024-11-19 06:03:41,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:03:41,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:03:41,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash -806940075, now seen corresponding path program 1 times [2024-11-19 06:03:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:41,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222083658] [2024-11-19 06:03:41,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:41,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:41,190 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-19 06:03:41,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222083658] [2024-11-19 06:03:41,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222083658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:41,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:41,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559614793] [2024-11-19 06:03:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:41,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:41,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2024-11-19 06:03:41,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-19 06:03:41,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:41,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2024-11-19 06:03:41,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:41,268 INFO L124 PetriNetUnfolderBase]: 5/190 cut-off events. [2024-11-19 06:03:41,268 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 06:03:41,269 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 8. Compared 407 event pairs, 2 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 184. Up to 16 conditions per place. [2024-11-19 06:03:41,269 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 7 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-11-19 06:03:41,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 243 flow [2024-11-19 06:03:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2024-11-19 06:03:41,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9255952380952381 [2024-11-19 06:03:41,276 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 225 flow. Second operand 3 states and 311 transitions. [2024-11-19 06:03:41,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 243 flow [2024-11-19 06:03:41,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:41,282 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 231 flow [2024-11-19 06:03:41,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2024-11-19 06:03:41,284 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -1 predicate places. [2024-11-19 06:03:41,284 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 231 flow [2024-11-19 06:03:41,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-19 06:03:41,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:41,285 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-19 06:03:41,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:03:41,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:03:41,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1122336323, now seen corresponding path program 1 times [2024-11-19 06:03:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:41,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620679625] [2024-11-19 06:03:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:41,879 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-19 06:03:41,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:41,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620679625] [2024-11-19 06:03:41,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620679625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:41,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:41,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341951871] [2024-11-19 06:03:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:41,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:03:41,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:41,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:03:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:03:42,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2024-11-19 06:03:42,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-19 06:03:42,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:42,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2024-11-19 06:03:42,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:42,240 INFO L124 PetriNetUnfolderBase]: 73/418 cut-off events. [2024-11-19 06:03:42,241 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 06:03:42,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 418 events. 73/418 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1943 event pairs, 35 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 516. Up to 159 conditions per place. [2024-11-19 06:03:42,250 INFO L140 encePairwiseOnDemand]: 101/112 looper letters, 23 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2024-11-19 06:03:42,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 128 transitions, 363 flow [2024-11-19 06:03:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2024-11-19 06:03:42,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8273809523809523 [2024-11-19 06:03:42,258 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 231 flow. Second operand 6 states and 556 transitions. [2024-11-19 06:03:42,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 128 transitions, 363 flow [2024-11-19 06:03:42,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 128 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:42,263 INFO L231 Difference]: Finished difference. Result has 120 places, 128 transitions, 381 flow [2024-11-19 06:03:42,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=120, PETRI_TRANSITIONS=128} [2024-11-19 06:03:42,266 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2024-11-19 06:03:42,266 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 128 transitions, 381 flow [2024-11-19 06:03:42,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-19 06:03:42,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:42,267 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-19 06:03:42,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:03:42,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:03:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1345351484, now seen corresponding path program 1 times [2024-11-19 06:03:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596053620] [2024-11-19 06:03:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:42,377 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-19 06:03:42,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:42,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596053620] [2024-11-19 06:03:42,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596053620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:42,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:42,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718632560] [2024-11-19 06:03:42,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:42,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:03:42,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:42,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:03:42,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:03:42,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 112 [2024-11-19 06:03:42,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 128 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-19 06:03:42,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:42,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 112 [2024-11-19 06:03:42,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:42,545 INFO L124 PetriNetUnfolderBase]: 34/281 cut-off events. [2024-11-19 06:03:42,545 INFO L125 PetriNetUnfolderBase]: For 29/44 co-relation queries the response was YES. [2024-11-19 06:03:42,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 281 events. 34/281 cut-off events. For 29/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 926 event pairs, 0 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 356. Up to 49 conditions per place. [2024-11-19 06:03:42,548 INFO L140 encePairwiseOnDemand]: 104/112 looper letters, 11 selfloop transitions, 2 changer transitions 5/133 dead transitions. [2024-11-19 06:03:42,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 427 flow [2024-11-19 06:03:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2024-11-19 06:03:42,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8854166666666666 [2024-11-19 06:03:42,553 INFO L175 Difference]: Start difference. First operand has 120 places, 128 transitions, 381 flow. Second operand 6 states and 595 transitions. [2024-11-19 06:03:42,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 427 flow [2024-11-19 06:03:42,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 427 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:42,561 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 399 flow [2024-11-19 06:03:42,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=120, 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=6, PETRI_FLOW=399, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2024-11-19 06:03:42,564 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 18 predicate places. [2024-11-19 06:03:42,565 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 399 flow [2024-11-19 06:03:42,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-19 06:03:42,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:42,566 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:42,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:03:42,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:03:42,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1255025239, now seen corresponding path program 1 times [2024-11-19 06:03:42,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:42,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477519072] [2024-11-19 06:03:42,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:42,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:42,625 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-19 06:03:42,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:42,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477519072] [2024-11-19 06:03:42,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477519072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:42,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:42,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:42,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904059132] [2024-11-19 06:03:42,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:42,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:42,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:42,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:42,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:42,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2024-11-19 06:03:42,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-19 06:03:42,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:42,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2024-11-19 06:03:42,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:42,690 INFO L124 PetriNetUnfolderBase]: 33/267 cut-off events. [2024-11-19 06:03:42,691 INFO L125 PetriNetUnfolderBase]: For 30/39 co-relation queries the response was YES. [2024-11-19 06:03:42,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 267 events. 33/267 cut-off events. For 30/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 888 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 371. Up to 49 conditions per place. [2024-11-19 06:03:42,693 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 5 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-11-19 06:03:42,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 409 flow [2024-11-19 06:03:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-11-19 06:03:42,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9196428571428571 [2024-11-19 06:03:42,695 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 399 flow. Second operand 3 states and 309 transitions. [2024-11-19 06:03:42,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 409 flow [2024-11-19 06:03:42,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 126 transitions, 395 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-19 06:03:42,700 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 385 flow [2024-11-19 06:03:42,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2024-11-19 06:03:42,702 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2024-11-19 06:03:42,702 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 385 flow [2024-11-19 06:03:42,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-19 06:03:42,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:42,703 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:42,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:03:42,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:03:42,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:42,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2061779004, now seen corresponding path program 1 times [2024-11-19 06:03:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:42,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326995003] [2024-11-19 06:03:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:42,744 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-19 06:03:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326995003] [2024-11-19 06:03:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326995003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:42,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251132623] [2024-11-19 06:03:42,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:42,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2024-11-19 06:03:42,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-19 06:03:42,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:42,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2024-11-19 06:03:42,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:42,806 INFO L124 PetriNetUnfolderBase]: 33/266 cut-off events. [2024-11-19 06:03:42,807 INFO L125 PetriNetUnfolderBase]: For 30/39 co-relation queries the response was YES. [2024-11-19 06:03:42,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 266 events. 33/266 cut-off events. For 30/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 883 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 370. Up to 49 conditions per place. [2024-11-19 06:03:42,809 INFO L140 encePairwiseOnDemand]: 109/112 looper letters, 6 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-11-19 06:03:42,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 125 transitions, 399 flow [2024-11-19 06:03:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-11-19 06:03:42,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9196428571428571 [2024-11-19 06:03:42,811 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 385 flow. Second operand 3 states and 309 transitions. [2024-11-19 06:03:42,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 125 transitions, 399 flow [2024-11-19 06:03:42,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:42,815 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 383 flow [2024-11-19 06:03:42,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2024-11-19 06:03:42,817 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2024-11-19 06:03:42,818 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 383 flow [2024-11-19 06:03:42,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-19 06:03:42,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:42,819 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] [2024-11-19 06:03:42,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:03:42,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:03:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash 959140595, now seen corresponding path program 1 times [2024-11-19 06:03:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:42,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223156262] [2024-11-19 06:03:42,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:03:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223156262] [2024-11-19 06:03:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223156262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:43,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:43,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981522606] [2024-11-19 06:03:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:43,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:03:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:03:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:03:43,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2024-11-19 06:03:43,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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-19 06:03:43,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:43,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2024-11-19 06:03:43,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:43,403 INFO L124 PetriNetUnfolderBase]: 81/424 cut-off events. [2024-11-19 06:03:43,403 INFO L125 PetriNetUnfolderBase]: For 87/177 co-relation queries the response was YES. [2024-11-19 06:03:43,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 424 events. 81/424 cut-off events. For 87/177 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2071 event pairs, 15 based on Foata normal form. 16/410 useless extension candidates. Maximal degree in co-relation 774. Up to 173 conditions per place. [2024-11-19 06:03:43,407 INFO L140 encePairwiseOnDemand]: 101/112 looper letters, 38 selfloop transitions, 21 changer transitions 7/147 dead transitions. [2024-11-19 06:03:43,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 147 transitions, 588 flow [2024-11-19 06:03:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2024-11-19 06:03:43,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84375 [2024-11-19 06:03:43,410 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 383 flow. Second operand 6 states and 567 transitions. [2024-11-19 06:03:43,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 147 transitions, 588 flow [2024-11-19 06:03:43,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 147 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:43,416 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 540 flow [2024-11-19 06:03:43,416 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2024-11-19 06:03:43,417 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 17 predicate places. [2024-11-19 06:03:43,417 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 540 flow [2024-11-19 06:03:43,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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-19 06:03:43,418 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:43,418 INFO L204 CegarLoopForPetriNet]: trace histogram [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-19 06:03:43,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:03:43,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:03:43,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1142501627, now seen corresponding path program 1 times [2024-11-19 06:03:43,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:43,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089014987] [2024-11-19 06:03:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:43,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:03:43,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:03:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:03:43,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:03:43,505 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:03:43,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-11-19 06:03:43,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-19 06:03:43,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-19 06:03:43,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-19 06:03:43,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-19 06:03:43,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-19 06:03:43,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-19 06:03:43,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-19 06:03:43,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-19 06:03:43,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-19 06:03:43,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-19 06:03:43,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-19 06:03:43,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-19 06:03:43,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-19 06:03:43,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-19 06:03:43,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:03:43,512 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:43,515 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:03:43,516 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 06:03:43,550 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 06:03:43,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 148 transitions, 312 flow [2024-11-19 06:03:43,587 INFO L124 PetriNetUnfolderBase]: 11/254 cut-off events. [2024-11-19 06:03:43,588 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-19 06:03:43,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 254 events. 11/254 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 582 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2024-11-19 06:03:43,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 148 transitions, 312 flow [2024-11-19 06:03:43,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 148 transitions, 312 flow [2024-11-19 06:03:43,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:03:43,595 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;@77aff6e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:03:43,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-19 06:03:43,598 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:03:43,598 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2024-11-19 06:03:43,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:03:43,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:43,599 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-19 06:03:43,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:43,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1166251989, now seen corresponding path program 1 times [2024-11-19 06:03:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:43,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337085723] [2024-11-19 06:03:43,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:43,625 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-19 06:03:43,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337085723] [2024-11-19 06:03:43,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337085723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:43,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:43,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:43,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119977690] [2024-11-19 06:03:43,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:43,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:43,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:43,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:43,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-11-19 06:03:43,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 148 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-19 06:03:43,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:43,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-11-19 06:03:43,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:43,712 INFO L124 PetriNetUnfolderBase]: 19/420 cut-off events. [2024-11-19 06:03:43,713 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-19 06:03:43,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 420 events. 19/420 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1715 event pairs, 16 based on Foata normal form. 17/386 useless extension candidates. Maximal degree in co-relation 291. Up to 50 conditions per place. [2024-11-19 06:03:43,717 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 11 selfloop transitions, 2 changer transitions 1/144 dead transitions. [2024-11-19 06:03:43,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 330 flow [2024-11-19 06:03:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-11-19 06:03:43,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9234234234234234 [2024-11-19 06:03:43,719 INFO L175 Difference]: Start difference. First operand has 148 places, 148 transitions, 312 flow. Second operand 3 states and 410 transitions. [2024-11-19 06:03:43,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 330 flow [2024-11-19 06:03:43,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:43,723 INFO L231 Difference]: Finished difference. Result has 149 places, 143 transitions, 306 flow [2024-11-19 06:03:43,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2024-11-19 06:03:43,724 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 1 predicate places. [2024-11-19 06:03:43,725 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 306 flow [2024-11-19 06:03:43,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-19 06:03:43,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:43,725 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] [2024-11-19 06:03:43,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:03:43,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:43,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash -61724567, now seen corresponding path program 1 times [2024-11-19 06:03:43,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:43,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86397216] [2024-11-19 06:03:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:43,753 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-19 06:03:43,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:43,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86397216] [2024-11-19 06:03:43,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86397216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:43,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:43,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852950001] [2024-11-19 06:03:43,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:43,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:43,770 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-11-19 06:03:43,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-19 06:03:43,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:43,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-11-19 06:03:43,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:43,860 INFO L124 PetriNetUnfolderBase]: 48/667 cut-off events. [2024-11-19 06:03:43,860 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 06:03:43,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 667 events. 48/667 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3460 event pairs, 27 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 760. Up to 97 conditions per place. [2024-11-19 06:03:43,865 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 12 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2024-11-19 06:03:43,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 343 flow [2024-11-19 06:03:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2024-11-19 06:03:43,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9256756756756757 [2024-11-19 06:03:43,868 INFO L175 Difference]: Start difference. First operand has 149 places, 143 transitions, 306 flow. Second operand 3 states and 411 transitions. [2024-11-19 06:03:43,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 343 flow [2024-11-19 06:03:43,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 144 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:43,871 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 317 flow [2024-11-19 06:03:43,871 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2024-11-19 06:03:43,872 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, -2 predicate places. [2024-11-19 06:03:43,872 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 317 flow [2024-11-19 06:03:43,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-19 06:03:43,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:43,873 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-19 06:03:43,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:03:43,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:43,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash 14905815, now seen corresponding path program 1 times [2024-11-19 06:03:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:43,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825035478] [2024-11-19 06:03:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:44,127 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-19 06:03:44,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:44,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825035478] [2024-11-19 06:03:44,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825035478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:44,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:44,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:44,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426289118] [2024-11-19 06:03:44,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:44,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:03:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:44,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:03:44,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:03:44,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 148 [2024-11-19 06:03:44,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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-19 06:03:44,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:44,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 148 [2024-11-19 06:03:44,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:44,806 INFO L124 PetriNetUnfolderBase]: 1014/3225 cut-off events. [2024-11-19 06:03:44,806 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-19 06:03:44,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5114 conditions, 3225 events. 1014/3225 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 25955 event pairs, 586 based on Foata normal form. 0/2825 useless extension candidates. Maximal degree in co-relation 4166. Up to 1589 conditions per place. [2024-11-19 06:03:44,830 INFO L140 encePairwiseOnDemand]: 133/148 looper letters, 30 selfloop transitions, 38 changer transitions 0/181 dead transitions. [2024-11-19 06:03:44,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 181 transitions, 534 flow [2024-11-19 06:03:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2024-11-19 06:03:44,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8547297297297297 [2024-11-19 06:03:44,833 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 317 flow. Second operand 6 states and 759 transitions. [2024-11-19 06:03:44,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 181 transitions, 534 flow [2024-11-19 06:03:44,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 181 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:44,837 INFO L231 Difference]: Finished difference. Result has 156 places, 180 transitions, 571 flow [2024-11-19 06:03:44,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=156, PETRI_TRANSITIONS=180} [2024-11-19 06:03:44,838 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 8 predicate places. [2024-11-19 06:03:44,839 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 180 transitions, 571 flow [2024-11-19 06:03:44,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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-19 06:03:44,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:44,839 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-19 06:03:44,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:03:44,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:44,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1842185304, now seen corresponding path program 1 times [2024-11-19 06:03:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:44,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660515841] [2024-11-19 06:03:44,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:44,908 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-19 06:03:44,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660515841] [2024-11-19 06:03:44,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660515841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:44,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:44,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:44,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313028032] [2024-11-19 06:03:44,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:03:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:44,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:03:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:03:45,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 148 [2024-11-19 06:03:45,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 180 transitions, 571 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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-19 06:03:45,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:45,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 148 [2024-11-19 06:03:45,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:45,283 INFO L124 PetriNetUnfolderBase]: 436/1802 cut-off events. [2024-11-19 06:03:45,283 INFO L125 PetriNetUnfolderBase]: For 382/609 co-relation queries the response was YES. [2024-11-19 06:03:45,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 1802 events. 436/1802 cut-off events. For 382/609 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 12682 event pairs, 135 based on Foata normal form. 2/1653 useless extension candidates. Maximal degree in co-relation 2673. Up to 612 conditions per place. [2024-11-19 06:03:45,301 INFO L140 encePairwiseOnDemand]: 140/148 looper letters, 14 selfloop transitions, 2 changer transitions 5/186 dead transitions. [2024-11-19 06:03:45,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 186 transitions, 625 flow [2024-11-19 06:03:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2024-11-19 06:03:45,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9031531531531531 [2024-11-19 06:03:45,305 INFO L175 Difference]: Start difference. First operand has 156 places, 180 transitions, 571 flow. Second operand 6 states and 802 transitions. [2024-11-19 06:03:45,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 186 transitions, 625 flow [2024-11-19 06:03:45,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 186 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:45,312 INFO L231 Difference]: Finished difference. Result has 165 places, 181 transitions, 593 flow [2024-11-19 06:03:45,312 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=165, PETRI_TRANSITIONS=181} [2024-11-19 06:03:45,314 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 17 predicate places. [2024-11-19 06:03:45,314 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 181 transitions, 593 flow [2024-11-19 06:03:45,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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-19 06:03:45,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:45,315 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:45,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:03:45,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:45,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1936166393, now seen corresponding path program 1 times [2024-11-19 06:03:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150257389] [2024-11-19 06:03:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:45,356 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-19 06:03:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150257389] [2024-11-19 06:03:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150257389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:45,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:45,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057223533] [2024-11-19 06:03:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:45,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:45,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 148 [2024-11-19 06:03:45,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 181 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-19 06:03:45,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:45,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 148 [2024-11-19 06:03:45,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:45,864 INFO L124 PetriNetUnfolderBase]: 716/3519 cut-off events. [2024-11-19 06:03:45,864 INFO L125 PetriNetUnfolderBase]: For 681/878 co-relation queries the response was YES. [2024-11-19 06:03:45,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 3519 events. 716/3519 cut-off events. For 681/878 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 33250 event pairs, 150 based on Foata normal form. 0/3261 useless extension candidates. Maximal degree in co-relation 6208. Up to 1046 conditions per place. [2024-11-19 06:03:45,895 INFO L140 encePairwiseOnDemand]: 134/148 looper letters, 21 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2024-11-19 06:03:45,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 194 transitions, 692 flow [2024-11-19 06:03:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-19 06:03:45,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-11-19 06:03:45,897 INFO L175 Difference]: Start difference. First operand has 165 places, 181 transitions, 593 flow. Second operand 3 states and 416 transitions. [2024-11-19 06:03:45,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 194 transitions, 692 flow [2024-11-19 06:03:45,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 194 transitions, 680 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 06:03:45,908 INFO L231 Difference]: Finished difference. Result has 162 places, 191 transitions, 669 flow [2024-11-19 06:03:45,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=162, PETRI_TRANSITIONS=191} [2024-11-19 06:03:45,909 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 14 predicate places. [2024-11-19 06:03:45,909 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 191 transitions, 669 flow [2024-11-19 06:03:45,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-19 06:03:45,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:45,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:45,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:03:45,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:45,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash -319198242, now seen corresponding path program 1 times [2024-11-19 06:03:45,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:45,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721566756] [2024-11-19 06:03:45,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:45,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:03:45,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721566756] [2024-11-19 06:03:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721566756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373282321] [2024-11-19 06:03:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:45,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:45,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:45,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:45,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-11-19 06:03:45,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 191 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-19 06:03:45,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:45,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-11-19 06:03:45,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:46,554 INFO L124 PetriNetUnfolderBase]: 810/4027 cut-off events. [2024-11-19 06:03:46,555 INFO L125 PetriNetUnfolderBase]: For 910/1103 co-relation queries the response was YES. [2024-11-19 06:03:46,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7300 conditions, 4027 events. 810/4027 cut-off events. For 910/1103 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 39368 event pairs, 164 based on Foata normal form. 5/3738 useless extension candidates. Maximal degree in co-relation 6319. Up to 1186 conditions per place. [2024-11-19 06:03:46,597 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 20 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2024-11-19 06:03:46,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 200 transitions, 769 flow [2024-11-19 06:03:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2024-11-19 06:03:46,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9346846846846847 [2024-11-19 06:03:46,599 INFO L175 Difference]: Start difference. First operand has 162 places, 191 transitions, 669 flow. Second operand 3 states and 415 transitions. [2024-11-19 06:03:46,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 200 transitions, 769 flow [2024-11-19 06:03:46,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 200 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:46,613 INFO L231 Difference]: Finished difference. Result has 164 places, 198 transitions, 725 flow [2024-11-19 06:03:46,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=164, PETRI_TRANSITIONS=198} [2024-11-19 06:03:46,614 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 16 predicate places. [2024-11-19 06:03:46,615 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 198 transitions, 725 flow [2024-11-19 06:03:46,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-19 06:03:46,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:46,615 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] [2024-11-19 06:03:46,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:03:46,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1875307, now seen corresponding path program 1 times [2024-11-19 06:03:46,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:46,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846250035] [2024-11-19 06:03:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:03:46,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846250035] [2024-11-19 06:03:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846250035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:46,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:46,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66927455] [2024-11-19 06:03:46,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:46,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:03:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:03:46,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:03:47,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-11-19 06:03:47,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 198 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-19 06:03:47,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:47,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-11-19 06:03:47,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:48,325 INFO L124 PetriNetUnfolderBase]: 2243/7607 cut-off events. [2024-11-19 06:03:48,325 INFO L125 PetriNetUnfolderBase]: For 2377/8107 co-relation queries the response was YES. [2024-11-19 06:03:48,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16481 conditions, 7607 events. 2243/7607 cut-off events. For 2377/8107 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 78106 event pairs, 601 based on Foata normal form. 241/7172 useless extension candidates. Maximal degree in co-relation 14233. Up to 3716 conditions per place. [2024-11-19 06:03:48,402 INFO L140 encePairwiseOnDemand]: 133/148 looper letters, 64 selfloop transitions, 38 changer transitions 0/237 dead transitions. [2024-11-19 06:03:48,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 237 transitions, 1077 flow [2024-11-19 06:03:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2024-11-19 06:03:48,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8671171171171171 [2024-11-19 06:03:48,405 INFO L175 Difference]: Start difference. First operand has 164 places, 198 transitions, 725 flow. Second operand 6 states and 770 transitions. [2024-11-19 06:03:48,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 237 transitions, 1077 flow [2024-11-19 06:03:48,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 237 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:48,423 INFO L231 Difference]: Finished difference. Result has 172 places, 235 transitions, 1025 flow [2024-11-19 06:03:48,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1025, PETRI_PLACES=172, PETRI_TRANSITIONS=235} [2024-11-19 06:03:48,425 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 24 predicate places. [2024-11-19 06:03:48,426 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 235 transitions, 1025 flow [2024-11-19 06:03:48,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-19 06:03:48,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:48,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:48,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:03:48,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:48,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1395823936, now seen corresponding path program 1 times [2024-11-19 06:03:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:48,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689863981] [2024-11-19 06:03:48,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:48,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:48,882 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-19 06:03:48,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:48,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689863981] [2024-11-19 06:03:48,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689863981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:48,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:48,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:48,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119187969] [2024-11-19 06:03:48,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:48,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:03:48,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:48,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:03:48,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:03:49,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-11-19 06:03:49,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 235 transitions, 1025 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-19 06:03:49,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:49,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-11-19 06:03:49,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:51,223 INFO L124 PetriNetUnfolderBase]: 5040/15273 cut-off events. [2024-11-19 06:03:51,223 INFO L125 PetriNetUnfolderBase]: For 9427/22602 co-relation queries the response was YES. [2024-11-19 06:03:51,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39368 conditions, 15273 events. 5040/15273 cut-off events. For 9427/22602 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 161271 event pairs, 840 based on Foata normal form. 40/14177 useless extension candidates. Maximal degree in co-relation 35374. Up to 6568 conditions per place. [2024-11-19 06:03:51,382 INFO L140 encePairwiseOnDemand]: 129/148 looper letters, 127 selfloop transitions, 118 changer transitions 0/382 dead transitions. [2024-11-19 06:03:51,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 382 transitions, 2373 flow [2024-11-19 06:03:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 804 transitions. [2024-11-19 06:03:51,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2024-11-19 06:03:51,385 INFO L175 Difference]: Start difference. First operand has 172 places, 235 transitions, 1025 flow. Second operand 6 states and 804 transitions. [2024-11-19 06:03:51,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 382 transitions, 2373 flow [2024-11-19 06:03:51,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 382 transitions, 2241 flow, removed 66 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:51,458 INFO L231 Difference]: Finished difference. Result has 181 places, 347 transitions, 2091 flow [2024-11-19 06:03:51,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2091, PETRI_PLACES=181, PETRI_TRANSITIONS=347} [2024-11-19 06:03:51,460 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 33 predicate places. [2024-11-19 06:03:51,461 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 347 transitions, 2091 flow [2024-11-19 06:03:51,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-19 06:03:51,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:51,462 INFO L204 CegarLoopForPetriNet]: trace histogram [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-19 06:03:51,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:03:51,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:51,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash 930580674, now seen corresponding path program 1 times [2024-11-19 06:03:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:51,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596756881] [2024-11-19 06:03:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:03:51,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:51,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596756881] [2024-11-19 06:03:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596756881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:51,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175360003] [2024-11-19 06:03:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:51,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:51,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:51,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:51,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-11-19 06:03:51,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 347 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:51,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:51,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-11-19 06:03:51,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:52,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] threadEXIT-->L1061-7: 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[][258], [201#true, Black: 194#(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)), Black: 193#(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: 190#true, Black: 192#(= (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), 87#L1061-7true, Black: 205#(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)))), 158#true, 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) (+ 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)))), 211#true, Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(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)))), 156#(= |#race~datas~0| 0), Black: 154#true, Black: 161#(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|)), Black: 162#(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: 160#(= |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: 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| 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|)), 53#L1048-5true, 149#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 146#true, 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) 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)), Black: 180#true, Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-11-19 06:03:52,857 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-19 06:03:52,857 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-19 06:03:52,857 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-19 06:03:52,857 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-19 06:03:52,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] threadEXIT-->L1061-7: 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[][298], [201#true, Black: 194#(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)), Black: 193#(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: 190#true, Black: 192#(= (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), 213#(= |threadThread2of2ForFork0_#t~nondet4| |#race~next_j~0|), 133#L1048-7true, 87#L1061-7true, Black: 205#(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)))), 158#true, 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) (+ 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: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(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)))), 156#(= |#race~datas~0| 0), Black: 154#true, Black: 161#(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|)), Black: 162#(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: 160#(= |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: 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| 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|)), 149#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 146#true, 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) 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)), Black: 182#(= |#race~next_j~0| 0), Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-11-19 06:03:52,903 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-19 06:03:52,903 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-19 06:03:52,904 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-19 06:03:52,904 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-19 06:03:53,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L1061-1-->L1061-2: Formula: (= (store |v_#race_12| |v_ULTIMATE.start_main_~tids~0#1.base_11| (store (select |v_#race_12| |v_ULTIMATE.start_main_~tids~0#1.base_11|) (+ (* |v_ULTIMATE.start_main_~i~1#1_6| 4) |v_ULTIMATE.start_main_~tids~0#1.offset_11|) 0)) |v_#race_11|) InVars {#race=|v_#race_12|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_11|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_6|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_11|} OutVars{#race=|v_#race_11|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_11|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_6|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_11|} AuxVars[] AssignedVars[#race][122], [201#true, Black: 194#(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)), Black: 193#(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: 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) 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)), Black: 190#true, 192#(= (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: 205#(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)))), 158#true, 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) (+ 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)))), 211#true, Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(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)))), 147#true, 156#(= |#race~datas~0| 0), 90#L1049-11true, Black: 154#true, Black: 161#(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|)), Black: 162#(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: 160#(= |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: 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| 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: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 17#L1061-2true, Black: 182#(= |#race~next_j~0| 0), Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-11-19 06:03:53,435 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-11-19 06:03:53,435 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-19 06:03:53,435 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-19 06:03:53,435 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-19 06:03:53,461 INFO L124 PetriNetUnfolderBase]: 3866/13161 cut-off events. [2024-11-19 06:03:53,462 INFO L125 PetriNetUnfolderBase]: For 10154/11349 co-relation queries the response was YES. [2024-11-19 06:03:53,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36269 conditions, 13161 events. 3866/13161 cut-off events. For 10154/11349 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 144583 event pairs, 307 based on Foata normal form. 11/12573 useless extension candidates. Maximal degree in co-relation 32371. Up to 3169 conditions per place. [2024-11-19 06:03:53,618 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 22 selfloop transitions, 11 changer transitions 0/355 dead transitions. [2024-11-19 06:03:53,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 355 transitions, 2190 flow [2024-11-19 06:03:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-19 06:03:53,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9324324324324325 [2024-11-19 06:03:53,620 INFO L175 Difference]: Start difference. First operand has 181 places, 347 transitions, 2091 flow. Second operand 3 states and 414 transitions. [2024-11-19 06:03:53,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 355 transitions, 2190 flow [2024-11-19 06:03:54,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 355 transitions, 2154 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:54,029 INFO L231 Difference]: Finished difference. Result has 185 places, 354 transitions, 2143 flow [2024-11-19 06:03:54,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=185, PETRI_TRANSITIONS=354} [2024-11-19 06:03:54,030 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 37 predicate places. [2024-11-19 06:03:54,030 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 354 transitions, 2143 flow [2024-11-19 06:03:54,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:54,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:54,031 INFO L204 CegarLoopForPetriNet]: trace histogram [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-19 06:03:54,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:03:54,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 06:03:54,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash 957147819, now seen corresponding path program 1 times [2024-11-19 06:03:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:54,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816052911] [2024-11-19 06:03:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:03:54,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:03:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:03:54,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:03:54,083 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:03:54,083 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (19 of 20 remaining) [2024-11-19 06:03:54,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-19 06:03:54,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-19 06:03:54,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-19 06:03:54,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-19 06:03:54,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 20 remaining) [2024-11-19 06:03:54,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-19 06:03:54,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-19 06:03:54,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-19 06:03:54,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-19 06:03:54,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-19 06:03:54,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-19 06:03:54,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-19 06:03:54,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-19 06:03:54,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-19 06:03:54,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-19 06:03:54,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-19 06:03:54,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-19 06:03:54,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-19 06:03:54,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-19 06:03:54,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:03:54,085 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:54,162 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-19 06:03:54,162 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:03:54,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:03:54 BasicIcfg [2024-11-19 06:03:54,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:03:54,169 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:03:54,169 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:03:54,170 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:03:54,171 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:03:40" (3/4) ... [2024-11-19 06:03:54,172 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 06:03:54,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:03:54,250 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:03:54,250 INFO L158 Benchmark]: Toolchain (without parser) took 15192.80ms. Allocated memory was 159.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 121.2MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 363.6MB. Max. memory is 16.1GB. [2024-11-19 06:03:54,251 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 107.0MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:03:54,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.47ms. Allocated memory is still 159.4MB. Free memory was 121.2MB in the beginning and 88.9MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 06:03:54,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.25ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 85.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:03:54,252 INFO L158 Benchmark]: Boogie Preprocessor took 35.21ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:03:54,252 INFO L158 Benchmark]: RCFGBuilder took 511.63ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 115.4MB in the end (delta: -30.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 06:03:54,252 INFO L158 Benchmark]: TraceAbstraction took 13794.40ms. Allocated memory was 159.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 114.4MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 349.2MB. Max. memory is 16.1GB. [2024-11-19 06:03:54,253 INFO L158 Benchmark]: Witness Printer took 80.57ms. Allocated memory is still 3.3GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 06:03:54,257 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.22ms. Allocated memory is still 107.0MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.47ms. Allocated memory is still 159.4MB. Free memory was 121.2MB in the beginning and 88.9MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.25ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 85.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.21ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 511.63ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 115.4MB in the end (delta: -30.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13794.40ms. Allocated memory was 159.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 114.4MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 349.2MB. Max. memory is 16.1GB. * Witness Printer took 80.57ms. Allocated memory is still 3.3GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 9.4MB). 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, 144 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: 3.0s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 29 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=7, InterpolantAutomatonStates: 30, 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.2s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 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, 179 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: 10.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 512 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 962 IncrementalHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 59 mSDtfsCounter, 962 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=2143occurred 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.1s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 12/12 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-19 06:03:54,298 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