./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:10:53,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:10:53,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:10:53,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:10:53,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:10:53,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:10:53,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:10:53,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:10:53,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:10:53,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:10:53,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:10:53,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:10:53,265 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:10:53,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:10:53,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:10:53,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:10:53,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:10:53,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:10:53,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:10:53,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:10:53,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:10:53,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:10:53,273 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:10:53,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:10:53,273 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:10:53,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:10:53,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:10:53,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:10:53,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:10:53,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:10:53,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:10:53,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:53,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:10:53,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:10:53,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:10:53,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:10:53,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:10:53,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:10:53,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:10:53,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:10:53,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:10:53,279 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-clean/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-clean/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 -> 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 [2024-10-11 17:10:53,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:10:53,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:10:53,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:10:53,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:10:53,593 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:10:53,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-10-11 17:10:55,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:10:55,272 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:10:55,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-10-11 17:10:55,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f69f7e3d4/fded766cac1d4292a4f24ab0cdcaa248/FLAG1fbf3fc6d [2024-10-11 17:10:55,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f69f7e3d4/fded766cac1d4292a4f24ab0cdcaa248 [2024-10-11 17:10:55,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:10:55,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:10:55,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:55,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:10:55,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:10:55,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449136d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55, skipping insertion in model container [2024-10-11 17:10:55,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:10:55,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:55,785 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:10:55,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:55,887 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:10:55,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55 WrapperNode [2024-10-11 17:10:55,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:55,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:55,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:10:55,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:10:55,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,942 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-10-11 17:10:55,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:55,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:10:55,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:10:55,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:10:55,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:55,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:56,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:10:56,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:10:56,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:10:56,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:10:56,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (1/1) ... [2024-10-11 17:10:56,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:56,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:10:56,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:10:56,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:10:56,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:10:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:10:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:10:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:10:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 17:10:56,095 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 17:10:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:10:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:10:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:10:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:10:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:10:56,098 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:10:56,227 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:10:56,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:10:56,608 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:10:56,608 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:10:56,650 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:10:56,650 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 17:10:56,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:56 BoogieIcfgContainer [2024-10-11 17:10:56,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:10:56,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:10:56,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:10:56,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:10:56,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:10:55" (1/3) ... [2024-10-11 17:10:56,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5a5829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:56, skipping insertion in model container [2024-10-11 17:10:56,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:55" (2/3) ... [2024-10-11 17:10:56,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5a5829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:56, skipping insertion in model container [2024-10-11 17:10:56,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:56" (3/3) ... [2024-10-11 17:10:56,659 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2024-10-11 17:10:56,675 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:10:56,676 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-11 17:10:56,676 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:10:56,745 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:10:56,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 189 transitions, 385 flow [2024-10-11 17:10:56,869 INFO L124 PetriNetUnfolderBase]: 19/256 cut-off events. [2024-10-11 17:10:56,869 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:10:56,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 256 events. 19/256 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 785 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 139. Up to 4 conditions per place. [2024-10-11 17:10:56,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 189 transitions, 385 flow [2024-10-11 17:10:56,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 189 transitions, 385 flow [2024-10-11 17:10:56,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:56,912 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;@4c04f445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:56,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 17:10:56,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:56,923 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-10-11 17:10:56,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:56,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:56,924 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:56,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:56,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -593581314, now seen corresponding path program 1 times [2024-10-11 17:10:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:56,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437674674] [2024-10-11 17:10:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:57,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:57,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437674674] [2024-10-11 17:10:57,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437674674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:57,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:57,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618913327] [2024-10-11 17:10:57,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:57,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:57,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:57,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2024-10-11 17:10:57,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 189 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:57,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:57,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2024-10-11 17:10:57,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:57,497 INFO L124 PetriNetUnfolderBase]: 37/641 cut-off events. [2024-10-11 17:10:57,497 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:10:57,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 641 events. 37/641 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2909 event pairs, 36 based on Foata normal form. 62/639 useless extension candidates. Maximal degree in co-relation 617. Up to 97 conditions per place. [2024-10-11 17:10:57,504 INFO L140 encePairwiseOnDemand]: 174/189 looper letters, 18 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2024-10-11 17:10:57,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 174 transitions, 395 flow [2024-10-11 17:10:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-10-11 17:10:57,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8783068783068783 [2024-10-11 17:10:57,525 INFO L175 Difference]: Start difference. First operand has 179 places, 189 transitions, 385 flow. Second operand 3 states and 498 transitions. [2024-10-11 17:10:57,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 174 transitions, 395 flow [2024-10-11 17:10:57,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 174 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:57,534 INFO L231 Difference]: Finished difference. Result has 178 places, 174 transitions, 359 flow [2024-10-11 17:10:57,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=178, PETRI_TRANSITIONS=174} [2024-10-11 17:10:57,542 INFO L277 CegarLoopForPetriNet]: 179 programPoint places, -1 predicate places. [2024-10-11 17:10:57,542 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 359 flow [2024-10-11 17:10:57,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:57,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:57,544 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:57,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:10:57,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:57,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash 799022631, now seen corresponding path program 1 times [2024-10-11 17:10:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:57,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084487474] [2024-10-11 17:10:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:57,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:57,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084487474] [2024-10-11 17:10:57,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084487474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:57,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:57,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:57,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770178107] [2024-10-11 17:10:57,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:57,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:57,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:57,669 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 189 [2024-10-11 17:10:57,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:57,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:57,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 189 [2024-10-11 17:10:57,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:57,781 INFO L124 PetriNetUnfolderBase]: 37/638 cut-off events. [2024-10-11 17:10:57,782 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:10:57,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 638 events. 37/638 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2889 event pairs, 36 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 702. Up to 94 conditions per place. [2024-10-11 17:10:57,788 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 16 selfloop transitions, 1 changer transitions 0/172 dead transitions. [2024-10-11 17:10:57,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 172 transitions, 389 flow [2024-10-11 17:10:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2024-10-11 17:10:57,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8641975308641975 [2024-10-11 17:10:57,794 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 359 flow. Second operand 3 states and 490 transitions. [2024-10-11 17:10:57,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 172 transitions, 389 flow [2024-10-11 17:10:57,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 172 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:57,799 INFO L231 Difference]: Finished difference. Result has 176 places, 172 transitions, 353 flow [2024-10-11 17:10:57,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=176, PETRI_TRANSITIONS=172} [2024-10-11 17:10:57,801 INFO L277 CegarLoopForPetriNet]: 179 programPoint places, -3 predicate places. [2024-10-11 17:10:57,802 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 353 flow [2024-10-11 17:10:57,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:57,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:57,803 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:57,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:10:57,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:57,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:57,804 INFO L85 PathProgramCache]: Analyzing trace with hash 156834859, now seen corresponding path program 1 times [2024-10-11 17:10:57,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011018773] [2024-10-11 17:10:57,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:57,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:57,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011018773] [2024-10-11 17:10:57,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011018773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:57,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383987470] [2024-10-11 17:10:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:57,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:57,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:57,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2024-10-11 17:10:57,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:57,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:57,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2024-10-11 17:10:57,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:58,023 INFO L124 PetriNetUnfolderBase]: 41/579 cut-off events. [2024-10-11 17:10:58,024 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:10:58,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 579 events. 41/579 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2572 event pairs, 40 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 654. Up to 104 conditions per place. [2024-10-11 17:10:58,028 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 18 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2024-10-11 17:10:58,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 171 transitions, 391 flow [2024-10-11 17:10:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2024-10-11 17:10:58,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2024-10-11 17:10:58,031 INFO L175 Difference]: Start difference. First operand has 176 places, 172 transitions, 353 flow. Second operand 3 states and 486 transitions. [2024-10-11 17:10:58,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 171 transitions, 391 flow [2024-10-11 17:10:58,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 171 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:10:58,036 INFO L231 Difference]: Finished difference. Result has 176 places, 171 transitions, 354 flow [2024-10-11 17:10:58,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=176, PETRI_TRANSITIONS=171} [2024-10-11 17:10:58,039 INFO L277 CegarLoopForPetriNet]: 179 programPoint places, -3 predicate places. [2024-10-11 17:10:58,040 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 171 transitions, 354 flow [2024-10-11 17:10:58,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:58,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:58,041 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:58,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:10:58,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:58,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1167134520, now seen corresponding path program 1 times [2024-10-11 17:10:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:58,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198011601] [2024-10-11 17:10:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198011601] [2024-10-11 17:10:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198011601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69451375] [2024-10-11 17:10:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:58,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:58,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 189 [2024-10-11 17:10:58,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 171 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:58,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:58,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 189 [2024-10-11 17:10:58,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:59,502 INFO L124 PetriNetUnfolderBase]: 579/2265 cut-off events. [2024-10-11 17:10:59,502 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:10:59,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 2265 events. 579/2265 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 15926 event pairs, 357 based on Foata normal form. 0/2071 useless extension candidates. Maximal degree in co-relation 3489. Up to 1080 conditions per place. [2024-10-11 17:10:59,516 INFO L140 encePairwiseOnDemand]: 166/189 looper letters, 73 selfloop transitions, 70 changer transitions 0/264 dead transitions. [2024-10-11 17:10:59,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 264 transitions, 826 flow [2024-10-11 17:10:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 900 transitions. [2024-10-11 17:10:59,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7936507936507936 [2024-10-11 17:10:59,519 INFO L175 Difference]: Start difference. First operand has 176 places, 171 transitions, 354 flow. Second operand 6 states and 900 transitions. [2024-10-11 17:10:59,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 264 transitions, 826 flow [2024-10-11 17:10:59,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 264 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:59,529 INFO L231 Difference]: Finished difference. Result has 184 places, 240 transitions, 812 flow [2024-10-11 17:10:59,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=812, PETRI_PLACES=184, PETRI_TRANSITIONS=240} [2024-10-11 17:10:59,530 INFO L277 CegarLoopForPetriNet]: 179 programPoint places, 5 predicate places. [2024-10-11 17:10:59,531 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 240 transitions, 812 flow [2024-10-11 17:10:59,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:59,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:59,532 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:59,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:10:59,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:59,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:59,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1082079899, now seen corresponding path program 1 times [2024-10-11 17:10:59,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:59,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948600836] [2024-10-11 17:10:59,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:59,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948600836] [2024-10-11 17:10:59,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948600836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:59,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:59,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:59,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470463318] [2024-10-11 17:10:59,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:59,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:59,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:59,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2024-10-11 17:10:59,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 240 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:59,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:59,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2024-10-11 17:10:59,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:59,784 INFO L124 PetriNetUnfolderBase]: 188/1122 cut-off events. [2024-10-11 17:10:59,785 INFO L125 PetriNetUnfolderBase]: For 104/107 co-relation queries the response was YES. [2024-10-11 17:10:59,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 1122 events. 188/1122 cut-off events. For 104/107 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6508 event pairs, 28 based on Foata normal form. 1/1044 useless extension candidates. Maximal degree in co-relation 1783. Up to 191 conditions per place. [2024-10-11 17:10:59,793 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 22 selfloop transitions, 3 changer transitions 0/246 dead transitions. [2024-10-11 17:10:59,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 246 transitions, 874 flow [2024-10-11 17:10:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2024-10-11 17:10:59,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8800705467372134 [2024-10-11 17:10:59,795 INFO L175 Difference]: Start difference. First operand has 184 places, 240 transitions, 812 flow. Second operand 3 states and 499 transitions. [2024-10-11 17:10:59,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 246 transitions, 874 flow [2024-10-11 17:10:59,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 246 transitions, 874 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:59,806 INFO L231 Difference]: Finished difference. Result has 187 places, 240 transitions, 823 flow [2024-10-11 17:10:59,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=187, PETRI_TRANSITIONS=240} [2024-10-11 17:10:59,809 INFO L277 CegarLoopForPetriNet]: 179 programPoint places, 8 predicate places. [2024-10-11 17:10:59,810 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 240 transitions, 823 flow [2024-10-11 17:10:59,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:59,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:59,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:59,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:10:59,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:59,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash -158886799, now seen corresponding path program 1 times [2024-10-11 17:10:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:59,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217947204] [2024-10-11 17:10:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:59,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217947204] [2024-10-11 17:10:59,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217947204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:59,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:59,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:59,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613519543] [2024-10-11 17:10:59,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:59,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:59,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:59,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:59,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:59,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 189 [2024-10-11 17:10:59,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 240 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:59,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:59,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 189 [2024-10-11 17:10:59,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:00,045 INFO L124 PetriNetUnfolderBase]: 180/1058 cut-off events. [2024-10-11 17:11:00,046 INFO L125 PetriNetUnfolderBase]: For 94/99 co-relation queries the response was YES. [2024-10-11 17:11:00,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 1058 events. 180/1058 cut-off events. For 94/99 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6175 event pairs, 22 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 1761. Up to 253 conditions per place. [2024-10-11 17:11:00,054 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 20 selfloop transitions, 1 changer transitions 0/242 dead transitions. [2024-10-11 17:11:00,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 242 transitions, 869 flow [2024-10-11 17:11:00,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-10-11 17:11:00,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8712522045855379 [2024-10-11 17:11:00,057 INFO L175 Difference]: Start difference. First operand has 187 places, 240 transitions, 823 flow. Second operand 3 states and 494 transitions. [2024-10-11 17:11:00,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 242 transitions, 869 flow [2024-10-11 17:11:00,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 242 transitions, 863 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:00,065 INFO L231 Difference]: Finished difference. Result has 185 places, 238 transitions, 815 flow [2024-10-11 17:11:00,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=815, PETRI_PLACES=185, PETRI_TRANSITIONS=238} [2024-10-11 17:11:00,068 INFO L277 CegarLoopForPetriNet]: 179 programPoint places, 6 predicate places. [2024-10-11 17:11:00,069 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 238 transitions, 815 flow [2024-10-11 17:11:00,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:00,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:00,070 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:00,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:11:00,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:11:00,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1545767196, now seen corresponding path program 1 times [2024-10-11 17:11:00,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:00,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823768690] [2024-10-11 17:11:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:00,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:11:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:00,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:11:00,150 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:11:00,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-10-11 17:11:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-10-11 17:11:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-10-11 17:11:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-10-11 17:11:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-10-11 17:11:00,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-10-11 17:11:00,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-10-11 17:11:00,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-10-11 17:11:00,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-10-11 17:11:00,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-10-11 17:11:00,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-10-11 17:11:00,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-10-11 17:11:00,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-10-11 17:11:00,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-10-11 17:11:00,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-10-11 17:11:00,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-10-11 17:11:00,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-10-11 17:11:00,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-10-11 17:11:00,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-10-11 17:11:00,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-10-11 17:11:00,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:11:00,158 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:00,162 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:11:00,162 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:11:00,205 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:11:00,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 260 transitions, 536 flow [2024-10-11 17:11:00,259 INFO L124 PetriNetUnfolderBase]: 34/422 cut-off events. [2024-10-11 17:11:00,259 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:11:00,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 422 events. 34/422 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1618 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 258. Up to 8 conditions per place. [2024-10-11 17:11:00,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 260 transitions, 536 flow [2024-10-11 17:11:00,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 260 transitions, 536 flow [2024-10-11 17:11:00,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:11:00,269 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;@4c04f445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:11:00,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-10-11 17:11:00,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:11:00,275 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-10-11 17:11:00,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:11:00,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:00,276 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:00,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:00,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash -834612094, now seen corresponding path program 1 times [2024-10-11 17:11:00,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:00,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176882406] [2024-10-11 17:11:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:00,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:00,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:00,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176882406] [2024-10-11 17:11:00,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176882406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:00,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:00,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:00,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532206170] [2024-10-11 17:11:00,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:00,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:00,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:00,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:00,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 260 [2024-10-11 17:11:00,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 260 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:00,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:00,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 260 [2024-10-11 17:11:00,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:01,138 INFO L124 PetriNetUnfolderBase]: 610/5005 cut-off events. [2024-10-11 17:11:01,138 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-11 17:11:01,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6083 conditions, 5005 events. 610/5005 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 46949 event pairs, 600 based on Foata normal form. 696/5201 useless extension candidates. Maximal degree in co-relation 5147. Up to 1033 conditions per place. [2024-10-11 17:11:01,170 INFO L140 encePairwiseOnDemand]: 239/260 looper letters, 26 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2024-10-11 17:11:01,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 239 transitions, 550 flow [2024-10-11 17:11:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2024-10-11 17:11:01,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8756410256410256 [2024-10-11 17:11:01,173 INFO L175 Difference]: Start difference. First operand has 245 places, 260 transitions, 536 flow. Second operand 3 states and 683 transitions. [2024-10-11 17:11:01,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 239 transitions, 550 flow [2024-10-11 17:11:01,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 239 transitions, 550 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:01,177 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 498 flow [2024-10-11 17:11:01,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2024-10-11 17:11:01,181 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, -1 predicate places. [2024-10-11 17:11:01,181 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 498 flow [2024-10-11 17:11:01,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:01,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:01,183 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:01,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:11:01,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1096685355, now seen corresponding path program 1 times [2024-10-11 17:11:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360763525] [2024-10-11 17:11:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:01,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:01,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360763525] [2024-10-11 17:11:01,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360763525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:01,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:01,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:01,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432455803] [2024-10-11 17:11:01,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:01,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:01,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:01,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:01,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 260 [2024-10-11 17:11:01,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:01,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:01,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 260 [2024-10-11 17:11:01,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:01,923 INFO L124 PetriNetUnfolderBase]: 598/4939 cut-off events. [2024-10-11 17:11:01,924 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-11 17:11:01,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 4939 events. 598/4939 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 46042 event pairs, 594 based on Foata normal form. 0/4460 useless extension candidates. Maximal degree in co-relation 5957. Up to 1011 conditions per place. [2024-10-11 17:11:01,962 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 24 selfloop transitions, 1 changer transitions 0/237 dead transitions. [2024-10-11 17:11:01,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 237 transitions, 544 flow [2024-10-11 17:11:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-10-11 17:11:01,965 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8576923076923076 [2024-10-11 17:11:01,965 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 498 flow. Second operand 3 states and 669 transitions. [2024-10-11 17:11:01,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 237 transitions, 544 flow [2024-10-11 17:11:01,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 237 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:01,969 INFO L231 Difference]: Finished difference. Result has 242 places, 237 transitions, 492 flow [2024-10-11 17:11:01,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=242, PETRI_TRANSITIONS=237} [2024-10-11 17:11:01,971 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, -3 predicate places. [2024-10-11 17:11:01,971 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 237 transitions, 492 flow [2024-10-11 17:11:01,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:01,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:01,972 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:01,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:11:01,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:01,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:01,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1440410577, now seen corresponding path program 1 times [2024-10-11 17:11:01,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228104470] [2024-10-11 17:11:01,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:01,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:01,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:01,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228104470] [2024-10-11 17:11:01,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228104470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:01,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:01,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038571017] [2024-10-11 17:11:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:02,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:02,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:02,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:02,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 260 [2024-10-11 17:11:02,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 237 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:02,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:02,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 260 [2024-10-11 17:11:02,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:03,033 INFO L124 PetriNetUnfolderBase]: 868/5480 cut-off events. [2024-10-11 17:11:03,034 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-10-11 17:11:03,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6980 conditions, 5480 events. 868/5480 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 52502 event pairs, 856 based on Foata normal form. 0/4944 useless extension candidates. Maximal degree in co-relation 6941. Up to 1443 conditions per place. [2024-10-11 17:11:03,065 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 28 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-10-11 17:11:03,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 236 transitions, 550 flow [2024-10-11 17:11:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2024-10-11 17:11:03,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8474358974358974 [2024-10-11 17:11:03,068 INFO L175 Difference]: Start difference. First operand has 242 places, 237 transitions, 492 flow. Second operand 3 states and 661 transitions. [2024-10-11 17:11:03,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 236 transitions, 550 flow [2024-10-11 17:11:03,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 236 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:11:03,073 INFO L231 Difference]: Finished difference. Result has 242 places, 236 transitions, 493 flow [2024-10-11 17:11:03,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=242, PETRI_TRANSITIONS=236} [2024-10-11 17:11:03,075 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, -3 predicate places. [2024-10-11 17:11:03,075 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 236 transitions, 493 flow [2024-10-11 17:11:03,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:03,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:03,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:03,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:11:03,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:03,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:03,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2106651580, now seen corresponding path program 1 times [2024-10-11 17:11:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256128468] [2024-10-11 17:11:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:03,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:03,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256128468] [2024-10-11 17:11:03,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256128468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:03,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:03,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:03,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953798117] [2024-10-11 17:11:03,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:03,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:03,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:03,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:03,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:03,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 260 [2024-10-11 17:11:03,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 236 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 168.5) internal successors, (1011), 6 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:03,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:03,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 260 [2024-10-11 17:11:03,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:12,632 INFO L124 PetriNetUnfolderBase]: 29149/69746 cut-off events. [2024-10-11 17:11:12,633 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2024-10-11 17:11:12,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115282 conditions, 69746 events. 29149/69746 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 784271 event pairs, 19147 based on Foata normal form. 0/64958 useless extension candidates. Maximal degree in co-relation 115243. Up to 40545 conditions per place. [2024-10-11 17:11:13,066 INFO L140 encePairwiseOnDemand]: 221/260 looper letters, 122 selfloop transitions, 134 changer transitions 0/418 dead transitions. [2024-10-11 17:11:13,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 418 transitions, 1374 flow [2024-10-11 17:11:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1259 transitions. [2024-10-11 17:11:13,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8070512820512821 [2024-10-11 17:11:13,070 INFO L175 Difference]: Start difference. First operand has 242 places, 236 transitions, 493 flow. Second operand 6 states and 1259 transitions. [2024-10-11 17:11:13,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 418 transitions, 1374 flow [2024-10-11 17:11:13,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 418 transitions, 1370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:13,097 INFO L231 Difference]: Finished difference. Result has 250 places, 369 transitions, 1367 flow [2024-10-11 17:11:13,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1367, PETRI_PLACES=250, PETRI_TRANSITIONS=369} [2024-10-11 17:11:13,100 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, 5 predicate places. [2024-10-11 17:11:13,100 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 369 transitions, 1367 flow [2024-10-11 17:11:13,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.5) internal successors, (1011), 6 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:13,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:13,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:13,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:11:13,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:13,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1957488873, now seen corresponding path program 1 times [2024-10-11 17:11:13,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:13,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520521666] [2024-10-11 17:11:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:13,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:13,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:13,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520521666] [2024-10-11 17:11:13,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520521666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:13,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:13,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:11:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160401463] [2024-10-11 17:11:13,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:13,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:13,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:13,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 260 [2024-10-11 17:11:13,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 369 transitions, 1367 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:13,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:13,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 260 [2024-10-11 17:11:13,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:17,200 INFO L124 PetriNetUnfolderBase]: 11181/36615 cut-off events. [2024-10-11 17:11:17,200 INFO L125 PetriNetUnfolderBase]: For 5188/5618 co-relation queries the response was YES. [2024-10-11 17:11:17,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64096 conditions, 36615 events. 11181/36615 cut-off events. For 5188/5618 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 432380 event pairs, 5145 based on Foata normal form. 1/33397 useless extension candidates. Maximal degree in co-relation 64053. Up to 12382 conditions per place. [2024-10-11 17:11:17,686 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 32 selfloop transitions, 3 changer transitions 0/377 dead transitions. [2024-10-11 17:11:17,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 377 transitions, 1459 flow [2024-10-11 17:11:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-10-11 17:11:17,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8705128205128205 [2024-10-11 17:11:17,689 INFO L175 Difference]: Start difference. First operand has 250 places, 369 transitions, 1367 flow. Second operand 3 states and 679 transitions. [2024-10-11 17:11:17,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 377 transitions, 1459 flow [2024-10-11 17:11:17,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 377 transitions, 1459 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:17,826 INFO L231 Difference]: Finished difference. Result has 253 places, 371 transitions, 1392 flow [2024-10-11 17:11:17,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1392, PETRI_PLACES=253, PETRI_TRANSITIONS=371} [2024-10-11 17:11:17,827 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, 8 predicate places. [2024-10-11 17:11:17,828 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 371 transitions, 1392 flow [2024-10-11 17:11:17,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:17,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:17,829 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:17,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:11:17,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:17,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:17,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1022684854, now seen corresponding path program 1 times [2024-10-11 17:11:17,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:17,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487987533] [2024-10-11 17:11:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:17,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:17,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487987533] [2024-10-11 17:11:17,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487987533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:17,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:17,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:17,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069969013] [2024-10-11 17:11:17,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:17,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:17,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:17,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:17,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-10-11 17:11:17,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 371 transitions, 1392 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:17,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:17,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-10-11 17:11:17,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:21,960 INFO L124 PetriNetUnfolderBase]: 10638/35054 cut-off events. [2024-10-11 17:11:21,961 INFO L125 PetriNetUnfolderBase]: For 4589/4737 co-relation queries the response was YES. [2024-10-11 17:11:22,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63548 conditions, 35054 events. 10638/35054 cut-off events. For 4589/4737 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 408458 event pairs, 3939 based on Foata normal form. 0/33136 useless extension candidates. Maximal degree in co-relation 63504. Up to 12371 conditions per place. [2024-10-11 17:11:22,211 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 38 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-10-11 17:11:22,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 378 transitions, 1491 flow [2024-10-11 17:11:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2024-10-11 17:11:22,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8564102564102564 [2024-10-11 17:11:22,466 INFO L175 Difference]: Start difference. First operand has 253 places, 371 transitions, 1392 flow. Second operand 3 states and 668 transitions. [2024-10-11 17:11:22,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 378 transitions, 1491 flow [2024-10-11 17:11:22,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 378 transitions, 1488 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:11:22,596 INFO L231 Difference]: Finished difference. Result has 251 places, 369 transitions, 1395 flow [2024-10-11 17:11:22,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1395, PETRI_PLACES=251, PETRI_TRANSITIONS=369} [2024-10-11 17:11:22,597 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, 6 predicate places. [2024-10-11 17:11:22,597 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 369 transitions, 1395 flow [2024-10-11 17:11:22,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:22,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:22,598 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:22,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:11:22,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:22,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash -930052771, now seen corresponding path program 1 times [2024-10-11 17:11:22,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:22,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420599936] [2024-10-11 17:11:22,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:22,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:22,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:22,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420599936] [2024-10-11 17:11:22,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420599936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:22,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:22,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684828788] [2024-10-11 17:11:22,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:22,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:22,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:23,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 260 [2024-10-11 17:11:23,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 369 transitions, 1395 flow. Second operand has 6 states, 6 states have (on average 173.33333333333334) internal successors, (1040), 6 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:23,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:23,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 260 [2024-10-11 17:11:23,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:33,668 INFO L124 PetriNetUnfolderBase]: 39026/89468 cut-off events. [2024-10-11 17:11:33,668 INFO L125 PetriNetUnfolderBase]: For 32828/36283 co-relation queries the response was YES. [2024-10-11 17:11:34,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204101 conditions, 89468 events. 39026/89468 cut-off events. For 32828/36283 co-relation queries the response was YES. Maximal size of possible extension queue 1983. Compared 1034417 event pairs, 9779 based on Foata normal form. 47/85776 useless extension candidates. Maximal degree in co-relation 204056. Up to 36092 conditions per place. [2024-10-11 17:11:34,622 INFO L140 encePairwiseOnDemand]: 212/260 looper letters, 473 selfloop transitions, 219 changer transitions 0/860 dead transitions. [2024-10-11 17:11:34,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 860 transitions, 5009 flow [2024-10-11 17:11:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1364 transitions. [2024-10-11 17:11:34,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8743589743589744 [2024-10-11 17:11:34,631 INFO L175 Difference]: Start difference. First operand has 251 places, 369 transitions, 1395 flow. Second operand 6 states and 1364 transitions. [2024-10-11 17:11:34,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 860 transitions, 5009 flow [2024-10-11 17:11:35,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 860 transitions, 5009 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:35,015 INFO L231 Difference]: Finished difference. Result has 261 places, 600 transitions, 3711 flow [2024-10-11 17:11:35,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3711, PETRI_PLACES=261, PETRI_TRANSITIONS=600} [2024-10-11 17:11:35,016 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, 16 predicate places. [2024-10-11 17:11:35,017 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 600 transitions, 3711 flow [2024-10-11 17:11:35,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.33333333333334) internal successors, (1040), 6 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:35,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:35,018 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:35,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:11:35,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:35,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1842964242, now seen corresponding path program 1 times [2024-10-11 17:11:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:35,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484811379] [2024-10-11 17:11:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:35,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484811379] [2024-10-11 17:11:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484811379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:11:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485382988] [2024-10-11 17:11:35,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:35,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:11:35,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:11:35,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:11:35,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:11:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:35,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:11:35,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:11:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:35,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:11:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485382988] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:11:35,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:11:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:11:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006251706] [2024-10-11 17:11:35,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:11:35,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:11:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:11:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:11:35,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 260 [2024-10-11 17:11:35,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 600 transitions, 3711 flow. Second operand has 10 states, 10 states have (on average 214.3) internal successors, (2143), 10 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:35,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:35,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 260 [2024-10-11 17:11:35,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:42,419 INFO L124 PetriNetUnfolderBase]: 20947/55558 cut-off events. [2024-10-11 17:11:42,420 INFO L125 PetriNetUnfolderBase]: For 50807/53664 co-relation queries the response was YES. [2024-10-11 17:11:42,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149798 conditions, 55558 events. 20947/55558 cut-off events. For 50807/53664 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 624577 event pairs, 2777 based on Foata normal form. 554/54818 useless extension candidates. Maximal degree in co-relation 149748. Up to 19798 conditions per place. [2024-10-11 17:11:43,134 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 72 selfloop transitions, 9 changer transitions 0/606 dead transitions. [2024-10-11 17:11:43,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 606 transitions, 3877 flow [2024-10-11 17:11:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:11:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:11:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1989 transitions. [2024-10-11 17:11:43,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85 [2024-10-11 17:11:43,138 INFO L175 Difference]: Start difference. First operand has 261 places, 600 transitions, 3711 flow. Second operand 9 states and 1989 transitions. [2024-10-11 17:11:43,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 606 transitions, 3877 flow [2024-10-11 17:11:43,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 606 transitions, 3859 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:43,644 INFO L231 Difference]: Finished difference. Result has 219 places, 550 transitions, 3603 flow [2024-10-11 17:11:43,646 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=3581, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3603, PETRI_PLACES=219, PETRI_TRANSITIONS=550} [2024-10-11 17:11:43,647 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, -26 predicate places. [2024-10-11 17:11:43,647 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 550 transitions, 3603 flow [2024-10-11 17:11:43,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.3) internal successors, (2143), 10 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:43,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:43,649 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:43,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:11:43,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 17:11:43,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:43,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash 610691302, now seen corresponding path program 1 times [2024-10-11 17:11:43,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:43,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252644931] [2024-10-11 17:11:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:44,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252644931] [2024-10-11 17:11:44,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252644931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:44,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:44,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:44,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292282357] [2024-10-11 17:11:44,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:44,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:44,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:44,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:44,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 260 [2024-10-11 17:11:44,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 550 transitions, 3603 flow. Second operand has 6 states, 6 states have (on average 167.33333333333334) internal successors, (1004), 6 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:44,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:44,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 260 [2024-10-11 17:11:44,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand