./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f 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/goblint-regression/09-regions_05-ptra_rc.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 b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:29:54,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:29:54,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:29:54,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:29:54,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:29:54,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:29:54,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:29:54,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:29:54,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:29:54,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:29:54,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:29:54,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:29:54,264 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:29:54,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:29:54,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:29:54,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:29:54,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:29:54,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:29:54,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:29:54,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:29:54,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:29:54,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:29:54,271 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:29:54,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:29:54,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:29:54,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:29:54,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:29:54,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:29:54,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:29:54,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:29:54,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:29:54,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:29:54,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:29:54,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:29:54,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:29:54,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:29:54,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:29:54,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:29:54,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:29:54,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:29:54,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:29:54,275 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 -> b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 [2024-11-12 12:29:54,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:29:54,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:29:54,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:29:54,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:29:54,581 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:29:54,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2024-11-12 12:29:55,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:29:56,342 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:29:56,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2024-11-12 12:29:56,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f93f57ce/03f01560c62c486191ccf3bc0d6b2cb2/FLAGa10d8caac [2024-11-12 12:29:56,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f93f57ce/03f01560c62c486191ccf3bc0d6b2cb2 [2024-11-12 12:29:56,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:29:56,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:29:56,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:29:56,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:29:56,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:29:56,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:29:56" (1/1) ... [2024-11-12 12:29:56,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@994e45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:56, skipping insertion in model container [2024-11-12 12:29:56,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:29:56" (1/1) ... [2024-11-12 12:29:56,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:29:56,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:29:57,001 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:29:57,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:29:57,145 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:29:57,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57 WrapperNode [2024-11-12 12:29:57,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:29:57,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:29:57,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:29:57,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:29:57,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,221 INFO L138 Inliner]: procedures = 368, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 207 [2024-11-12 12:29:57,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:29:57,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:29:57,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:29:57,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:29:57,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:29:57,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:29:57,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:29:57,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:29:57,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (1/1) ... [2024-11-12 12:29:57,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:29:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:29:57,331 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-12 12:29:57,334 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-12 12:29:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-12 12:29:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:29:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:29:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:29:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:29:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:29:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:29:57,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-12 12:29:57,384 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 12:29:57,384 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 12:29:57,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:29:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:29:57,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:29:57,386 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:29:57,544 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:29:57,546 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:29:57,983 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:29:57,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:29:58,026 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:29:58,029 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 12:29:58,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:29:58 BoogieIcfgContainer [2024-11-12 12:29:58,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:29:58,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:29:58,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:29:58,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:29:58,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:29:56" (1/3) ... [2024-11-12 12:29:58,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5775ba28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:29:58, skipping insertion in model container [2024-11-12 12:29:58,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:29:57" (2/3) ... [2024-11-12 12:29:58,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5775ba28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:29:58, skipping insertion in model container [2024-11-12 12:29:58,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:29:58" (3/3) ... [2024-11-12 12:29:58,039 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_05-ptra_rc.i [2024-11-12 12:29:58,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:29:58,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-12 12:29:58,056 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:29:58,161 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 12:29:58,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 240 transitions, 484 flow [2024-11-12 12:29:58,287 INFO L124 PetriNetUnfolderBase]: 0/239 cut-off events. [2024-11-12 12:29:58,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:29:58,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 239 events. 0/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-12 12:29:58,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 240 transitions, 484 flow [2024-11-12 12:29:58,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 239 transitions, 481 flow [2024-11-12 12:29:58,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:29:58,317 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51efed55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:29:58,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-11-12 12:29:58,329 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:29:58,329 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2024-11-12 12:29:58,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:29:58,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:29:58,331 INFO L206 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-12 12:29:58,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:29:58,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:29:58,339 INFO L85 PathProgramCache]: Analyzing trace with hash 408968249, now seen corresponding path program 1 times [2024-11-12 12:29:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:29:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322157519] [2024-11-12 12:29:58,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:29:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:29:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:29:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:29:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:29:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322157519] [2024-11-12 12:29:59,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322157519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:29:59,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:29:59,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:29:59,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135589518] [2024-11-12 12:29:59,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:29:59,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:29:59,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:29:59,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:29:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:29:59,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2024-11-12 12:29:59,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-12 12:29:59,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:29:59,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2024-11-12 12:29:59,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:00,127 INFO L124 PetriNetUnfolderBase]: 220/1062 cut-off events. [2024-11-12 12:30:00,128 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:30:00,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1062 events. 220/1062 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5475 event pairs, 220 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1401. Up to 493 conditions per place. [2024-11-12 12:30:00,142 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/236 dead transitions. [2024-11-12 12:30:00,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 236 transitions, 609 flow [2024-11-12 12:30:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:30:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:30:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2024-11-12 12:30:00,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-11-12 12:30:00,170 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 481 flow. Second operand 6 states and 1090 transitions. [2024-11-12 12:30:00,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 236 transitions, 609 flow [2024-11-12 12:30:00,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 236 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:30:00,182 INFO L231 Difference]: Finished difference. Result has 244 places, 236 transitions, 504 flow [2024-11-12 12:30:00,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=236} [2024-11-12 12:30:00,188 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 1 predicate places. [2024-11-12 12:30:00,190 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 236 transitions, 504 flow [2024-11-12 12:30:00,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-12 12:30:00,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:00,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:30:00,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:30:00,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:00,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash 535129878, now seen corresponding path program 1 times [2024-11-12 12:30:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190279340] [2024-11-12 12:30:00,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:00,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:00,609 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-12 12:30:00,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:00,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190279340] [2024-11-12 12:30:00,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190279340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:00,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:00,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:30:00,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855734251] [2024-11-12 12:30:00,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:30:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:00,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:30:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:30:01,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2024-11-12 12:30:01,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 236 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-12 12:30:01,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:01,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2024-11-12 12:30:01,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:01,232 INFO L124 PetriNetUnfolderBase]: 220/1059 cut-off events. [2024-11-12 12:30:01,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:30:01,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 1059 events. 220/1059 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5458 event pairs, 220 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1426. Up to 493 conditions per place. [2024-11-12 12:30:01,242 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/233 dead transitions. [2024-11-12 12:30:01,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 233 transitions, 632 flow [2024-11-12 12:30:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:30:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:30:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2024-11-12 12:30:01,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-11-12 12:30:01,245 INFO L175 Difference]: Start difference. First operand has 244 places, 236 transitions, 504 flow. Second operand 6 states and 1090 transitions. [2024-11-12 12:30:01,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 233 transitions, 632 flow [2024-11-12 12:30:01,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 233 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:30:01,254 INFO L231 Difference]: Finished difference. Result has 241 places, 233 transitions, 498 flow [2024-11-12 12:30:01,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=241, PETRI_TRANSITIONS=233} [2024-11-12 12:30:01,255 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -2 predicate places. [2024-11-12 12:30:01,256 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 233 transitions, 498 flow [2024-11-12 12:30:01,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-12 12:30:01,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:01,257 INFO L206 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] [2024-11-12 12:30:01,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:30:01,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:01,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash 106327977, now seen corresponding path program 1 times [2024-11-12 12:30:01,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:01,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549659110] [2024-11-12 12:30:01,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:01,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:01,320 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-12 12:30:01,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549659110] [2024-11-12 12:30:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549659110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:01,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:01,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:30:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629954541] [2024-11-12 12:30:01,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:01,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:30:01,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:01,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:30:01,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:30:01,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 240 [2024-11-12 12:30:01,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 233 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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-12 12:30:01,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:01,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 240 [2024-11-12 12:30:01,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:01,414 INFO L124 PetriNetUnfolderBase]: 16/368 cut-off events. [2024-11-12 12:30:01,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:30:01,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 368 events. 16/368 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 773 event pairs, 16 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 288. Up to 47 conditions per place. [2024-11-12 12:30:01,416 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 14 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2024-11-12 12:30:01,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 232 transitions, 528 flow [2024-11-12 12:30:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:30:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:30:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2024-11-12 12:30:01,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527777777777777 [2024-11-12 12:30:01,420 INFO L175 Difference]: Start difference. First operand has 241 places, 233 transitions, 498 flow. Second operand 3 states and 686 transitions. [2024-11-12 12:30:01,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 232 transitions, 528 flow [2024-11-12 12:30:01,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 232 transitions, 498 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:30:01,424 INFO L231 Difference]: Finished difference. Result has 237 places, 232 transitions, 470 flow [2024-11-12 12:30:01,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=237, PETRI_TRANSITIONS=232} [2024-11-12 12:30:01,426 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2024-11-12 12:30:01,426 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 232 transitions, 470 flow [2024-11-12 12:30:01,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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-12 12:30:01,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:01,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:30:01,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:30:01,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:01,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash 296367235, now seen corresponding path program 1 times [2024-11-12 12:30:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:01,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420755929] [2024-11-12 12:30:01,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:01,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:01,470 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-12 12:30:01,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:01,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420755929] [2024-11-12 12:30:01,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420755929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:01,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:01,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:30:01,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941737208] [2024-11-12 12:30:01,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:01,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:30:01,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:01,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:30:01,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:30:01,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 240 [2024-11-12 12:30:01,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 232 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-12 12:30:01,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:01,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 240 [2024-11-12 12:30:01,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:01,551 INFO L124 PetriNetUnfolderBase]: 24/445 cut-off events. [2024-11-12 12:30:01,551 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:30:01,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 445 events. 24/445 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1219 event pairs, 24 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 455. Up to 63 conditions per place. [2024-11-12 12:30:01,554 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 15 selfloop transitions, 1 changer transitions 0/227 dead transitions. [2024-11-12 12:30:01,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 492 flow [2024-11-12 12:30:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:30:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:30:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 678 transitions. [2024-11-12 12:30:01,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2024-11-12 12:30:01,556 INFO L175 Difference]: Start difference. First operand has 237 places, 232 transitions, 470 flow. Second operand 3 states and 678 transitions. [2024-11-12 12:30:01,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 492 flow [2024-11-12 12:30:01,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 227 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:30:01,577 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 458 flow [2024-11-12 12:30:01,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2024-11-12 12:30:01,579 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2024-11-12 12:30:01,579 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 458 flow [2024-11-12 12:30:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-12 12:30:01,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:01,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:30:01,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:30:01,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:01,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1505942631, now seen corresponding path program 1 times [2024-11-12 12:30:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440859469] [2024-11-12 12:30:01,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:02,036 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-12 12:30:02,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:02,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440859469] [2024-11-12 12:30:02,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440859469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:02,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:02,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:30:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509994791] [2024-11-12 12:30:02,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:02,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:30:02,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:30:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:30:02,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 240 [2024-11-12 12:30:02,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 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-12 12:30:02,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:02,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 240 [2024-11-12 12:30:02,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:02,589 INFO L124 PetriNetUnfolderBase]: 288/1198 cut-off events. [2024-11-12 12:30:02,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:30:02,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1198 events. 288/1198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6404 event pairs, 288 based on Foata normal form. 0/1137 useless extension candidates. Maximal degree in co-relation 1780. Up to 643 conditions per place. [2024-11-12 12:30:02,595 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 66 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2024-11-12 12:30:02,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 226 transitions, 598 flow [2024-11-12 12:30:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:30:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:30:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions. [2024-11-12 12:30:02,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-12 12:30:02,598 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 458 flow. Second operand 6 states and 1080 transitions. [2024-11-12 12:30:02,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 226 transitions, 598 flow [2024-11-12 12:30:02,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 226 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:30:02,602 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 465 flow [2024-11-12 12:30:02,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2024-11-12 12:30:02,605 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -8 predicate places. [2024-11-12 12:30:02,605 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 465 flow [2024-11-12 12:30:02,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 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-12 12:30:02,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:02,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:30:02,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:30:02,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:02,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:02,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1196565690, now seen corresponding path program 1 times [2024-11-12 12:30:02,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:02,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270515746] [2024-11-12 12:30:02,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:02,690 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-12 12:30:02,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:02,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270515746] [2024-11-12 12:30:02,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270515746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:02,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:02,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:30:02,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903169193] [2024-11-12 12:30:02,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:02,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:30:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:30:02,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:30:02,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 240 [2024-11-12 12:30:02,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-12 12:30:02,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:02,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 240 [2024-11-12 12:30:02,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:02,753 INFO L124 PetriNetUnfolderBase]: 6/289 cut-off events. [2024-11-12 12:30:02,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:30:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 289 events. 6/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 397 event pairs, 6 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 263. Up to 23 conditions per place. [2024-11-12 12:30:02,755 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 10 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-11-12 12:30:02,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 225 transitions, 487 flow [2024-11-12 12:30:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:30:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:30:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2024-11-12 12:30:02,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9638888888888889 [2024-11-12 12:30:02,757 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 465 flow. Second operand 3 states and 694 transitions. [2024-11-12 12:30:02,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 225 transitions, 487 flow [2024-11-12 12:30:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 225 transitions, 477 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:30:02,761 INFO L231 Difference]: Finished difference. Result has 231 places, 225 transitions, 457 flow [2024-11-12 12:30:02,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2024-11-12 12:30:02,762 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -12 predicate places. [2024-11-12 12:30:02,762 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 457 flow [2024-11-12 12:30:02,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-12 12:30:02,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:02,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:30:02,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:30:02,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1416804218, now seen corresponding path program 1 times [2024-11-12 12:30:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:02,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242548516] [2024-11-12 12:30:02,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:02,824 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-12 12:30:02,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:02,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242548516] [2024-11-12 12:30:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242548516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:02,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:30:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903977535] [2024-11-12 12:30:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:02,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:30:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:02,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:30:02,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:30:02,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 240 [2024-11-12 12:30:02,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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-12 12:30:02,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:02,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 240 [2024-11-12 12:30:02,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:02,876 INFO L124 PetriNetUnfolderBase]: 4/286 cut-off events. [2024-11-12 12:30:02,876 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:30:02,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 286 events. 4/286 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 261 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 250. Up to 15 conditions per place. [2024-11-12 12:30:02,878 INFO L140 encePairwiseOnDemand]: 238/240 looper letters, 7 selfloop transitions, 1 changer transitions 0/224 dead transitions. [2024-11-12 12:30:02,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 224 transitions, 471 flow [2024-11-12 12:30:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:30:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:30:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2024-11-12 12:30:02,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975 [2024-11-12 12:30:02,880 INFO L175 Difference]: Start difference. First operand has 231 places, 225 transitions, 457 flow. Second operand 3 states and 702 transitions. [2024-11-12 12:30:02,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 224 transitions, 471 flow [2024-11-12 12:30:02,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 224 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:30:02,884 INFO L231 Difference]: Finished difference. Result has 230 places, 224 transitions, 453 flow [2024-11-12 12:30:02,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=230, PETRI_TRANSITIONS=224} [2024-11-12 12:30:02,885 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -13 predicate places. [2024-11-12 12:30:02,885 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 224 transitions, 453 flow [2024-11-12 12:30:02,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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-12 12:30:02,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:02,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:02,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:30:02,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:02,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1164812758, now seen corresponding path program 1 times [2024-11-12 12:30:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250742568] [2024-11-12 12:30:02,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:03,447 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-12 12:30:03,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:03,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250742568] [2024-11-12 12:30:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250742568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:03,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:03,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:30:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319110446] [2024-11-12 12:30:03,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:03,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:30:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:03,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:30:03,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:30:03,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 240 [2024-11-12 12:30:03,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 224 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 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-12 12:30:03,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:03,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 240 [2024-11-12 12:30:03,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:04,306 INFO L124 PetriNetUnfolderBase]: 316/1522 cut-off events. [2024-11-12 12:30:04,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:30:04,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 1522 events. 316/1522 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9251 event pairs, 36 based on Foata normal form. 0/1432 useless extension candidates. Maximal degree in co-relation 2192. Up to 388 conditions per place. [2024-11-12 12:30:04,314 INFO L140 encePairwiseOnDemand]: 212/240 looper letters, 107 selfloop transitions, 70 changer transitions 0/336 dead transitions. [2024-11-12 12:30:04,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 336 transitions, 1031 flow [2024-11-12 12:30:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:30:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:30:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1229 transitions. [2024-11-12 12:30:04,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8534722222222222 [2024-11-12 12:30:04,317 INFO L175 Difference]: Start difference. First operand has 230 places, 224 transitions, 453 flow. Second operand 6 states and 1229 transitions. [2024-11-12 12:30:04,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 336 transitions, 1031 flow [2024-11-12 12:30:04,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 336 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:30:04,325 INFO L231 Difference]: Finished difference. Result has 238 places, 294 transitions, 930 flow [2024-11-12 12:30:04,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=930, PETRI_PLACES=238, PETRI_TRANSITIONS=294} [2024-11-12 12:30:04,326 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -5 predicate places. [2024-11-12 12:30:04,327 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 294 transitions, 930 flow [2024-11-12 12:30:04,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 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-12 12:30:04,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:04,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:04,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:30:04,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash -420518204, now seen corresponding path program 1 times [2024-11-12 12:30:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:04,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332397746] [2024-11-12 12:30:04,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:04,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:04,830 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-12 12:30:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:04,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332397746] [2024-11-12 12:30:04,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332397746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:04,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:30:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867434530] [2024-11-12 12:30:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:04,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:30:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:04,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:30:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:30:05,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2024-11-12 12:30:05,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 294 transitions, 930 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-12 12:30:05,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:05,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2024-11-12 12:30:05,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:05,573 INFO L124 PetriNetUnfolderBase]: 588/2293 cut-off events. [2024-11-12 12:30:05,573 INFO L125 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2024-11-12 12:30:05,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 2293 events. 588/2293 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 15197 event pairs, 222 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 4619. Up to 1090 conditions per place. [2024-11-12 12:30:05,591 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 114 selfloop transitions, 48 changer transitions 0/345 dead transitions. [2024-11-12 12:30:05,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 345 transitions, 1426 flow [2024-11-12 12:30:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:30:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:30:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2024-11-12 12:30:05,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2024-11-12 12:30:05,594 INFO L175 Difference]: Start difference. First operand has 238 places, 294 transitions, 930 flow. Second operand 6 states and 1166 transitions. [2024-11-12 12:30:05,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 345 transitions, 1426 flow [2024-11-12 12:30:05,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 345 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:30:05,610 INFO L231 Difference]: Finished difference. Result has 248 places, 337 transitions, 1318 flow [2024-11-12 12:30:05,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=248, PETRI_TRANSITIONS=337} [2024-11-12 12:30:05,611 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 5 predicate places. [2024-11-12 12:30:05,612 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 337 transitions, 1318 flow [2024-11-12 12:30:05,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-12 12:30:05,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:05,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:05,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:30:05,613 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:05,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash 678966440, now seen corresponding path program 1 times [2024-11-12 12:30:05,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:05,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751343330] [2024-11-12 12:30:05,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:05,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:06,195 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-12 12:30:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751343330] [2024-11-12 12:30:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751343330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:06,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:06,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:30:06,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668973411] [2024-11-12 12:30:06,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:06,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:30:06,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:06,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:30:06,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:30:06,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 240 [2024-11-12 12:30:06,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 337 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-12 12:30:06,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:06,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 240 [2024-11-12 12:30:06,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:07,224 INFO L124 PetriNetUnfolderBase]: 754/2823 cut-off events. [2024-11-12 12:30:07,225 INFO L125 PetriNetUnfolderBase]: For 1640/1696 co-relation queries the response was YES. [2024-11-12 12:30:07,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2823 events. 754/2823 cut-off events. For 1640/1696 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19722 event pairs, 86 based on Foata normal form. 0/2729 useless extension candidates. Maximal degree in co-relation 6511. Up to 1017 conditions per place. [2024-11-12 12:30:07,244 INFO L140 encePairwiseOnDemand]: 217/240 looper letters, 136 selfloop transitions, 136 changer transitions 4/477 dead transitions. [2024-11-12 12:30:07,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 477 transitions, 2626 flow [2024-11-12 12:30:07,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:30:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:30:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2024-11-12 12:30:07,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2024-11-12 12:30:07,248 INFO L175 Difference]: Start difference. First operand has 248 places, 337 transitions, 1318 flow. Second operand 6 states and 1224 transitions. [2024-11-12 12:30:07,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 477 transitions, 2626 flow [2024-11-12 12:30:07,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 477 transitions, 2608 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-12 12:30:07,267 INFO L231 Difference]: Finished difference. Result has 258 places, 468 transitions, 2666 flow [2024-11-12 12:30:07,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2666, PETRI_PLACES=258, PETRI_TRANSITIONS=468} [2024-11-12 12:30:07,268 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 15 predicate places. [2024-11-12 12:30:07,269 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 468 transitions, 2666 flow [2024-11-12 12:30:07,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-12 12:30:07,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:07,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:07,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:30:07,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:07,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash -365900599, now seen corresponding path program 1 times [2024-11-12 12:30:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892891290] [2024-11-12 12:30:07,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:07,765 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-12 12:30:07,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:07,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892891290] [2024-11-12 12:30:07,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892891290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:07,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:07,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:30:07,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048221894] [2024-11-12 12:30:07,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:07,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:30:07,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:07,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:30:07,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:30:08,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2024-11-12 12:30:08,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 468 transitions, 2666 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-12 12:30:08,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:08,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2024-11-12 12:30:08,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:08,739 INFO L124 PetriNetUnfolderBase]: 968/3386 cut-off events. [2024-11-12 12:30:08,739 INFO L125 PetriNetUnfolderBase]: For 3817/3888 co-relation queries the response was YES. [2024-11-12 12:30:08,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9627 conditions, 3386 events. 968/3386 cut-off events. For 3817/3888 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 24388 event pairs, 207 based on Foata normal form. 0/3298 useless extension candidates. Maximal degree in co-relation 9545. Up to 1565 conditions per place. [2024-11-12 12:30:08,767 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 239 selfloop transitions, 62 changer transitions 0/525 dead transitions. [2024-11-12 12:30:08,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 525 transitions, 3610 flow [2024-11-12 12:30:08,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:30:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:30:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2024-11-12 12:30:08,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2024-11-12 12:30:08,771 INFO L175 Difference]: Start difference. First operand has 258 places, 468 transitions, 2666 flow. Second operand 6 states and 1166 transitions. [2024-11-12 12:30:08,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 525 transitions, 3610 flow [2024-11-12 12:30:08,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 525 transitions, 3574 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-12 12:30:08,804 INFO L231 Difference]: Finished difference. Result has 268 places, 517 transitions, 3256 flow [2024-11-12 12:30:08,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3256, PETRI_PLACES=268, PETRI_TRANSITIONS=517} [2024-11-12 12:30:08,805 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 25 predicate places. [2024-11-12 12:30:08,805 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 517 transitions, 3256 flow [2024-11-12 12:30:08,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-12 12:30:08,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:08,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:08,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:30:08,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:08,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 33238092, now seen corresponding path program 1 times [2024-11-12 12:30:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646985478] [2024-11-12 12:30:08,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:09,841 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-12 12:30:09,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:09,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646985478] [2024-11-12 12:30:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646985478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:09,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:09,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 12:30:09,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059858004] [2024-11-12 12:30:09,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:09,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 12:30:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:09,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 12:30:09,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 12:30:11,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2024-11-12 12:30:11,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 517 transitions, 3256 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-12 12:30:11,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:11,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2024-11-12 12:30:11,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:13,048 INFO L124 PetriNetUnfolderBase]: 1524/5131 cut-off events. [2024-11-12 12:30:13,048 INFO L125 PetriNetUnfolderBase]: For 8793/8894 co-relation queries the response was YES. [2024-11-12 12:30:13,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16430 conditions, 5131 events. 1524/5131 cut-off events. For 8793/8894 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 41536 event pairs, 111 based on Foata normal form. 47/5076 useless extension candidates. Maximal degree in co-relation 16338. Up to 1002 conditions per place. [2024-11-12 12:30:13,103 INFO L140 encePairwiseOnDemand]: 211/240 looper letters, 478 selfloop transitions, 172 changer transitions 0/843 dead transitions. [2024-11-12 12:30:13,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 843 transitions, 7206 flow [2024-11-12 12:30:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 12:30:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-12 12:30:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3314 transitions. [2024-11-12 12:30:13,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7267543859649123 [2024-11-12 12:30:13,114 INFO L175 Difference]: Start difference. First operand has 268 places, 517 transitions, 3256 flow. Second operand 19 states and 3314 transitions. [2024-11-12 12:30:13,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 843 transitions, 7206 flow [2024-11-12 12:30:13,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 843 transitions, 7024 flow, removed 91 selfloop flow, removed 0 redundant places. [2024-11-12 12:30:13,193 INFO L231 Difference]: Finished difference. Result has 295 places, 640 transitions, 4992 flow [2024-11-12 12:30:13,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=3144, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4992, PETRI_PLACES=295, PETRI_TRANSITIONS=640} [2024-11-12 12:30:13,194 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 52 predicate places. [2024-11-12 12:30:13,194 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 640 transitions, 4992 flow [2024-11-12 12:30:13,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-12 12:30:13,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:13,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:13,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:30:13,197 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:13,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:13,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1740036200, now seen corresponding path program 2 times [2024-11-12 12:30:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:13,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623107751] [2024-11-12 12:30:13,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:14,290 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-12 12:30:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623107751] [2024-11-12 12:30:14,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623107751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:14,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 12:30:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771542639] [2024-11-12 12:30:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:14,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 12:30:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 12:30:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-12 12:30:15,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2024-11-12 12:30:15,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 640 transitions, 4992 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-12 12:30:15,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:15,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2024-11-12 12:30:15,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:16,961 INFO L124 PetriNetUnfolderBase]: 2138/7193 cut-off events. [2024-11-12 12:30:16,962 INFO L125 PetriNetUnfolderBase]: For 17382/17602 co-relation queries the response was YES. [2024-11-12 12:30:16,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24652 conditions, 7193 events. 2138/7193 cut-off events. For 17382/17602 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 65467 event pairs, 198 based on Foata normal form. 57/7126 useless extension candidates. Maximal degree in co-relation 24547. Up to 2162 conditions per place. [2024-11-12 12:30:17,013 INFO L140 encePairwiseOnDemand]: 207/240 looper letters, 458 selfloop transitions, 189 changer transitions 1/841 dead transitions. [2024-11-12 12:30:17,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 841 transitions, 8174 flow [2024-11-12 12:30:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 12:30:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-12 12:30:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2614 transitions. [2024-11-12 12:30:17,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261111111111112 [2024-11-12 12:30:17,019 INFO L175 Difference]: Start difference. First operand has 295 places, 640 transitions, 4992 flow. Second operand 15 states and 2614 transitions. [2024-11-12 12:30:17,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 841 transitions, 8174 flow [2024-11-12 12:30:17,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 841 transitions, 8119 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-12 12:30:17,113 INFO L231 Difference]: Finished difference. Result has 314 places, 736 transitions, 7002 flow [2024-11-12 12:30:17,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=4951, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7002, PETRI_PLACES=314, PETRI_TRANSITIONS=736} [2024-11-12 12:30:17,115 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 71 predicate places. [2024-11-12 12:30:17,115 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 736 transitions, 7002 flow [2024-11-12 12:30:17,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-12 12:30:17,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:17,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:17,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:30:17,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:17,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2011476306, now seen corresponding path program 3 times [2024-11-12 12:30:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:17,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412742953] [2024-11-12 12:30:17,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412742953] [2024-11-12 12:30:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412742953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:30:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:30:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 12:30:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294207293] [2024-11-12 12:30:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:30:18,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 12:30:18,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:18,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 12:30:18,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 12:30:19,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2024-11-12 12:30:19,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 736 transitions, 7002 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-12 12:30:19,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:19,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2024-11-12 12:30:19,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:22,593 INFO L124 PetriNetUnfolderBase]: 3213/10760 cut-off events. [2024-11-12 12:30:22,593 INFO L125 PetriNetUnfolderBase]: For 35505/35856 co-relation queries the response was YES. [2024-11-12 12:30:22,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38860 conditions, 10760 events. 3213/10760 cut-off events. For 35505/35856 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 108684 event pairs, 300 based on Foata normal form. 116/10688 useless extension candidates. Maximal degree in co-relation 38744. Up to 2268 conditions per place. [2024-11-12 12:30:22,693 INFO L140 encePairwiseOnDemand]: 205/240 looper letters, 525 selfloop transitions, 374 changer transitions 2/1094 dead transitions. [2024-11-12 12:30:22,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1094 transitions, 12605 flow [2024-11-12 12:30:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 12:30:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-12 12:30:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3353 transitions. [2024-11-12 12:30:22,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7353070175438596 [2024-11-12 12:30:22,702 INFO L175 Difference]: Start difference. First operand has 314 places, 736 transitions, 7002 flow. Second operand 19 states and 3353 transitions. [2024-11-12 12:30:22,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1094 transitions, 12605 flow [2024-11-12 12:30:22,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 1094 transitions, 12570 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-11-12 12:30:22,967 INFO L231 Difference]: Finished difference. Result has 344 places, 884 transitions, 10755 flow [2024-11-12 12:30:22,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=6971, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10755, PETRI_PLACES=344, PETRI_TRANSITIONS=884} [2024-11-12 12:30:22,970 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 101 predicate places. [2024-11-12 12:30:22,970 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 884 transitions, 10755 flow [2024-11-12 12:30:22,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-12 12:30:22,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:22,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:22,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:30:22,973 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:22,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1782067446, now seen corresponding path program 4 times [2024-11-12 12:30:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770692273] [2024-11-12 12:30:22,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770692273] [2024-11-12 12:30:23,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770692273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:30:23,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099727098] [2024-11-12 12:30:23,872 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 12:30:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:30:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:30:23,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:30:23,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 12:30:24,099 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 12:30:24,100 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:30:24,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 12:30:24,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:30:24,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 12:30:24,254 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 12:30:24,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-12 12:30:24,346 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 12:30:24,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 12:30:24,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 12:30:24,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-12 12:30:24,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:30:24,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-12 12:30:24,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:30:24,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-12 12:30:24,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-11-12 12:30:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:24,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:30:24,536 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 5)))) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 6)) 0))) is different from false [2024-11-12 12:30:24,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2024-11-12 12:30:24,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) .cse2) 0))))) is different from false [2024-11-12 12:30:26,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:30:26,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-12 12:30:26,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:30:26,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2024-11-12 12:30:26,617 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-12 12:30:26,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-12 12:30:26,623 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-12 12:30:26,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-12 12:30:26,630 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-12 12:30:26,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-12 12:30:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099727098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:30:26,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:30:26,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-12 12:30:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633220837] [2024-11-12 12:30:26,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:30:26,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 12:30:26,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 12:30:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=186, Unknown=14, NotChecked=90, Total=342 [2024-11-12 12:30:27,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 240 [2024-11-12 12:30:27,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 884 transitions, 10755 flow. Second operand has 19 states, 19 states have (on average 129.42105263157896) internal successors, (2459), 19 states have internal predecessors, (2459), 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-12 12:30:27,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:27,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 240 [2024-11-12 12:30:27,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:32,027 INFO L124 PetriNetUnfolderBase]: 5368/15005 cut-off events. [2024-11-12 12:30:32,028 INFO L125 PetriNetUnfolderBase]: For 65645/66107 co-relation queries the response was YES. [2024-11-12 12:30:32,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60271 conditions, 15005 events. 5368/15005 cut-off events. For 65645/66107 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 146641 event pairs, 1058 based on Foata normal form. 42/14767 useless extension candidates. Maximal degree in co-relation 60133. Up to 5220 conditions per place. [2024-11-12 12:30:32,166 INFO L140 encePairwiseOnDemand]: 219/240 looper letters, 834 selfloop transitions, 215 changer transitions 0/1166 dead transitions. [2024-11-12 12:30:32,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1166 transitions, 15293 flow [2024-11-12 12:30:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 12:30:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-12 12:30:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2648 transitions. [2024-11-12 12:30:32,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5807017543859649 [2024-11-12 12:30:32,172 INFO L175 Difference]: Start difference. First operand has 344 places, 884 transitions, 10755 flow. Second operand 19 states and 2648 transitions. [2024-11-12 12:30:32,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1166 transitions, 15293 flow [2024-11-12 12:30:32,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1166 transitions, 15202 flow, removed 43 selfloop flow, removed 3 redundant places. [2024-11-12 12:30:32,665 INFO L231 Difference]: Finished difference. Result has 368 places, 945 transitions, 12283 flow [2024-11-12 12:30:32,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=10664, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12283, PETRI_PLACES=368, PETRI_TRANSITIONS=945} [2024-11-12 12:30:32,667 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 125 predicate places. [2024-11-12 12:30:32,667 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 945 transitions, 12283 flow [2024-11-12 12:30:32,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 129.42105263157896) internal successors, (2459), 19 states have internal predecessors, (2459), 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-12 12:30:32,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:32,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:32,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 12:30:32,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 12:30:32,870 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:32,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:32,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1355508717, now seen corresponding path program 1 times [2024-11-12 12:30:32,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:32,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524836141] [2024-11-12 12:30:32,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:34,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:34,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524836141] [2024-11-12 12:30:34,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524836141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:30:34,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385528934] [2024-11-12 12:30:34,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:34,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:30:34,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:30:34,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:30:34,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 12:30:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:34,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 12:30:34,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:30:34,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 12:30:34,571 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 12:30:34,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-12 12:30:34,668 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 12:30:34,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 12:30:34,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 12:30:34,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 12:30:34,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:30:34,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-12 12:30:34,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:30:34,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-12 12:30:34,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-12 12:30:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:34,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:30:36,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|))))) is different from false [2024-11-12 12:30:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385528934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:30:40,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:30:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2024-11-12 12:30:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638168913] [2024-11-12 12:30:40,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:30:40,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 12:30:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:40,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 12:30:40,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=594, Unknown=28, NotChecked=50, Total=756 [2024-11-12 12:30:41,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 240 [2024-11-12 12:30:41,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 945 transitions, 12283 flow. Second operand has 28 states, 28 states have (on average 127.35714285714286) internal successors, (3566), 28 states have internal predecessors, (3566), 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-12 12:30:41,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:41,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 240 [2024-11-12 12:30:41,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:30:46,455 INFO L124 PetriNetUnfolderBase]: 5546/15179 cut-off events. [2024-11-12 12:30:46,455 INFO L125 PetriNetUnfolderBase]: For 82508/82866 co-relation queries the response was YES. [2024-11-12 12:30:46,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64016 conditions, 15179 events. 5546/15179 cut-off events. For 82508/82866 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 147829 event pairs, 1243 based on Foata normal form. 115/15026 useless extension candidates. Maximal degree in co-relation 63868. Up to 5456 conditions per place. [2024-11-12 12:30:46,766 INFO L140 encePairwiseOnDemand]: 218/240 looper letters, 853 selfloop transitions, 195 changer transitions 0/1162 dead transitions. [2024-11-12 12:30:46,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1162 transitions, 17111 flow [2024-11-12 12:30:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 12:30:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-12 12:30:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2084 transitions. [2024-11-12 12:30:46,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5788888888888889 [2024-11-12 12:30:46,770 INFO L175 Difference]: Start difference. First operand has 368 places, 945 transitions, 12283 flow. Second operand 15 states and 2084 transitions. [2024-11-12 12:30:46,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1162 transitions, 17111 flow [2024-11-12 12:30:47,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 1162 transitions, 16820 flow, removed 124 selfloop flow, removed 9 redundant places. [2024-11-12 12:30:47,184 INFO L231 Difference]: Finished difference. Result has 378 places, 963 transitions, 13063 flow [2024-11-12 12:30:47,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=12108, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13063, PETRI_PLACES=378, PETRI_TRANSITIONS=963} [2024-11-12 12:30:47,185 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 135 predicate places. [2024-11-12 12:30:47,185 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 963 transitions, 13063 flow [2024-11-12 12:30:47,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 127.35714285714286) internal successors, (3566), 28 states have internal predecessors, (3566), 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-12 12:30:47,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:30:47,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:47,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 12:30:47,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 12:30:47,387 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:30:47,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:30:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash -775458266, now seen corresponding path program 5 times [2024-11-12 12:30:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:30:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985982123] [2024-11-12 12:30:47,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:30:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:30:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:30:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:48,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:30:48,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985982123] [2024-11-12 12:30:48,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985982123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:30:48,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720703924] [2024-11-12 12:30:48,439 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 12:30:48,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:30:48,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:30:48,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:30:48,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 12:30:48,825 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:30:48,826 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:30:48,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 12:30:48,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:30:49,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 12:30:49,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-12 12:30:49,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:30:49,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-12 12:30:49,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:30:49,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-12 12:30:49,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:30:49,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2024-11-12 12:30:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:49,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:30:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:30:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720703924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:30:50,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:30:50,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2024-11-12 12:30:50,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966928005] [2024-11-12 12:30:50,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:30:50,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-12 12:30:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:30:50,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-12 12:30:50,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 12:30:56,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2024-11-12 12:30:56,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 963 transitions, 13063 flow. Second operand has 34 states, 34 states have (on average 166.61764705882354) internal successors, (5665), 34 states have internal predecessors, (5665), 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-12 12:30:56,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:30:56,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2024-11-12 12:30:56,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:01,429 INFO L124 PetriNetUnfolderBase]: 4442/14682 cut-off events. [2024-11-12 12:31:01,430 INFO L125 PetriNetUnfolderBase]: For 92428/93096 co-relation queries the response was YES. [2024-11-12 12:31:01,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62058 conditions, 14682 events. 4442/14682 cut-off events. For 92428/93096 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 159133 event pairs, 328 based on Foata normal form. 191/14623 useless extension candidates. Maximal degree in co-relation 61910. Up to 3119 conditions per place. [2024-11-12 12:31:01,558 INFO L140 encePairwiseOnDemand]: 206/240 looper letters, 641 selfloop transitions, 423 changer transitions 3/1266 dead transitions. [2024-11-12 12:31:01,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1266 transitions, 19297 flow [2024-11-12 12:31:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 12:31:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-12 12:31:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3691 transitions. [2024-11-12 12:31:01,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7323412698412698 [2024-11-12 12:31:01,564 INFO L175 Difference]: Start difference. First operand has 378 places, 963 transitions, 13063 flow. Second operand 21 states and 3691 transitions. [2024-11-12 12:31:01,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 1266 transitions, 19297 flow [2024-11-12 12:31:02,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 1266 transitions, 19116 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-11-12 12:31:02,036 INFO L231 Difference]: Finished difference. Result has 400 places, 1078 transitions, 17161 flow [2024-11-12 12:31:02,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=12940, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=963, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=17161, PETRI_PLACES=400, PETRI_TRANSITIONS=1078} [2024-11-12 12:31:02,037 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 157 predicate places. [2024-11-12 12:31:02,038 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 1078 transitions, 17161 flow [2024-11-12 12:31:02,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 166.61764705882354) internal successors, (5665), 34 states have internal predecessors, (5665), 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-12 12:31:02,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:02,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:31:02,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 12:31:02,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:31:02,240 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-12 12:31:02,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1362726204, now seen corresponding path program 6 times [2024-11-12 12:31:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694500742] [2024-11-12 12:31:02,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:02,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:31:03,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:03,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694500742] [2024-11-12 12:31:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694500742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:31:03,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493908851] [2024-11-12 12:31:03,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 12:31:03,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:31:03,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:31:03,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:31:03,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 12:31:03,936 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-12 12:31:03,937 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:31:03,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 12:31:03,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:31:04,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 12:31:04,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-12 12:31:04,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:31:04,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-12 12:31:04,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:31:04,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-12 12:31:04,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:31:04,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:31:04,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:31:04,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:31:04,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:31:04,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 49 [2024-11-12 12:31:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:31:04,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:31:06,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:31:06,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:31:06,567 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:31:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:31:06,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493908851] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:31:06,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:31:06,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2024-11-12 12:31:06,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930895464] [2024-11-12 12:31:06,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:31:06,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-12 12:31:06,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:06,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-12 12:31:06,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 12:31:11,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]