./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_51-mutexptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 13:50:08,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:50:08,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:50:08,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:50:08,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:50:08,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:50:08,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:50:08,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:50:08,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:50:08,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:50:08,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:50:08,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:50:08,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:50:08,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:50:08,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:50:08,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:50:08,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:50:08,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:50:08,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:50:08,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:50:08,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:50:08,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:50:08,909 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:50:08,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:50:08,909 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:50:08,910 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:50:08,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:50:08,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:50:08,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:50:08,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:50:08,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:50:08,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:50:08,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:50:08,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:50:08,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:50:08,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:50:08,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:50:08,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:50:08,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:50:08,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:50:08,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:50:08,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e [2024-11-20 13:50:09,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:50:09,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:50:09,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:50:09,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:50:09,358 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:50:09,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2024-11-20 13:50:10,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:50:10,998 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:50:10,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2024-11-20 13:50:11,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7da0b6a3/1de2ad0963784fd28228891d518950ee/FLAG9ab7df00b [2024-11-20 13:50:11,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7da0b6a3/1de2ad0963784fd28228891d518950ee [2024-11-20 13:50:11,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:50:11,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:50:11,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:50:11,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:50:11,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:50:11,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e3a0dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11, skipping insertion in model container [2024-11-20 13:50:11,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:50:11,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:50:11,462 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:50:11,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:50:11,545 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:50:11,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11 WrapperNode [2024-11-20 13:50:11,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:50:11,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:50:11,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:50:11,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:50:11,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,604 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2024-11-20 13:50:11,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:50:11,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:50:11,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:50:11,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:50:11,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:50:11,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:50:11,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:50:11,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:50:11,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (1/1) ... [2024-11-20 13:50:11,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:50:11,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:50:11,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 13:50:11,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 13:50:11,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 13:50:11,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 13:50:11,775 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 13:50:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:50:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 13:50:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-20 13:50:11,776 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-20 13:50:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 13:50:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 13:50:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 13:50:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:50:11,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:50:11,777 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 13:50:11,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:50:11,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:50:12,484 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 13:50:12,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:50:12,549 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:50:12,553 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-20 13:50:12,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:50:12 BoogieIcfgContainer [2024-11-20 13:50:12,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:50:12,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:50:12,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:50:12,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:50:12,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:50:11" (1/3) ... [2024-11-20 13:50:12,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fc79a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:50:12, skipping insertion in model container [2024-11-20 13:50:12,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:11" (2/3) ... [2024-11-20 13:50:12,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fc79a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:50:12, skipping insertion in model container [2024-11-20 13:50:12,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:50:12" (3/3) ... [2024-11-20 13:50:12,571 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_51-mutexptr_racefree.i [2024-11-20 13:50:12,602 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:50:12,602 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-20 13:50:12,602 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 13:50:12,709 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-20 13:50:12,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 250 transitions, 507 flow [2024-11-20 13:50:12,819 INFO L124 PetriNetUnfolderBase]: 19/324 cut-off events. [2024-11-20 13:50:12,820 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:50:12,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 324 events. 19/324 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 848 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 166. Up to 4 conditions per place. [2024-11-20 13:50:12,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 250 transitions, 507 flow [2024-11-20 13:50:12,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 240 places, 250 transitions, 507 flow [2024-11-20 13:50:12,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:50:12,854 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;@422df13b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:50:12,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-20 13:50:12,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:50:12,875 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2024-11-20 13:50:12,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:50:12,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:12,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:12,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-20 13:50:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1800102507, now seen corresponding path program 1 times [2024-11-20 13:50:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:12,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611852325] [2024-11-20 13:50:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:13,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:13,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611852325] [2024-11-20 13:50:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611852325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:13,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:50:13,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907221826] [2024-11-20 13:50:13,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:13,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:50:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:50:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:50:13,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 250 [2024-11-20 13:50:13,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 250 transitions, 507 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-11-20 13:50:13,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:13,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 250 [2024-11-20 13:50:13,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:50:13,937 INFO L124 PetriNetUnfolderBase]: 73/901 cut-off events. [2024-11-20 13:50:13,937 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-20 13:50:13,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 901 events. 73/901 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4416 event pairs, 72 based on Foata normal form. 84/897 useless extension candidates. Maximal degree in co-relation 899. Up to 175 conditions per place. [2024-11-20 13:50:13,950 INFO L140 encePairwiseOnDemand]: 235/250 looper letters, 22 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-11-20 13:50:13,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 235 transitions, 525 flow [2024-11-20 13:50:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:50:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:50:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2024-11-20 13:50:13,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8973333333333333 [2024-11-20 13:50:13,975 INFO L175 Difference]: Start difference. First operand has 240 places, 250 transitions, 507 flow. Second operand 3 states and 673 transitions. [2024-11-20 13:50:13,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 235 transitions, 525 flow [2024-11-20 13:50:13,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 235 transitions, 525 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:50:13,984 INFO L231 Difference]: Finished difference. Result has 239 places, 235 transitions, 481 flow [2024-11-20 13:50:13,987 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=239, PETRI_TRANSITIONS=235} [2024-11-20 13:50:13,992 INFO L277 CegarLoopForPetriNet]: 240 programPoint places, -1 predicate places. [2024-11-20 13:50:13,992 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 235 transitions, 481 flow [2024-11-20 13:50:13,993 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-11-20 13:50:13,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:13,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:13,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:50:13,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-20 13:50:13,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash 594032613, now seen corresponding path program 1 times [2024-11-20 13:50:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181045355] [2024-11-20 13:50:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:14,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:14,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181045355] [2024-11-20 13:50:14,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181045355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:14,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:14,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 13:50:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461082384] [2024-11-20 13:50:14,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:14,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:50:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:14,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:50:14,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:50:14,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 250 [2024-11-20 13:50:14,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 235 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:14,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:14,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 250 [2024-11-20 13:50:14,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:50:14,270 INFO L124 PetriNetUnfolderBase]: 48/724 cut-off events. [2024-11-20 13:50:14,271 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-20 13:50:14,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 724 events. 48/724 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3156 event pairs, 0 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 752. Up to 108 conditions per place. [2024-11-20 13:50:14,273 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 22 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2024-11-20 13:50:14,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 241 transitions, 541 flow [2024-11-20 13:50:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:50:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:50:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2024-11-20 13:50:14,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9093333333333333 [2024-11-20 13:50:14,276 INFO L175 Difference]: Start difference. First operand has 239 places, 235 transitions, 481 flow. Second operand 3 states and 682 transitions. [2024-11-20 13:50:14,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 241 transitions, 541 flow [2024-11-20 13:50:14,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 241 transitions, 537 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:50:14,281 INFO L231 Difference]: Finished difference. Result has 240 places, 235 transitions, 485 flow [2024-11-20 13:50:14,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=240, PETRI_TRANSITIONS=235} [2024-11-20 13:50:14,282 INFO L277 CegarLoopForPetriNet]: 240 programPoint places, 0 predicate places. [2024-11-20 13:50:14,282 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 235 transitions, 485 flow [2024-11-20 13:50:14,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:14,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:14,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:14,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:50:14,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-20 13:50:14,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:14,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1127339270, now seen corresponding path program 1 times [2024-11-20 13:50:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:14,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034166522] [2024-11-20 13:50:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:14,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034166522] [2024-11-20 13:50:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034166522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:14,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:14,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:50:14,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010059114] [2024-11-20 13:50:14,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:14,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:50:14,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:14,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:50:14,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:50:14,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 250 [2024-11-20 13:50:14,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 235 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:14,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:14,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 250 [2024-11-20 13:50:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:50:15,404 INFO L124 PetriNetUnfolderBase]: 578/2387 cut-off events. [2024-11-20 13:50:15,405 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-20 13:50:15,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 2387 events. 578/2387 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 16672 event pairs, 343 based on Foata normal form. 0/2171 useless extension candidates. Maximal degree in co-relation 3517. Up to 1071 conditions per place. [2024-11-20 13:50:15,415 INFO L140 encePairwiseOnDemand]: 227/250 looper letters, 73 selfloop transitions, 70 changer transitions 0/328 dead transitions. [2024-11-20 13:50:15,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 328 transitions, 960 flow [2024-11-20 13:50:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:50:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:50:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1266 transitions. [2024-11-20 13:50:15,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.844 [2024-11-20 13:50:15,418 INFO L175 Difference]: Start difference. First operand has 240 places, 235 transitions, 485 flow. Second operand 6 states and 1266 transitions. [2024-11-20 13:50:15,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 328 transitions, 960 flow [2024-11-20 13:50:15,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 328 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:50:15,424 INFO L231 Difference]: Finished difference. Result has 248 places, 304 transitions, 944 flow [2024-11-20 13:50:15,425 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=248, PETRI_TRANSITIONS=304} [2024-11-20 13:50:15,425 INFO L277 CegarLoopForPetriNet]: 240 programPoint places, 8 predicate places. [2024-11-20 13:50:15,426 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 304 transitions, 944 flow [2024-11-20 13:50:15,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:15,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:15,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:15,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:50:15,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-20 13:50:15,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1436381775, now seen corresponding path program 1 times [2024-11-20 13:50:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:15,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646666547] [2024-11-20 13:50:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:15,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646666547] [2024-11-20 13:50:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646666547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:15,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:15,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:50:15,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313390981] [2024-11-20 13:50:15,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:15,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:50:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:15,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:50:15,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:50:15,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 250 [2024-11-20 13:50:15,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 304 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:15,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:15,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 250 [2024-11-20 13:50:15,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:50:15,686 INFO L124 PetriNetUnfolderBase]: 260/1623 cut-off events. [2024-11-20 13:50:15,687 INFO L125 PetriNetUnfolderBase]: For 90/101 co-relation queries the response was YES. [2024-11-20 13:50:15,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 1623 events. 260/1623 cut-off events. For 90/101 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10493 event pairs, 110 based on Foata normal form. 0/1520 useless extension candidates. Maximal degree in co-relation 2353. Up to 299 conditions per place. [2024-11-20 13:50:15,694 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 25 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-11-20 13:50:15,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 300 transitions, 990 flow [2024-11-20 13:50:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:50:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:50:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2024-11-20 13:50:15,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.868 [2024-11-20 13:50:15,697 INFO L175 Difference]: Start difference. First operand has 248 places, 304 transitions, 944 flow. Second operand 3 states and 651 transitions. [2024-11-20 13:50:15,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 300 transitions, 990 flow [2024-11-20 13:50:15,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 300 transitions, 990 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:50:15,704 INFO L231 Difference]: Finished difference. Result has 245 places, 300 transitions, 946 flow [2024-11-20 13:50:15,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=245, PETRI_TRANSITIONS=300} [2024-11-20 13:50:15,705 INFO L277 CegarLoopForPetriNet]: 240 programPoint places, 5 predicate places. [2024-11-20 13:50:15,705 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 300 transitions, 946 flow [2024-11-20 13:50:15,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:15,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:15,706 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:15,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 13:50:15,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-20 13:50:15,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2018360654, now seen corresponding path program 1 times [2024-11-20 13:50:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:15,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278915689] [2024-11-20 13:50:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:15,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:50:15,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 13:50:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:50:15,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 13:50:15,771 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 13:50:15,772 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-11-20 13:50:15,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-11-20 13:50:15,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-11-20 13:50:15,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-11-20 13:50:15,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-11-20 13:50:15,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-11-20 13:50:15,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-11-20 13:50:15,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-11-20 13:50:15,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-11-20 13:50:15,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-11-20 13:50:15,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-11-20 13:50:15,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2024-11-20 13:50:15,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-11-20 13:50:15,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-11-20 13:50:15,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-11-20 13:50:15,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-11-20 13:50:15,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-11-20 13:50:15,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-11-20 13:50:15,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-11-20 13:50:15,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-11-20 13:50:15,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-11-20 13:50:15,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-11-20 13:50:15,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 13:50:15,777 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 13:50:15,779 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 13:50:15,779 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-20 13:50:15,805 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 13:50:15,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 327 transitions, 670 flow [2024-11-20 13:50:15,851 INFO L124 PetriNetUnfolderBase]: 34/503 cut-off events. [2024-11-20 13:50:15,851 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 13:50:15,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 503 events. 34/503 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1777 event pairs, 0 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 326. Up to 8 conditions per place. [2024-11-20 13:50:15,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 327 transitions, 670 flow [2024-11-20 13:50:15,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 327 transitions, 670 flow [2024-11-20 13:50:15,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:50:15,865 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;@422df13b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:50:15,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-20 13:50:15,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:50:15,869 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2024-11-20 13:50:15,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:50:15,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:15,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:15,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:50:15,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1276136427, now seen corresponding path program 1 times [2024-11-20 13:50:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359685842] [2024-11-20 13:50:15,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:15,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:15,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:15,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359685842] [2024-11-20 13:50:15,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359685842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:15,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:15,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:50:15,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554372968] [2024-11-20 13:50:15,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:15,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:50:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:15,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:50:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:50:15,934 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 327 [2024-11-20 13:50:15,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 327 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:15,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:15,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 327 [2024-11-20 13:50:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:50:17,239 INFO L124 PetriNetUnfolderBase]: 1642/9394 cut-off events. [2024-11-20 13:50:17,239 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-11-20 13:50:17,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12127 conditions, 9394 events. 1642/9394 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 97562 event pairs, 1629 based on Foata normal form. 1315/9786 useless extension candidates. Maximal degree in co-relation 10772. Up to 2673 conditions per place. [2024-11-20 13:50:17,299 INFO L140 encePairwiseOnDemand]: 306/327 looper letters, 33 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2024-11-20 13:50:17,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 306 transitions, 698 flow [2024-11-20 13:50:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:50:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:50:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2024-11-20 13:50:17,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8868501529051988 [2024-11-20 13:50:17,301 INFO L175 Difference]: Start difference. First operand has 312 places, 327 transitions, 670 flow. Second operand 3 states and 870 transitions. [2024-11-20 13:50:17,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 306 transitions, 698 flow [2024-11-20 13:50:17,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 306 transitions, 698 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:50:17,305 INFO L231 Difference]: Finished difference. Result has 311 places, 306 transitions, 632 flow [2024-11-20 13:50:17,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=311, PETRI_TRANSITIONS=306} [2024-11-20 13:50:17,309 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -1 predicate places. [2024-11-20 13:50:17,309 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 306 transitions, 632 flow [2024-11-20 13:50:17,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:17,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:17,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:17,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 13:50:17,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:50:17,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:17,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1729178612, now seen corresponding path program 1 times [2024-11-20 13:50:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:17,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736023720] [2024-11-20 13:50:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:17,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:17,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:17,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736023720] [2024-11-20 13:50:17,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736023720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:17,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:17,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 13:50:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783629268] [2024-11-20 13:50:17,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:17,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:50:17,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:17,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:50:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:50:17,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 327 [2024-11-20 13:50:17,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 306 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:17,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:17,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 327 [2024-11-20 13:50:17,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:50:18,218 INFO L124 PetriNetUnfolderBase]: 788/5496 cut-off events. [2024-11-20 13:50:18,219 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-11-20 13:50:18,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6852 conditions, 5496 events. 788/5496 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 53175 event pairs, 348 based on Foata normal form. 1/4832 useless extension candidates. Maximal degree in co-relation 6755. Up to 1303 conditions per place. [2024-11-20 13:50:18,245 INFO L140 encePairwiseOnDemand]: 324/327 looper letters, 31 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2024-11-20 13:50:18,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 313 transitions, 712 flow [2024-11-20 13:50:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:50:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:50:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2024-11-20 13:50:18,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8970438328236493 [2024-11-20 13:50:18,248 INFO L175 Difference]: Start difference. First operand has 311 places, 306 transitions, 632 flow. Second operand 3 states and 880 transitions. [2024-11-20 13:50:18,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 313 transitions, 712 flow [2024-11-20 13:50:18,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 313 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:50:18,252 INFO L231 Difference]: Finished difference. Result has 312 places, 307 transitions, 640 flow [2024-11-20 13:50:18,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=312, PETRI_TRANSITIONS=307} [2024-11-20 13:50:18,253 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, 0 predicate places. [2024-11-20 13:50:18,253 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 307 transitions, 640 flow [2024-11-20 13:50:18,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:18,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:18,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:18,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 13:50:18,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:50:18,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash 295510145, now seen corresponding path program 1 times [2024-11-20 13:50:18,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:18,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057492290] [2024-11-20 13:50:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:18,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:18,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057492290] [2024-11-20 13:50:18,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057492290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:18,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:18,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:50:18,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658842877] [2024-11-20 13:50:18,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:18,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:50:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:18,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:50:18,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:50:18,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 327 [2024-11-20 13:50:18,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 307 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:18,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:18,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 327 [2024-11-20 13:50:18,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:50:28,130 INFO L124 PetriNetUnfolderBase]: 29144/72431 cut-off events. [2024-11-20 13:50:28,131 INFO L125 PetriNetUnfolderBase]: For 1348/1348 co-relation queries the response was YES. [2024-11-20 13:50:28,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118632 conditions, 72431 events. 29144/72431 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 843640 event pairs, 20506 based on Foata normal form. 0/66594 useless extension candidates. Maximal degree in co-relation 118337. Up to 40528 conditions per place. [2024-11-20 13:50:28,703 INFO L140 encePairwiseOnDemand]: 288/327 looper letters, 123 selfloop transitions, 135 changer transitions 0/490 dead transitions. [2024-11-20 13:50:28,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 490 transitions, 1532 flow [2024-11-20 13:50:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:50:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:50:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1661 transitions. [2024-11-20 13:50:28,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8465851172273191 [2024-11-20 13:50:28,710 INFO L175 Difference]: Start difference. First operand has 312 places, 307 transitions, 640 flow. Second operand 6 states and 1661 transitions. [2024-11-20 13:50:28,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 490 transitions, 1532 flow [2024-11-20 13:50:28,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 490 transitions, 1529 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:50:28,727 INFO L231 Difference]: Finished difference. Result has 321 places, 441 transitions, 1528 flow [2024-11-20 13:50:28,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1528, PETRI_PLACES=321, PETRI_TRANSITIONS=441} [2024-11-20 13:50:28,731 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, 9 predicate places. [2024-11-20 13:50:28,731 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 441 transitions, 1528 flow [2024-11-20 13:50:28,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:28,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:28,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:28,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 13:50:28,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:50:28,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1453012179, now seen corresponding path program 1 times [2024-11-20 13:50:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:28,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052882752] [2024-11-20 13:50:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:28,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:28,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052882752] [2024-11-20 13:50:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052882752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:28,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:28,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:50:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686389642] [2024-11-20 13:50:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:28,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:50:28,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:28,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:50:28,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:50:28,810 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 327 [2024-11-20 13:50:28,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 441 transitions, 1528 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:28,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:28,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 327 [2024-11-20 13:50:28,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:50:34,924 INFO L124 PetriNetUnfolderBase]: 14879/50521 cut-off events. [2024-11-20 13:50:34,924 INFO L125 PetriNetUnfolderBase]: For 5328/5921 co-relation queries the response was YES. [2024-11-20 13:50:35,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86710 conditions, 50521 events. 14879/50521 cut-off events. For 5328/5921 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 635845 event pairs, 9103 based on Foata normal form. 0/46824 useless extension candidates. Maximal degree in co-relation 75640. Up to 14377 conditions per place. [2024-11-20 13:50:35,271 INFO L140 encePairwiseOnDemand]: 315/327 looper letters, 40 selfloop transitions, 3 changer transitions 0/436 dead transitions. [2024-11-20 13:50:35,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 436 transitions, 1609 flow [2024-11-20 13:50:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:50:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:50:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 832 transitions. [2024-11-20 13:50:35,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8481141692150866 [2024-11-20 13:50:35,274 INFO L175 Difference]: Start difference. First operand has 321 places, 441 transitions, 1528 flow. Second operand 3 states and 832 transitions. [2024-11-20 13:50:35,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 436 transitions, 1609 flow [2024-11-20 13:50:35,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 436 transitions, 1609 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:50:35,601 INFO L231 Difference]: Finished difference. Result has 315 places, 435 transitions, 1531 flow [2024-11-20 13:50:35,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1531, PETRI_PLACES=315, PETRI_TRANSITIONS=435} [2024-11-20 13:50:35,602 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, 3 predicate places. [2024-11-20 13:50:35,603 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 435 transitions, 1531 flow [2024-11-20 13:50:35,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:35,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:35,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:35,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 13:50:35,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:50:35,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1388850367, now seen corresponding path program 1 times [2024-11-20 13:50:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:35,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535555991] [2024-11-20 13:50:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:36,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:36,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535555991] [2024-11-20 13:50:36,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535555991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:36,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:36,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:50:36,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961495267] [2024-11-20 13:50:36,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:36,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:50:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:36,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:50:36,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:50:36,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 327 [2024-11-20 13:50:36,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 435 transitions, 1531 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:36,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:36,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 327 [2024-11-20 13:50:36,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:50:57,106 INFO L124 PetriNetUnfolderBase]: 71701/172047 cut-off events. [2024-11-20 13:50:57,106 INFO L125 PetriNetUnfolderBase]: For 43509/47967 co-relation queries the response was YES. [2024-11-20 13:50:57,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358688 conditions, 172047 events. 71701/172047 cut-off events. For 43509/47967 co-relation queries the response was YES. Maximal size of possible extension queue 2876. Compared 2181899 event pairs, 14346 based on Foata normal form. 67/162523 useless extension candidates. Maximal degree in co-relation 352914. Up to 49105 conditions per place. [2024-11-20 13:50:58,305 INFO L140 encePairwiseOnDemand]: 273/327 looper letters, 493 selfloop transitions, 227 changer transitions 0/949 dead transitions. [2024-11-20 13:50:58,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 949 transitions, 5247 flow [2024-11-20 13:50:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:50:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:50:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1765 transitions. [2024-11-20 13:50:58,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8995922528032619 [2024-11-20 13:50:58,308 INFO L175 Difference]: Start difference. First operand has 315 places, 435 transitions, 1531 flow. Second operand 6 states and 1765 transitions. [2024-11-20 13:50:58,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 949 transitions, 5247 flow [2024-11-20 13:50:58,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 949 transitions, 5247 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:50:58,632 INFO L231 Difference]: Finished difference. Result has 325 places, 674 transitions, 3907 flow [2024-11-20 13:50:58,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3907, PETRI_PLACES=325, PETRI_TRANSITIONS=674} [2024-11-20 13:50:58,634 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, 13 predicate places. [2024-11-20 13:50:58,634 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 674 transitions, 3907 flow [2024-11-20 13:50:58,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:58,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:50:58,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:50:58,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 13:50:58,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:50:58,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:50:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1309253688, now seen corresponding path program 1 times [2024-11-20 13:50:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:50:58,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358157251] [2024-11-20 13:50:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:50:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:50:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:50:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:50:58,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:50:58,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358157251] [2024-11-20 13:50:58,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358157251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:50:58,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:50:58,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:50:58,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120270399] [2024-11-20 13:50:58,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:50:58,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:50:58,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:50:58,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:50:58,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:50:59,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 327 [2024-11-20 13:50:59,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 674 transitions, 3907 flow. Second operand has 6 states, 6 states have (on average 234.16666666666666) internal successors, (1405), 6 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:50:59,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:50:59,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 327 [2024-11-20 13:50:59,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand