./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/pthread-race-challenges/thread-join-array-dynamic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:21:35,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:21:35,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:21:35,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:21:35,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:21:35,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:21:35,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:21:35,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:21:35,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:21:35,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:21:35,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:21:35,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:21:35,849 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:21:35,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:21:35,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:21:35,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:21:35,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:21:35,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:21:35,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:21:35,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:21:35,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:21:35,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:21:35,859 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:21:35,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:21:35,860 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:21:35,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:21:35,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:21:35,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:21:35,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:21:35,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:21:35,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:21:35,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:21:35,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:21:35,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:21:35,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:21:35,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:21:35,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:21:35,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:21:35,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:21:35,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:21:35,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:21:35,867 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b [2024-10-11 17:21:36,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:21:36,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:21:36,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:21:36,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:21:36,155 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:21:36,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i [2024-10-11 17:21:37,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:21:37,994 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:21:37,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i [2024-10-11 17:21:38,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1ff659b6f/e892a2ed5f1a456d8491e5ceb02de0bf/FLAGebdd6f93c [2024-10-11 17:21:38,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1ff659b6f/e892a2ed5f1a456d8491e5ceb02de0bf [2024-10-11 17:21:38,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:21:38,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:21:38,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:21:38,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:21:38,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:21:38,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c1e61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38, skipping insertion in model container [2024-10-11 17:21:38,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:21:38,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:21:38,588 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:21:38,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:21:38,717 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:21:38,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38 WrapperNode [2024-10-11 17:21:38,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:21:38,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:21:38,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:21:38,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:21:38,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,770 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-10-11 17:21:38,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:21:38,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:21:38,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:21:38,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:21:38,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:21:38,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:21:38,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:21:38,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:21:38,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (1/1) ... [2024-10-11 17:21:38,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:21:38,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:38,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:21:38,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:21:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:21:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:21:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:21:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:21:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:21:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:21:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:21:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:21:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-11 17:21:38,908 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-11 17:21:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:21:38,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:21:38,910 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:21:39,077 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:21:39,080 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:21:39,306 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:21:39,306 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:21:39,327 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:21:39,327 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:21:39,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:21:39 BoogieIcfgContainer [2024-10-11 17:21:39,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:21:39,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:21:39,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:21:39,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:21:39,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:21:38" (1/3) ... [2024-10-11 17:21:39,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766db18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:21:39, skipping insertion in model container [2024-10-11 17:21:39,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:38" (2/3) ... [2024-10-11 17:21:39,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766db18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:21:39, skipping insertion in model container [2024-10-11 17:21:39,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:21:39" (3/3) ... [2024-10-11 17:21:39,337 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic.i [2024-10-11 17:21:39,352 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:21:39,352 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 17:21:39,352 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:21:39,404 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:21:39,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 91 transitions, 189 flow [2024-10-11 17:21:39,488 INFO L124 PetriNetUnfolderBase]: 6/125 cut-off events. [2024-10-11 17:21:39,488 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:21:39,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 125 events. 6/125 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2024-10-11 17:21:39,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 91 transitions, 189 flow [2024-10-11 17:21:39,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 91 transitions, 189 flow [2024-10-11 17:21:39,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:21:39,516 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;@2196c5d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:21:39,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 17:21:39,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:21:39,532 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-11 17:21:39,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:21:39,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:39,533 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] [2024-10-11 17:21:39,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:39,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash 637167217, now seen corresponding path program 1 times [2024-10-11 17:21:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843158606] [2024-10-11 17:21:39,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:39,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:39,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843158606] [2024-10-11 17:21:39,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843158606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:39,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428048095] [2024-10-11 17:21:39,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:39,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:39,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:39,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:39,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:39,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2024-10-11 17:21:39,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:39,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:39,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2024-10-11 17:21:39,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:39,994 INFO L124 PetriNetUnfolderBase]: 8/163 cut-off events. [2024-10-11 17:21:39,994 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-10-11 17:21:39,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 163 events. 8/163 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 414 event pairs, 1 based on Foata normal form. 8/154 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2024-10-11 17:21:39,997 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 8 selfloop transitions, 3 changer transitions 2/92 dead transitions. [2024-10-11 17:21:39,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 215 flow [2024-10-11 17:21:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2024-10-11 17:21:40,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9377289377289377 [2024-10-11 17:21:40,016 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 189 flow. Second operand 3 states and 256 transitions. [2024-10-11 17:21:40,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 215 flow [2024-10-11 17:21:40,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:21:40,027 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 203 flow [2024-10-11 17:21:40,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-10-11 17:21:40,035 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2024-10-11 17:21:40,038 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 203 flow [2024-10-11 17:21:40,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:40,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:40,039 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] [2024-10-11 17:21:40,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:21:40,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:40,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1740217746, now seen corresponding path program 1 times [2024-10-11 17:21:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:40,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500300174] [2024-10-11 17:21:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500300174] [2024-10-11 17:21:40,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500300174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:40,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:40,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528569083] [2024-10-11 17:21:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:40,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:40,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:40,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:40,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 91 [2024-10-11 17:21:40,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:40,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:40,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 91 [2024-10-11 17:21:40,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:41,080 INFO L124 PetriNetUnfolderBase]: 31/245 cut-off events. [2024-10-11 17:21:41,081 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:21:41,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 245 events. 31/245 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1068 event pairs, 11 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 277. Up to 62 conditions per place. [2024-10-11 17:21:41,084 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 24 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2024-10-11 17:21:41,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 275 flow [2024-10-11 17:21:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 426 transitions. [2024-10-11 17:21:41,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7802197802197802 [2024-10-11 17:21:41,089 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 203 flow. Second operand 6 states and 426 transitions. [2024-10-11 17:21:41,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 275 flow [2024-10-11 17:21:41,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:41,092 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 205 flow [2024-10-11 17:21:41,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-10-11 17:21:41,093 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2024-10-11 17:21:41,094 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 205 flow [2024-10-11 17:21:41,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:41,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:41,095 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] [2024-10-11 17:21:41,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:21:41,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:41,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2045412567, now seen corresponding path program 1 times [2024-10-11 17:21:41,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:41,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732483165] [2024-10-11 17:21:41,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:41,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732483165] [2024-10-11 17:21:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732483165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:41,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:41,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630282124] [2024-10-11 17:21:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:41,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:21:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:21:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:21:41,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2024-10-11 17:21:41,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:41,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:41,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2024-10-11 17:21:41,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:41,421 INFO L124 PetriNetUnfolderBase]: 17/232 cut-off events. [2024-10-11 17:21:41,422 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:21:41,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 232 events. 17/232 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 805 event pairs, 1 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2024-10-11 17:21:41,425 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 15 selfloop transitions, 2 changer transitions 5/95 dead transitions. [2024-10-11 17:21:41,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 263 flow [2024-10-11 17:21:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 461 transitions. [2024-10-11 17:21:41,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8443223443223443 [2024-10-11 17:21:41,429 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 205 flow. Second operand 6 states and 461 transitions. [2024-10-11 17:21:41,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 263 flow [2024-10-11 17:21:41,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 253 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:41,434 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 213 flow [2024-10-11 17:21:41,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2024-10-11 17:21:41,436 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2024-10-11 17:21:41,437 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 213 flow [2024-10-11 17:21:41,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:41,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:41,438 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] [2024-10-11 17:21:41,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:21:41,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:41,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:41,439 INFO L85 PathProgramCache]: Analyzing trace with hash 79107010, now seen corresponding path program 1 times [2024-10-11 17:21:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:41,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726041281] [2024-10-11 17:21:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:41,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:41,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:41,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726041281] [2024-10-11 17:21:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726041281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:41,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:41,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:41,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738966266] [2024-10-11 17:21:41,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:41,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:41,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:41,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:41,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2024-10-11 17:21:41,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:41,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:41,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2024-10-11 17:21:41,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:41,544 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2024-10-11 17:21:41,544 INFO L125 PetriNetUnfolderBase]: For 19/32 co-relation queries the response was YES. [2024-10-11 17:21:41,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 169 events. 5/169 cut-off events. For 19/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 475 event pairs, 3 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 189. Up to 25 conditions per place. [2024-10-11 17:21:41,546 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 8 selfloop transitions, 4 changer transitions 3/91 dead transitions. [2024-10-11 17:21:41,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 249 flow [2024-10-11 17:21:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-10-11 17:21:41,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084249084249084 [2024-10-11 17:21:41,548 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 213 flow. Second operand 3 states and 248 transitions. [2024-10-11 17:21:41,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 249 flow [2024-10-11 17:21:41,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 235 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:41,551 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 221 flow [2024-10-11 17:21:41,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-10-11 17:21:41,554 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2024-10-11 17:21:41,554 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 221 flow [2024-10-11 17:21:41,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:41,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:41,556 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] [2024-10-11 17:21:41,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:21:41,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:41,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 42510031, now seen corresponding path program 1 times [2024-10-11 17:21:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:41,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366578764] [2024-10-11 17:21:41,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:21:41,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366578764] [2024-10-11 17:21:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366578764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:41,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:41,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:41,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272789087] [2024-10-11 17:21:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:41,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:41,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:41,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:41,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:42,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 91 [2024-10-11 17:21:42,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:42,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:42,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 91 [2024-10-11 17:21:42,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:42,144 INFO L124 PetriNetUnfolderBase]: 25/282 cut-off events. [2024-10-11 17:21:42,145 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2024-10-11 17:21:42,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 282 events. 25/282 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1231 event pairs, 15 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2024-10-11 17:21:42,149 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 12 selfloop transitions, 0 changer transitions 20/95 dead transitions. [2024-10-11 17:21:42,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 289 flow [2024-10-11 17:21:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 436 transitions. [2024-10-11 17:21:42,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985347985347986 [2024-10-11 17:21:42,151 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 221 flow. Second operand 6 states and 436 transitions. [2024-10-11 17:21:42,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 289 flow [2024-10-11 17:21:42,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:42,155 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 184 flow [2024-10-11 17:21:42,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2024-10-11 17:21:42,156 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2024-10-11 17:21:42,156 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 184 flow [2024-10-11 17:21:42,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:42,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:42,157 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] [2024-10-11 17:21:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:21:42,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:42,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2106051217, now seen corresponding path program 1 times [2024-10-11 17:21:42,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:42,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690603225] [2024-10-11 17:21:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:42,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:21:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:42,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:21:42,228 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:21:42,230 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-11 17:21:42,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-10-11 17:21:42,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-10-11 17:21:42,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-10-11 17:21:42,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-10-11 17:21:42,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-10-11 17:21:42,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:21:42,233 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 17:21:42,236 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:21:42,236 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:21:42,256 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:21:42,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 109 transitions, 234 flow [2024-10-11 17:21:42,298 INFO L124 PetriNetUnfolderBase]: 11/212 cut-off events. [2024-10-11 17:21:42,298 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:21:42,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 212 events. 11/212 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2024-10-11 17:21:42,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 109 transitions, 234 flow [2024-10-11 17:21:42,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 109 transitions, 234 flow [2024-10-11 17:21:42,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:21:42,303 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;@2196c5d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:21:42,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 17:21:42,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:21:42,309 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-11 17:21:42,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:21:42,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:42,309 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] [2024-10-11 17:21:42,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:42,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:42,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1540354543, now seen corresponding path program 1 times [2024-10-11 17:21:42,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:42,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407231288] [2024-10-11 17:21:42,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:42,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407231288] [2024-10-11 17:21:42,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407231288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:42,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:42,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498043881] [2024-10-11 17:21:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:42,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:42,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:42,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 109 [2024-10-11 17:21:42,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:42,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:42,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 109 [2024-10-11 17:21:42,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:42,475 INFO L124 PetriNetUnfolderBase]: 119/731 cut-off events. [2024-10-11 17:21:42,475 INFO L125 PetriNetUnfolderBase]: For 68/92 co-relation queries the response was YES. [2024-10-11 17:21:42,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 731 events. 119/731 cut-off events. For 68/92 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4271 event pairs, 50 based on Foata normal form. 36/682 useless extension candidates. Maximal degree in co-relation 749. Up to 139 conditions per place. [2024-10-11 17:21:42,482 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 16 selfloop transitions, 4 changer transitions 1/113 dead transitions. [2024-10-11 17:21:42,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 113 transitions, 282 flow [2024-10-11 17:21:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-10-11 17:21:42,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.926605504587156 [2024-10-11 17:21:42,484 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 234 flow. Second operand 3 states and 303 transitions. [2024-10-11 17:21:42,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 113 transitions, 282 flow [2024-10-11 17:21:42,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:21:42,487 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 256 flow [2024-10-11 17:21:42,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2024-10-11 17:21:42,489 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2024-10-11 17:21:42,490 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 256 flow [2024-10-11 17:21:42,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:42,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:42,491 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] [2024-10-11 17:21:42,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:21:42,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:42,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1300220009, now seen corresponding path program 1 times [2024-10-11 17:21:42,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:42,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302107282] [2024-10-11 17:21:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:42,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302107282] [2024-10-11 17:21:42,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302107282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:42,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393322742] [2024-10-11 17:21:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:42,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:21:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:21:42,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:21:42,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 109 [2024-10-11 17:21:42,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:42,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:42,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 109 [2024-10-11 17:21:42,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:42,847 INFO L124 PetriNetUnfolderBase]: 189/1195 cut-off events. [2024-10-11 17:21:42,848 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-10-11 17:21:42,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1195 events. 189/1195 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8575 event pairs, 131 based on Foata normal form. 1/1096 useless extension candidates. Maximal degree in co-relation 1094. Up to 314 conditions per place. [2024-10-11 17:21:42,856 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 20 selfloop transitions, 2 changer transitions 5/116 dead transitions. [2024-10-11 17:21:42,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 326 flow [2024-10-11 17:21:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2024-10-11 17:21:42,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8409785932721713 [2024-10-11 17:21:42,858 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 256 flow. Second operand 6 states and 550 transitions. [2024-10-11 17:21:42,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 326 flow [2024-10-11 17:21:42,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:42,863 INFO L231 Difference]: Finished difference. Result has 119 places, 109 transitions, 270 flow [2024-10-11 17:21:42,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=119, PETRI_TRANSITIONS=109} [2024-10-11 17:21:42,865 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-10-11 17:21:42,866 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 109 transitions, 270 flow [2024-10-11 17:21:42,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:42,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:42,866 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] [2024-10-11 17:21:42,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:21:42,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:42,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1605414830, now seen corresponding path program 1 times [2024-10-11 17:21:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:42,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738760642] [2024-10-11 17:21:42,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738760642] [2024-10-11 17:21:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738760642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212871169] [2024-10-11 17:21:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:43,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:43,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 109 [2024-10-11 17:21:43,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 109 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:43,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:43,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 109 [2024-10-11 17:21:43,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:43,488 INFO L124 PetriNetUnfolderBase]: 298/1282 cut-off events. [2024-10-11 17:21:43,489 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-10-11 17:21:43,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 1282 events. 298/1282 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9634 event pairs, 130 based on Foata normal form. 0/1183 useless extension candidates. Maximal degree in co-relation 959. Up to 371 conditions per place. [2024-10-11 17:21:43,500 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 37 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2024-10-11 17:21:43,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 124 transitions, 384 flow [2024-10-11 17:21:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2024-10-11 17:21:43,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7981651376146789 [2024-10-11 17:21:43,502 INFO L175 Difference]: Start difference. First operand has 119 places, 109 transitions, 270 flow. Second operand 6 states and 522 transitions. [2024-10-11 17:21:43,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 124 transitions, 384 flow [2024-10-11 17:21:43,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 124 transitions, 372 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:21:43,506 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 266 flow [2024-10-11 17:21:43,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2024-10-11 17:21:43,507 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 7 predicate places. [2024-10-11 17:21:43,507 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 266 flow [2024-10-11 17:21:43,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:43,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:43,508 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] [2024-10-11 17:21:43,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:21:43,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:43,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash -55830766, now seen corresponding path program 1 times [2024-10-11 17:21:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:43,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375629067] [2024-10-11 17:21:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375629067] [2024-10-11 17:21:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375629067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:43,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:43,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:43,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336767675] [2024-10-11 17:21:43,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:43,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:43,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:43,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:43,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-10-11 17:21:43,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:43,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:43,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-10-11 17:21:43,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:43,706 INFO L124 PetriNetUnfolderBase]: 170/1036 cut-off events. [2024-10-11 17:21:43,706 INFO L125 PetriNetUnfolderBase]: For 196/323 co-relation queries the response was YES. [2024-10-11 17:21:43,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 1036 events. 170/1036 cut-off events. For 196/323 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7374 event pairs, 74 based on Foata normal form. 4/903 useless extension candidates. Maximal degree in co-relation 670. Up to 268 conditions per place. [2024-10-11 17:21:43,715 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 19 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2024-10-11 17:21:43,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 350 flow [2024-10-11 17:21:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-10-11 17:21:43,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.908256880733945 [2024-10-11 17:21:43,717 INFO L175 Difference]: Start difference. First operand has 116 places, 108 transitions, 266 flow. Second operand 3 states and 297 transitions. [2024-10-11 17:21:43,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 350 flow [2024-10-11 17:21:43,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 340 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:43,720 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 312 flow [2024-10-11 17:21:43,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2024-10-11 17:21:43,723 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places. [2024-10-11 17:21:43,723 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 312 flow [2024-10-11 17:21:43,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:43,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:43,723 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] [2024-10-11 17:21:43,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:21:43,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:43,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:43,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2098394380, now seen corresponding path program 1 times [2024-10-11 17:21:43,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:43,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853665289] [2024-10-11 17:21:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:43,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:21:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:44,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853665289] [2024-10-11 17:21:44,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853665289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:44,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:44,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:44,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286060211] [2024-10-11 17:21:44,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:44,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:44,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:44,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:44,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 109 [2024-10-11 17:21:44,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:44,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:44,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 109 [2024-10-11 17:21:44,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:44,398 INFO L124 PetriNetUnfolderBase]: 358/1837 cut-off events. [2024-10-11 17:21:44,398 INFO L125 PetriNetUnfolderBase]: For 312/360 co-relation queries the response was YES. [2024-10-11 17:21:44,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 1837 events. 358/1837 cut-off events. For 312/360 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 15485 event pairs, 179 based on Foata normal form. 4/1681 useless extension candidates. Maximal degree in co-relation 2430. Up to 362 conditions per place. [2024-10-11 17:21:44,413 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 34 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2024-10-11 17:21:44,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 128 transitions, 420 flow [2024-10-11 17:21:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2024-10-11 17:21:44,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8134556574923547 [2024-10-11 17:21:44,416 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 312 flow. Second operand 6 states and 532 transitions. [2024-10-11 17:21:44,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 128 transitions, 420 flow [2024-10-11 17:21:44,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 128 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:44,421 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 306 flow [2024-10-11 17:21:44,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2024-10-11 17:21:44,422 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2024-10-11 17:21:44,422 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 306 flow [2024-10-11 17:21:44,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:44,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:44,423 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] [2024-10-11 17:21:44,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:21:44,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:44,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -605015293, now seen corresponding path program 1 times [2024-10-11 17:21:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:44,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905324426] [2024-10-11 17:21:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:44,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:44,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:44,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905324426] [2024-10-11 17:21:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905324426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132946959] [2024-10-11 17:21:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:44,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:44,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:44,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:44,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:21:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:44,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:21:44,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:44,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:44,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132946959] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:44,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:44,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-11 17:21:44,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841099566] [2024-10-11 17:21:44,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:44,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:21:44,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:44,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:21:44,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:21:45,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2024-10-11 17:21:45,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 306 flow. Second operand has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:45,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:45,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2024-10-11 17:21:45,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:45,223 INFO L124 PetriNetUnfolderBase]: 159/1005 cut-off events. [2024-10-11 17:21:45,223 INFO L125 PetriNetUnfolderBase]: For 133/156 co-relation queries the response was YES. [2024-10-11 17:21:45,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 1005 events. 159/1005 cut-off events. For 133/156 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6713 event pairs, 37 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 950. Up to 159 conditions per place. [2024-10-11 17:21:45,231 INFO L140 encePairwiseOnDemand]: 99/109 looper letters, 27 selfloop transitions, 9 changer transitions 9/134 dead transitions. [2024-10-11 17:21:45,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 134 transitions, 444 flow [2024-10-11 17:21:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:21:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 17:21:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 726 transitions. [2024-10-11 17:21:45,234 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8325688073394495 [2024-10-11 17:21:45,234 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 306 flow. Second operand 8 states and 726 transitions. [2024-10-11 17:21:45,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 134 transitions, 444 flow [2024-10-11 17:21:45,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 134 transitions, 432 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:45,238 INFO L231 Difference]: Finished difference. Result has 122 places, 113 transitions, 329 flow [2024-10-11 17:21:45,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2024-10-11 17:21:45,239 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 13 predicate places. [2024-10-11 17:21:45,239 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 329 flow [2024-10-11 17:21:45,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:45,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:45,240 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] [2024-10-11 17:21:45,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:21:45,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 17:21:45,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:45,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1309900068, now seen corresponding path program 1 times [2024-10-11 17:21:45,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:45,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174828406] [2024-10-11 17:21:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:21:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174828406] [2024-10-11 17:21:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174828406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:45,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:45,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346690208] [2024-10-11 17:21:45,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:45,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:45,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:45,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:45,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:45,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-10-11 17:21:45,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:45,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:45,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-10-11 17:21:45,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:45,595 INFO L124 PetriNetUnfolderBase]: 56/628 cut-off events. [2024-10-11 17:21:45,596 INFO L125 PetriNetUnfolderBase]: For 230/295 co-relation queries the response was YES. [2024-10-11 17:21:45,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 628 events. 56/628 cut-off events. For 230/295 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3800 event pairs, 30 based on Foata normal form. 3/608 useless extension candidates. Maximal degree in co-relation 935. Up to 119 conditions per place. [2024-10-11 17:21:45,602 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 19 selfloop transitions, 7 changer transitions 1/120 dead transitions. [2024-10-11 17:21:45,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 406 flow [2024-10-11 17:21:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2024-10-11 17:21:45,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9051987767584098 [2024-10-11 17:21:45,604 INFO L175 Difference]: Start difference. First operand has 122 places, 113 transitions, 329 flow. Second operand 3 states and 296 transitions. [2024-10-11 17:21:45,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 406 flow [2024-10-11 17:21:45,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 120 transitions, 400 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:21:45,608 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 373 flow [2024-10-11 17:21:45,608 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2024-10-11 17:21:45,610 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 14 predicate places. [2024-10-11 17:21:45,610 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 373 flow [2024-10-11 17:21:45,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:45,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:45,610 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 17:21:45,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:21:45,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:45,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash -354026671, now seen corresponding path program 1 times [2024-10-11 17:21:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:45,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164582543] [2024-10-11 17:21:45,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:45,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:21:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:45,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:21:45,672 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:21:45,672 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-11 17:21:45,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-10-11 17:21:45,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-10-11 17:21:45,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-10-11 17:21:45,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-10-11 17:21:45,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-10-11 17:21:45,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-10-11 17:21:45,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:21:45,674 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:45,674 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:21:45,674 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:21:45,701 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:21:45,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 127 transitions, 281 flow [2024-10-11 17:21:45,735 INFO L124 PetriNetUnfolderBase]: 21/350 cut-off events. [2024-10-11 17:21:45,736 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-11 17:21:45,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 350 events. 21/350 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 958 event pairs, 1 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 220. Up to 16 conditions per place. [2024-10-11 17:21:45,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 127 transitions, 281 flow [2024-10-11 17:21:45,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 127 transitions, 281 flow [2024-10-11 17:21:45,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:21:45,743 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;@2196c5d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:21:45,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 17:21:45,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:21:45,748 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-11 17:21:45,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:21:45,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:45,748 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] [2024-10-11 17:21:45,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:45,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:45,749 INFO L85 PathProgramCache]: Analyzing trace with hash -964600847, now seen corresponding path program 1 times [2024-10-11 17:21:45,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:45,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714471302] [2024-10-11 17:21:45,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:45,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:45,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:45,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714471302] [2024-10-11 17:21:45,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714471302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:45,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:45,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:45,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038068614] [2024-10-11 17:21:45,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:45,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:45,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:45,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:45,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:45,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 127 [2024-10-11 17:21:45,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:45,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:45,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 127 [2024-10-11 17:21:45,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:46,320 INFO L124 PetriNetUnfolderBase]: 1071/4022 cut-off events. [2024-10-11 17:21:46,320 INFO L125 PetriNetUnfolderBase]: For 404/509 co-relation queries the response was YES. [2024-10-11 17:21:46,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5937 conditions, 4022 events. 1071/4022 cut-off events. For 404/509 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 36243 event pairs, 542 based on Foata normal form. 180/3761 useless extension candidates. Maximal degree in co-relation 4652. Up to 1110 conditions per place. [2024-10-11 17:21:46,355 INFO L140 encePairwiseOnDemand]: 118/127 looper letters, 23 selfloop transitions, 5 changer transitions 1/134 dead transitions. [2024-10-11 17:21:46,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 351 flow [2024-10-11 17:21:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2024-10-11 17:21:46,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9186351706036745 [2024-10-11 17:21:46,357 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 281 flow. Second operand 3 states and 350 transitions. [2024-10-11 17:21:46,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 351 flow [2024-10-11 17:21:46,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 351 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:21:46,361 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 311 flow [2024-10-11 17:21:46,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2024-10-11 17:21:46,362 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places. [2024-10-11 17:21:46,363 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 311 flow [2024-10-11 17:21:46,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:46,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:46,363 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] [2024-10-11 17:21:46,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:21:46,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:46,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash 853939566, now seen corresponding path program 1 times [2024-10-11 17:21:46,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:46,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535206960] [2024-10-11 17:21:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:46,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:46,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535206960] [2024-10-11 17:21:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535206960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:46,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:46,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808395481] [2024-10-11 17:21:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:46,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:46,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:46,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:46,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 127 [2024-10-11 17:21:46,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:46,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:46,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 127 [2024-10-11 17:21:46,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:47,733 INFO L124 PetriNetUnfolderBase]: 1992/6696 cut-off events. [2024-10-11 17:21:47,733 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2024-10-11 17:21:47,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10664 conditions, 6696 events. 1992/6696 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 66948 event pairs, 898 based on Foata normal form. 0/6018 useless extension candidates. Maximal degree in co-relation 6902. Up to 2168 conditions per place. [2024-10-11 17:21:47,796 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 48 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2024-10-11 17:21:47,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 150 transitions, 463 flow [2024-10-11 17:21:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2024-10-11 17:21:47,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8110236220472441 [2024-10-11 17:21:47,798 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 311 flow. Second operand 6 states and 618 transitions. [2024-10-11 17:21:47,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 150 transitions, 463 flow [2024-10-11 17:21:47,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 150 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:47,806 INFO L231 Difference]: Finished difference. Result has 133 places, 126 transitions, 309 flow [2024-10-11 17:21:47,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=133, PETRI_TRANSITIONS=126} [2024-10-11 17:21:47,808 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2024-10-11 17:21:47,808 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 126 transitions, 309 flow [2024-10-11 17:21:47,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:47,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:47,809 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] [2024-10-11 17:21:47,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:21:47,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:47,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash 548744745, now seen corresponding path program 1 times [2024-10-11 17:21:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:47,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033304618] [2024-10-11 17:21:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:47,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:47,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033304618] [2024-10-11 17:21:47,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033304618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:47,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:47,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:47,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65511112] [2024-10-11 17:21:47,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:47,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:21:47,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:47,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:21:47,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:21:47,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2024-10-11 17:21:47,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 126 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:47,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:47,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2024-10-11 17:21:47,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:48,795 INFO L124 PetriNetUnfolderBase]: 1326/6241 cut-off events. [2024-10-11 17:21:48,796 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2024-10-11 17:21:48,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8873 conditions, 6241 events. 1326/6241 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 63418 event pairs, 760 based on Foata normal form. 1/5483 useless extension candidates. Maximal degree in co-relation 3021. Up to 1720 conditions per place. [2024-10-11 17:21:48,839 INFO L140 encePairwiseOnDemand]: 119/127 looper letters, 24 selfloop transitions, 2 changer transitions 5/134 dead transitions. [2024-10-11 17:21:48,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 387 flow [2024-10-11 17:21:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2024-10-11 17:21:48,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8372703412073491 [2024-10-11 17:21:48,892 INFO L175 Difference]: Start difference. First operand has 133 places, 126 transitions, 309 flow. Second operand 6 states and 638 transitions. [2024-10-11 17:21:48,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 387 flow [2024-10-11 17:21:48,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 134 transitions, 377 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:48,895 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 321 flow [2024-10-11 17:21:48,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2024-10-11 17:21:48,896 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2024-10-11 17:21:48,896 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 321 flow [2024-10-11 17:21:48,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:48,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:48,897 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] [2024-10-11 17:21:48,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:21:48,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:48,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash -76812734, now seen corresponding path program 1 times [2024-10-11 17:21:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:48,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807667684] [2024-10-11 17:21:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:48,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807667684] [2024-10-11 17:21:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807667684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:48,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:48,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:48,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831508753] [2024-10-11 17:21:48,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:48,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:48,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:48,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2024-10-11 17:21:48,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:48,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:48,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2024-10-11 17:21:48,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:49,902 INFO L124 PetriNetUnfolderBase]: 1740/6603 cut-off events. [2024-10-11 17:21:49,902 INFO L125 PetriNetUnfolderBase]: For 1550/2155 co-relation queries the response was YES. [2024-10-11 17:21:49,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11194 conditions, 6603 events. 1740/6603 cut-off events. For 1550/2155 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 68778 event pairs, 967 based on Foata normal form. 10/5862 useless extension candidates. Maximal degree in co-relation 11135. Up to 2240 conditions per place. [2024-10-11 17:21:49,966 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 29 selfloop transitions, 9 changer transitions 0/142 dead transitions. [2024-10-11 17:21:49,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 142 transitions, 455 flow [2024-10-11 17:21:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-10-11 17:21:49,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9081364829396326 [2024-10-11 17:21:49,968 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 321 flow. Second operand 3 states and 346 transitions. [2024-10-11 17:21:49,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 142 transitions, 455 flow [2024-10-11 17:21:49,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 443 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:21:49,981 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 385 flow [2024-10-11 17:21:49,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2024-10-11 17:21:49,981 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2024-10-11 17:21:49,982 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 385 flow [2024-10-11 17:21:49,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:49,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:49,982 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] [2024-10-11 17:21:49,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:21:49,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:49,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash -736876325, now seen corresponding path program 1 times [2024-10-11 17:21:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:49,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717006001] [2024-10-11 17:21:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:21:50,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:50,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717006001] [2024-10-11 17:21:50,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717006001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:50,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:50,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834186788] [2024-10-11 17:21:50,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:50,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:50,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:50,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 127 [2024-10-11 17:21:50,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:50,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:50,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 127 [2024-10-11 17:21:50,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:51,663 INFO L124 PetriNetUnfolderBase]: 2874/10393 cut-off events. [2024-10-11 17:21:51,664 INFO L125 PetriNetUnfolderBase]: For 1726/2295 co-relation queries the response was YES. [2024-10-11 17:21:51,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17543 conditions, 10393 events. 2874/10393 cut-off events. For 1726/2295 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 114908 event pairs, 1408 based on Foata normal form. 27/9250 useless extension candidates. Maximal degree in co-relation 13956. Up to 2157 conditions per place. [2024-10-11 17:21:51,755 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 46 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2024-10-11 17:21:51,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 157 transitions, 533 flow [2024-10-11 17:21:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2024-10-11 17:21:51,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8241469816272966 [2024-10-11 17:21:51,758 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 385 flow. Second operand 6 states and 628 transitions. [2024-10-11 17:21:51,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 157 transitions, 533 flow [2024-10-11 17:21:51,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 157 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:51,771 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 375 flow [2024-10-11 17:21:51,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2024-10-11 17:21:51,772 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 8 predicate places. [2024-10-11 17:21:51,772 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 375 flow [2024-10-11 17:21:51,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:51,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:51,773 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] [2024-10-11 17:21:51,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:21:51,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:51,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash -571759414, now seen corresponding path program 1 times [2024-10-11 17:21:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:51,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503002236] [2024-10-11 17:21:51,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503002236] [2024-10-11 17:21:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503002236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902481524] [2024-10-11 17:21:51,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:51,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:51,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:51,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:21:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:52,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:21:52,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:52,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:52,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902481524] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:52,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:52,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-11 17:21:52,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040522680] [2024-10-11 17:21:52,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:21:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:52,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:21:52,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:21:52,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 127 [2024-10-11 17:21:52,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 375 flow. Second operand has 9 states, 9 states have (on average 101.22222222222223) internal successors, (911), 9 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:52,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:52,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 127 [2024-10-11 17:21:52,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:53,183 INFO L124 PetriNetUnfolderBase]: 1466/6315 cut-off events. [2024-10-11 17:21:53,183 INFO L125 PetriNetUnfolderBase]: For 963/1188 co-relation queries the response was YES. [2024-10-11 17:21:53,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10653 conditions, 6315 events. 1466/6315 cut-off events. For 963/1188 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 64144 event pairs, 542 based on Foata normal form. 1/5719 useless extension candidates. Maximal degree in co-relation 5875. Up to 1078 conditions per place. [2024-10-11 17:21:53,230 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 48 selfloop transitions, 10 changer transitions 0/165 dead transitions. [2024-10-11 17:21:53,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 165 transitions, 566 flow [2024-10-11 17:21:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:21:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 17:21:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 851 transitions. [2024-10-11 17:21:53,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8375984251968503 [2024-10-11 17:21:53,233 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 375 flow. Second operand 8 states and 851 transitions. [2024-10-11 17:21:53,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 165 transitions, 566 flow [2024-10-11 17:21:53,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 165 transitions, 554 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:53,239 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 409 flow [2024-10-11 17:21:53,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=409, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2024-10-11 17:21:53,240 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 13 predicate places. [2024-10-11 17:21:53,240 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 409 flow [2024-10-11 17:21:53,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.22222222222223) internal successors, (911), 9 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:53,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:53,241 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] [2024-10-11 17:21:53,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:21:53,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:53,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:53,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash 909388675, now seen corresponding path program 1 times [2024-10-11 17:21:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:53,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194127112] [2024-10-11 17:21:53,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:53,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:21:53,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:53,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194127112] [2024-10-11 17:21:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194127112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:53,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:53,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:53,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903988004] [2024-10-11 17:21:53,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:53,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:53,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:53,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:53,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2024-10-11 17:21:53,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:53,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:53,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2024-10-11 17:21:53,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:54,120 INFO L124 PetriNetUnfolderBase]: 1088/4910 cut-off events. [2024-10-11 17:21:54,121 INFO L125 PetriNetUnfolderBase]: For 2489/2728 co-relation queries the response was YES. [2024-10-11 17:21:54,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9302 conditions, 4910 events. 1088/4910 cut-off events. For 2489/2728 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 51446 event pairs, 589 based on Foata normal form. 8/4547 useless extension candidates. Maximal degree in co-relation 8493. Up to 1450 conditions per place. [2024-10-11 17:21:54,179 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 31 selfloop transitions, 13 changer transitions 0/152 dead transitions. [2024-10-11 17:21:54,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 570 flow [2024-10-11 17:21:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2024-10-11 17:21:54,181 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905511811023622 [2024-10-11 17:21:54,181 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 409 flow. Second operand 3 states and 345 transitions. [2024-10-11 17:21:54,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 570 flow [2024-10-11 17:21:54,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 152 transitions, 564 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:21:54,190 INFO L231 Difference]: Finished difference. Result has 142 places, 145 transitions, 521 flow [2024-10-11 17:21:54,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=142, PETRI_TRANSITIONS=145} [2024-10-11 17:21:54,191 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places. [2024-10-11 17:21:54,191 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 145 transitions, 521 flow [2024-10-11 17:21:54,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:54,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:54,193 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] [2024-10-11 17:21:54,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:21:54,194 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:54,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash 744566551, now seen corresponding path program 1 times [2024-10-11 17:21:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:54,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175387129] [2024-10-11 17:21:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:21:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:54,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175387129] [2024-10-11 17:21:54,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175387129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:54,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:54,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:21:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480942440] [2024-10-11 17:21:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:54,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:54,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 127 [2024-10-11 17:21:54,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:54,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:54,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 127 [2024-10-11 17:21:54,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:54,488 INFO L124 PetriNetUnfolderBase]: 117/1565 cut-off events. [2024-10-11 17:21:54,488 INFO L125 PetriNetUnfolderBase]: For 701/743 co-relation queries the response was YES. [2024-10-11 17:21:54,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1565 events. 117/1565 cut-off events. For 701/743 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 12762 event pairs, 43 based on Foata normal form. 21/1532 useless extension candidates. Maximal degree in co-relation 2169. Up to 144 conditions per place. [2024-10-11 17:21:54,499 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 12 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2024-10-11 17:21:54,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 494 flow [2024-10-11 17:21:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2024-10-11 17:21:54,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9291338582677166 [2024-10-11 17:21:54,500 INFO L175 Difference]: Start difference. First operand has 142 places, 145 transitions, 521 flow. Second operand 3 states and 354 transitions. [2024-10-11 17:21:54,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 494 flow [2024-10-11 17:21:54,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 140 transitions, 480 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:54,506 INFO L231 Difference]: Finished difference. Result has 142 places, 135 transitions, 425 flow [2024-10-11 17:21:54,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=142, PETRI_TRANSITIONS=135} [2024-10-11 17:21:54,507 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places. [2024-10-11 17:21:54,507 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 135 transitions, 425 flow [2024-10-11 17:21:54,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:54,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:54,507 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 17:21:54,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:21:54,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:54,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -347694239, now seen corresponding path program 1 times [2024-10-11 17:21:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:54,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805646572] [2024-10-11 17:21:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 17:21:54,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:54,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805646572] [2024-10-11 17:21:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805646572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671439571] [2024-10-11 17:21:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:54,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:54,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2024-10-11 17:21:54,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 135 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:54,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:54,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2024-10-11 17:21:54,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:54,749 INFO L124 PetriNetUnfolderBase]: 203/1858 cut-off events. [2024-10-11 17:21:54,750 INFO L125 PetriNetUnfolderBase]: For 1333/1398 co-relation queries the response was YES. [2024-10-11 17:21:54,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 1858 events. 203/1858 cut-off events. For 1333/1398 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 16383 event pairs, 134 based on Foata normal form. 3/1769 useless extension candidates. Maximal degree in co-relation 2979. Up to 435 conditions per place. [2024-10-11 17:21:54,759 INFO L140 encePairwiseOnDemand]: 122/127 looper letters, 25 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2024-10-11 17:21:54,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 507 flow [2024-10-11 17:21:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2024-10-11 17:21:54,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8871391076115486 [2024-10-11 17:21:54,762 INFO L175 Difference]: Start difference. First operand has 142 places, 135 transitions, 425 flow. Second operand 3 states and 338 transitions. [2024-10-11 17:21:54,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 507 flow [2024-10-11 17:21:54,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:21:54,768 INFO L231 Difference]: Finished difference. Result has 145 places, 138 transitions, 459 flow [2024-10-11 17:21:54,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=145, PETRI_TRANSITIONS=138} [2024-10-11 17:21:54,769 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 17 predicate places. [2024-10-11 17:21:54,769 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 138 transitions, 459 flow [2024-10-11 17:21:54,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:54,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:54,770 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:54,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:21:54,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:54,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1089870802, now seen corresponding path program 1 times [2024-10-11 17:21:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:54,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550807033] [2024-10-11 17:21:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:54,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:21:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:54,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:21:54,842 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:21:54,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-10-11 17:21:54,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-10-11 17:21:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-10-11 17:21:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-10-11 17:21:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-10-11 17:21:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-10-11 17:21:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-10-11 17:21:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-10-11 17:21:54,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:21:54,844 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:54,846 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:21:54,846 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 17:21:54,872 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 17:21:54,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 145 transitions, 330 flow [2024-10-11 17:21:54,944 INFO L124 PetriNetUnfolderBase]: 43/592 cut-off events. [2024-10-11 17:21:54,944 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 17:21:54,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 592 events. 43/592 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2112 event pairs, 6 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 370. Up to 32 conditions per place. [2024-10-11 17:21:54,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 145 transitions, 330 flow [2024-10-11 17:21:54,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 145 transitions, 330 flow [2024-10-11 17:21:54,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:21:54,954 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;@2196c5d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:21:54,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-11 17:21:54,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:21:54,957 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-11 17:21:54,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:21:54,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:54,957 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] [2024-10-11 17:21:54,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:21:54,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1930538991, now seen corresponding path program 1 times [2024-10-11 17:21:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906891143] [2024-10-11 17:21:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:54,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:54,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906891143] [2024-10-11 17:21:54,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906891143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:54,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:54,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:54,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616523400] [2024-10-11 17:21:54,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:54,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:54,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:54,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:55,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 145 [2024-10-11 17:21:55,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:55,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:55,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 145 [2024-10-11 17:21:55,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:57,861 INFO L124 PetriNetUnfolderBase]: 7859/23535 cut-off events. [2024-10-11 17:21:57,861 INFO L125 PetriNetUnfolderBase]: For 2417/2768 co-relation queries the response was YES. [2024-10-11 17:21:57,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35885 conditions, 23535 events. 7859/23535 cut-off events. For 2417/2768 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 271409 event pairs, 4292 based on Foata normal form. 871/22186 useless extension candidates. Maximal degree in co-relation 28583. Up to 7653 conditions per place. [2024-10-11 17:21:58,128 INFO L140 encePairwiseOnDemand]: 135/145 looper letters, 30 selfloop transitions, 6 changer transitions 1/155 dead transitions. [2024-10-11 17:21:58,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 155 transitions, 422 flow [2024-10-11 17:21:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2024-10-11 17:21:58,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126436781609195 [2024-10-11 17:21:58,132 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 330 flow. Second operand 3 states and 397 transitions. [2024-10-11 17:21:58,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 155 transitions, 422 flow [2024-10-11 17:21:58,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 155 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:21:58,136 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 368 flow [2024-10-11 17:21:58,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2024-10-11 17:21:58,137 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 4 predicate places. [2024-10-11 17:21:58,137 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 368 flow [2024-10-11 17:21:58,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:58,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:58,138 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] [2024-10-11 17:21:58,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:21:58,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:21:58,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash 300323758, now seen corresponding path program 1 times [2024-10-11 17:21:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134512793] [2024-10-11 17:21:58,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:58,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:58,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134512793] [2024-10-11 17:21:58,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134512793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:58,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:58,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282861416] [2024-10-11 17:21:58,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:58,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:58,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:58,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 145 [2024-10-11 17:21:58,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:58,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:58,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 145 [2024-10-11 17:21:58,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:01,896 INFO L124 PetriNetUnfolderBase]: 13638/36400 cut-off events. [2024-10-11 17:22:01,896 INFO L125 PetriNetUnfolderBase]: For 3211/3211 co-relation queries the response was YES. [2024-10-11 17:22:02,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60528 conditions, 36400 events. 13638/36400 cut-off events. For 3211/3211 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 435337 event pairs, 2826 based on Foata normal form. 0/31775 useless extension candidates. Maximal degree in co-relation 35745. Up to 13302 conditions per place. [2024-10-11 17:22:02,340 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 60 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2024-10-11 17:22:02,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 177 transitions, 560 flow [2024-10-11 17:22:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:22:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:22:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2024-10-11 17:22:02,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8206896551724138 [2024-10-11 17:22:02,343 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 368 flow. Second operand 6 states and 714 transitions. [2024-10-11 17:22:02,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 177 transitions, 560 flow [2024-10-11 17:22:02,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 177 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:22:02,491 INFO L231 Difference]: Finished difference. Result has 152 places, 145 transitions, 364 flow [2024-10-11 17:22:02,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=152, PETRI_TRANSITIONS=145} [2024-10-11 17:22:02,491 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 5 predicate places. [2024-10-11 17:22:02,491 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 145 transitions, 364 flow [2024-10-11 17:22:02,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:02,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:02,492 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] [2024-10-11 17:22:02,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:22:02,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:02,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash -4871063, now seen corresponding path program 1 times [2024-10-11 17:22:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:02,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071286214] [2024-10-11 17:22:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:22:02,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:02,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071286214] [2024-10-11 17:22:02,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071286214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:22:02,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:22:02,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:22:02,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543311788] [2024-10-11 17:22:02,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:22:02,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:22:02,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:02,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:22:02,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:22:02,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 145 [2024-10-11 17:22:02,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 145 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:02,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:02,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 145 [2024-10-11 17:22:02,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:05,589 INFO L124 PetriNetUnfolderBase]: 9343/33719 cut-off events. [2024-10-11 17:22:05,589 INFO L125 PetriNetUnfolderBase]: For 1637/1637 co-relation queries the response was YES. [2024-10-11 17:22:05,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49426 conditions, 33719 events. 9343/33719 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 429793 event pairs, 7523 based on Foata normal form. 1/29645 useless extension candidates. Maximal degree in co-relation 31640. Up to 10778 conditions per place. [2024-10-11 17:22:05,994 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 28 selfloop transitions, 2 changer transitions 5/153 dead transitions. [2024-10-11 17:22:05,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 153 transitions, 450 flow [2024-10-11 17:22:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:22:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:22:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2024-10-11 17:22:05,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8344827586206897 [2024-10-11 17:22:05,996 INFO L175 Difference]: Start difference. First operand has 152 places, 145 transitions, 364 flow. Second operand 6 states and 726 transitions. [2024-10-11 17:22:05,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 153 transitions, 450 flow [2024-10-11 17:22:06,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 153 transitions, 440 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:22:06,003 INFO L231 Difference]: Finished difference. Result has 156 places, 146 transitions, 376 flow [2024-10-11 17:22:06,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=156, PETRI_TRANSITIONS=146} [2024-10-11 17:22:06,003 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2024-10-11 17:22:06,003 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 376 flow [2024-10-11 17:22:06,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:06,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:06,004 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] [2024-10-11 17:22:06,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:22:06,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:06,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash 540197122, now seen corresponding path program 1 times [2024-10-11 17:22:06,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:06,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444521408] [2024-10-11 17:22:06,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:06,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:22:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444521408] [2024-10-11 17:22:06,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444521408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:22:06,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:22:06,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:22:06,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078455919] [2024-10-11 17:22:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:22:06,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:22:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:06,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:22:06,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:22:06,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-10-11 17:22:06,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:06,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:06,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-10-11 17:22:06,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:10,869 INFO L124 PetriNetUnfolderBase]: 13629/41376 cut-off events. [2024-10-11 17:22:10,869 INFO L125 PetriNetUnfolderBase]: For 10673/13732 co-relation queries the response was YES. [2024-10-11 17:22:11,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72233 conditions, 41376 events. 13629/41376 cut-off events. For 10673/13732 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 530347 event pairs, 7860 based on Foata normal form. 36/36839 useless extension candidates. Maximal degree in co-relation 72173. Up to 15880 conditions per place. [2024-10-11 17:22:11,251 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 39 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2024-10-11 17:22:11,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 167 transitions, 562 flow [2024-10-11 17:22:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:22:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:22:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-10-11 17:22:11,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2024-10-11 17:22:11,253 INFO L175 Difference]: Start difference. First operand has 156 places, 146 transitions, 376 flow. Second operand 3 states and 395 transitions. [2024-10-11 17:22:11,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 167 transitions, 562 flow [2024-10-11 17:22:11,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 167 transitions, 550 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:22:11,397 INFO L231 Difference]: Finished difference. Result has 153 places, 155 transitions, 460 flow [2024-10-11 17:22:11,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2024-10-11 17:22:11,398 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 6 predicate places. [2024-10-11 17:22:11,398 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 460 flow [2024-10-11 17:22:11,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:11,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:11,399 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] [2024-10-11 17:22:11,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:22:11,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:11,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash 126632508, now seen corresponding path program 1 times [2024-10-11 17:22:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855334445] [2024-10-11 17:22:11,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:11,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:22:11,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:11,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855334445] [2024-10-11 17:22:11,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855334445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:22:11,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:22:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:22:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731470692] [2024-10-11 17:22:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:22:11,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:22:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:11,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:22:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:22:11,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 145 [2024-10-11 17:22:11,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:11,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:11,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 145 [2024-10-11 17:22:11,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:17,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [120#L1038-1true, 132#L1024true, 172#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 147#true, Black: 152#(= |#race~data~0| 0), 46#L1022-3true, 58#L1023-5true, 144#true, 142#true]) [2024-10-11 17:22:17,127 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-11 17:22:17,127 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-11 17:22:17,127 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-11 17:22:17,127 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-11 17:22:17,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][184], [120#L1038-1true, 24#L1023-5true, 172#true, 148#true, 100#L1023-6true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-10-11 17:22:17,469 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-11 17:22:17,469 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-11 17:22:17,470 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-11 17:22:17,470 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-11 17:22:17,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [120#L1038-1true, 114#L1023-5true, 172#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 147#true, 21#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 144#true, 142#true]) [2024-10-11 17:22:17,544 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-11 17:22:17,544 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-11 17:22:17,545 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-11 17:22:17,545 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-11 17:22:18,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][179], [120#L1038-1true, 24#L1023-5true, 132#L1024true, 172#true, 148#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-10-11 17:22:18,134 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2024-10-11 17:22:18,134 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-11 17:22:18,134 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-11 17:22:18,134 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-11 17:22:18,785 INFO L124 PetriNetUnfolderBase]: 19999/58031 cut-off events. [2024-10-11 17:22:18,786 INFO L125 PetriNetUnfolderBase]: For 9636/13605 co-relation queries the response was YES. [2024-10-11 17:22:19,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100957 conditions, 58031 events. 19999/58031 cut-off events. For 9636/13605 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 761259 event pairs, 9797 based on Foata normal form. 80/50818 useless extension candidates. Maximal degree in co-relation 79535. Up to 12713 conditions per place. [2024-10-11 17:22:19,332 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 58 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2024-10-11 17:22:19,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 186 transitions, 648 flow [2024-10-11 17:22:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:22:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:22:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2024-10-11 17:22:19,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.832183908045977 [2024-10-11 17:22:19,334 INFO L175 Difference]: Start difference. First operand has 153 places, 155 transitions, 460 flow. Second operand 6 states and 724 transitions. [2024-10-11 17:22:19,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 186 transitions, 648 flow [2024-10-11 17:22:19,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 186 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:22:19,416 INFO L231 Difference]: Finished difference. Result has 155 places, 154 transitions, 446 flow [2024-10-11 17:22:19,416 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2024-10-11 17:22:19,417 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2024-10-11 17:22:19,417 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 446 flow [2024-10-11 17:22:19,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:19,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:19,417 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] [2024-10-11 17:22:19,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:22:19,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:19,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1581356987, now seen corresponding path program 1 times [2024-10-11 17:22:19,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:19,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142512005] [2024-10-11 17:22:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:22:19,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142512005] [2024-10-11 17:22:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142512005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:22:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391061056] [2024-10-11 17:22:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:19,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:22:19,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:22:19,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:22:19,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:22:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:19,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:22:19,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:22:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:22:19,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:22:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:22:19,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391061056] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:22:19,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:22:19,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-11 17:22:19,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845892616] [2024-10-11 17:22:19,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:22:19,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:22:19,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:22:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:22:20,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 145 [2024-10-11 17:22:20,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 446 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:20,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:20,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 145 [2024-10-11 17:22:20,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:23,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][192], [120#L1038-1true, 24#L1023-5true, 100#L1023-6true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 148#true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-10-11 17:22:23,167 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-11 17:22:23,167 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-11 17:22:23,168 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-11 17:22:23,168 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-11 17:22:23,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][190], [120#L1038-1true, 24#L1023-5true, 132#L1024true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 148#true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-10-11 17:22:23,900 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2024-10-11 17:22:23,900 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-11 17:22:23,900 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-11 17:22:23,900 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-11 17:22:24,296 INFO L124 PetriNetUnfolderBase]: 11192/37624 cut-off events. [2024-10-11 17:22:24,296 INFO L125 PetriNetUnfolderBase]: For 6000/7803 co-relation queries the response was YES. [2024-10-11 17:22:24,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64698 conditions, 37624 events. 11192/37624 cut-off events. For 6000/7803 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 482348 event pairs, 3970 based on Foata normal form. 15/33084 useless extension candidates. Maximal degree in co-relation 32683. Up to 6542 conditions per place. [2024-10-11 17:22:24,585 INFO L140 encePairwiseOnDemand]: 135/145 looper letters, 61 selfloop transitions, 10 changer transitions 0/195 dead transitions. [2024-10-11 17:22:24,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 195 transitions, 684 flow [2024-10-11 17:22:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:22:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 17:22:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 976 transitions. [2024-10-11 17:22:24,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8413793103448276 [2024-10-11 17:22:24,587 INFO L175 Difference]: Start difference. First operand has 155 places, 154 transitions, 446 flow. Second operand 8 states and 976 transitions. [2024-10-11 17:22:24,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 195 transitions, 684 flow [2024-10-11 17:22:24,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 195 transitions, 672 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:22:24,611 INFO L231 Difference]: Finished difference. Result has 160 places, 157 transitions, 480 flow [2024-10-11 17:22:24,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=480, PETRI_PLACES=160, PETRI_TRANSITIONS=157} [2024-10-11 17:22:24,612 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 13 predicate places. [2024-10-11 17:22:24,612 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 157 transitions, 480 flow [2024-10-11 17:22:24,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:24,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:24,613 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] [2024-10-11 17:22:24,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:22:24,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:22:24,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:24,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash -900737980, now seen corresponding path program 1 times [2024-10-11 17:22:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:24,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783761671] [2024-10-11 17:22:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:22:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:24,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783761671] [2024-10-11 17:22:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783761671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:22:24,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:22:24,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:22:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730836380] [2024-10-11 17:22:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:22:24,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:22:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:22:24,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:22:24,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-10-11 17:22:24,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 157 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:24,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:24,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-10-11 17:22:24,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:29,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([550] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [Black: 185#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 188#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 145#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 100#L1023-6true, 71#L1038true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 34#L1024true, 147#true, Black: 150#true, 547#true, 144#true, 142#true]) [2024-10-11 17:22:29,596 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-10-11 17:22:29,596 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-11 17:22:29,596 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-11 17:22:29,596 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-11 17:22:29,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([550] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [Black: 185#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 188#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 145#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 100#L1023-6true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 71#L1038true, 119#L1024-3true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 147#true, Black: 150#true, 547#true, 144#true, 142#true]) [2024-10-11 17:22:29,606 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-10-11 17:22:29,606 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-11 17:22:29,606 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-11 17:22:29,606 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-11 17:22:29,658 INFO L124 PetriNetUnfolderBase]: 11771/39207 cut-off events. [2024-10-11 17:22:29,658 INFO L125 PetriNetUnfolderBase]: For 22855/25072 co-relation queries the response was YES. [2024-10-11 17:22:29,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77047 conditions, 39207 events. 11771/39207 cut-off events. For 22855/25072 co-relation queries the response was YES. Maximal size of possible extension queue 1521. Compared 529642 event pairs, 6498 based on Foata normal form. 35/35580 useless extension candidates. Maximal degree in co-relation 69546. Up to 13618 conditions per place. [2024-10-11 17:22:29,973 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 43 selfloop transitions, 18 changer transitions 0/182 dead transitions. [2024-10-11 17:22:29,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 182 transitions, 725 flow [2024-10-11 17:22:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:22:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:22:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2024-10-11 17:22:29,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9057471264367816 [2024-10-11 17:22:29,974 INFO L175 Difference]: Start difference. First operand has 160 places, 157 transitions, 480 flow. Second operand 3 states and 394 transitions. [2024-10-11 17:22:29,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 182 transitions, 725 flow [2024-10-11 17:22:30,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 182 transitions, 719 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:22:30,001 INFO L231 Difference]: Finished difference. Result has 161 places, 171 transitions, 652 flow [2024-10-11 17:22:30,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=161, PETRI_TRANSITIONS=171} [2024-10-11 17:22:30,002 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2024-10-11 17:22:30,002 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 171 transitions, 652 flow [2024-10-11 17:22:30,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:30,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:30,003 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] [2024-10-11 17:22:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 17:22:30,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:30,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1714902840, now seen corresponding path program 1 times [2024-10-11 17:22:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048978632] [2024-10-11 17:22:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:22:30,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:30,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048978632] [2024-10-11 17:22:30,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048978632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:22:30,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:22:30,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:22:30,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154497720] [2024-10-11 17:22:30,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:22:30,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:22:30,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:30,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:22:30,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:22:30,073 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 145 [2024-10-11 17:22:30,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 171 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:30,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:30,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 145 [2024-10-11 17:22:30,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:30,869 INFO L124 PetriNetUnfolderBase]: 660/6386 cut-off events. [2024-10-11 17:22:30,869 INFO L125 PetriNetUnfolderBase]: For 3202/3390 co-relation queries the response was YES. [2024-10-11 17:22:30,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11149 conditions, 6386 events. 660/6386 cut-off events. For 3202/3390 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 73150 event pairs, 237 based on Foata normal form. 177/6223 useless extension candidates. Maximal degree in co-relation 8698. Up to 678 conditions per place. [2024-10-11 17:22:30,894 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 16 selfloop transitions, 8 changer transitions 0/161 dead transitions. [2024-10-11 17:22:30,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 585 flow [2024-10-11 17:22:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:22:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:22:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2024-10-11 17:22:30,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9264367816091954 [2024-10-11 17:22:30,895 INFO L175 Difference]: Start difference. First operand has 161 places, 171 transitions, 652 flow. Second operand 3 states and 403 transitions. [2024-10-11 17:22:30,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 585 flow [2024-10-11 17:22:30,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 161 transitions, 571 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 17:22:30,908 INFO L231 Difference]: Finished difference. Result has 161 places, 154 transitions, 492 flow [2024-10-11 17:22:30,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=161, PETRI_TRANSITIONS=154} [2024-10-11 17:22:30,909 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2024-10-11 17:22:30,909 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 492 flow [2024-10-11 17:22:30,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:30,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:30,910 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 17:22:30,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 17:22:30,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:30,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2046835631, now seen corresponding path program 1 times [2024-10-11 17:22:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76964392] [2024-10-11 17:22:30,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:30,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 17:22:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76964392] [2024-10-11 17:22:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76964392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:22:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:22:30,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:22:30,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772132304] [2024-10-11 17:22:30,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:22:30,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:22:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:30,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:22:30,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:22:30,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-10-11 17:22:30,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:30,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:30,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-10-11 17:22:30,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:32,121 INFO L124 PetriNetUnfolderBase]: 1114/7737 cut-off events. [2024-10-11 17:22:32,122 INFO L125 PetriNetUnfolderBase]: For 6587/6748 co-relation queries the response was YES. [2024-10-11 17:22:32,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15370 conditions, 7737 events. 1114/7737 cut-off events. For 6587/6748 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 92194 event pairs, 714 based on Foata normal form. 7/7220 useless extension candidates. Maximal degree in co-relation 12078. Up to 2065 conditions per place. [2024-10-11 17:22:32,170 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 33 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2024-10-11 17:22:32,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 606 flow [2024-10-11 17:22:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:22:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:22:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-10-11 17:22:32,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8827586206896552 [2024-10-11 17:22:32,171 INFO L175 Difference]: Start difference. First operand has 161 places, 154 transitions, 492 flow. Second operand 3 states and 384 transitions. [2024-10-11 17:22:32,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 606 flow [2024-10-11 17:22:32,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:22:32,184 INFO L231 Difference]: Finished difference. Result has 164 places, 157 transitions, 524 flow [2024-10-11 17:22:32,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=164, PETRI_TRANSITIONS=157} [2024-10-11 17:22:32,185 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 17 predicate places. [2024-10-11 17:22:32,185 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 524 flow [2024-10-11 17:22:32,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:32,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:32,186 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:22:32,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 17:22:32,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:32,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash 535690515, now seen corresponding path program 1 times [2024-10-11 17:22:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545229249] [2024-10-11 17:22:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:32,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 17:22:32,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:32,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545229249] [2024-10-11 17:22:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545229249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:22:32,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:22:32,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:22:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859707701] [2024-10-11 17:22:32,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:22:32,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:22:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:32,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:22:32,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:22:32,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-10-11 17:22:32,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 157 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:32,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:32,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-10-11 17:22:32,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:33,107 INFO L124 PetriNetUnfolderBase]: 1121/8023 cut-off events. [2024-10-11 17:22:33,107 INFO L125 PetriNetUnfolderBase]: For 8757/8909 co-relation queries the response was YES. [2024-10-11 17:22:33,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16443 conditions, 8023 events. 1121/8023 cut-off events. For 8757/8909 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 96497 event pairs, 707 based on Foata normal form. 4/7570 useless extension candidates. Maximal degree in co-relation 13158. Up to 2095 conditions per place. [2024-10-11 17:22:33,143 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 33 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2024-10-11 17:22:33,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 163 transitions, 629 flow [2024-10-11 17:22:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:22:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:22:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-10-11 17:22:33,144 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8804597701149425 [2024-10-11 17:22:33,144 INFO L175 Difference]: Start difference. First operand has 164 places, 157 transitions, 524 flow. Second operand 3 states and 383 transitions. [2024-10-11 17:22:33,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 163 transitions, 629 flow [2024-10-11 17:22:33,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 163 transitions, 615 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 17:22:33,153 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 552 flow [2024-10-11 17:22:33,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2024-10-11 17:22:33,154 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 19 predicate places. [2024-10-11 17:22:33,154 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 552 flow [2024-10-11 17:22:33,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:33,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:33,154 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:22:33,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 17:22:33,154 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:33,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1938862278, now seen corresponding path program 1 times [2024-10-11 17:22:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:33,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562936795] [2024-10-11 17:22:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:33,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:22:33,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:33,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562936795] [2024-10-11 17:22:33,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562936795] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:22:33,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222800140] [2024-10-11 17:22:33,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:33,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:22:33,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:22:33,360 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:22:33,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:22:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:33,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 17:22:33,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:22:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:22:33,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:22:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:22:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222800140] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:22:33,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:22:33,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-11 17:22:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894642955] [2024-10-11 17:22:33,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:22:33,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:22:33,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:33,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:22:33,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:22:34,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 145 [2024-10-11 17:22:34,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 552 flow. Second operand has 16 states, 16 states have (on average 111.8125) internal successors, (1789), 16 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:34,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:34,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 145 [2024-10-11 17:22:34,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:22:35,262 INFO L124 PetriNetUnfolderBase]: 2232/9384 cut-off events. [2024-10-11 17:22:35,262 INFO L125 PetriNetUnfolderBase]: For 5324/5534 co-relation queries the response was YES. [2024-10-11 17:22:35,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18833 conditions, 9384 events. 2232/9384 cut-off events. For 5324/5534 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 97035 event pairs, 170 based on Foata normal form. 110/9234 useless extension candidates. Maximal degree in co-relation 9495. Up to 1097 conditions per place. [2024-10-11 17:22:35,311 INFO L140 encePairwiseOnDemand]: 132/145 looper letters, 101 selfloop transitions, 16 changer transitions 22/262 dead transitions. [2024-10-11 17:22:35,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 262 transitions, 1166 flow [2024-10-11 17:22:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:22:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-10-11 17:22:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1774 transitions. [2024-10-11 17:22:35,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8156321839080459 [2024-10-11 17:22:35,314 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 552 flow. Second operand 15 states and 1774 transitions. [2024-10-11 17:22:35,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 262 transitions, 1166 flow [2024-10-11 17:22:35,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 262 transitions, 1150 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-11 17:22:35,328 INFO L231 Difference]: Finished difference. Result has 184 places, 167 transitions, 620 flow [2024-10-11 17:22:35,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=620, PETRI_PLACES=184, PETRI_TRANSITIONS=167} [2024-10-11 17:22:35,328 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 37 predicate places. [2024-10-11 17:22:35,329 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 167 transitions, 620 flow [2024-10-11 17:22:35,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 111.8125) internal successors, (1789), 16 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:35,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:35,329 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:22:35,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:22:35,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-11 17:22:35,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:22:35,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash -508767168, now seen corresponding path program 1 times [2024-10-11 17:22:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270098055] [2024-10-11 17:22:35,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:35,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:22:35,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:22:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:22:35,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:22:35,597 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:22:35,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-11 17:22:35,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-11 17:22:35,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-11 17:22:35,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-11 17:22:35,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-11 17:22:35,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-10-11 17:22:35,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-11 17:22:35,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-11 17:22:35,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-11 17:22:35,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 17:22:35,599 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:22:35,600 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:22:35,600 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-11 17:22:35,627 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-11 17:22:35,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 163 transitions, 381 flow [2024-10-11 17:22:35,728 INFO L124 PetriNetUnfolderBase]: 93/1046 cut-off events. [2024-10-11 17:22:35,728 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-10-11 17:22:35,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 1046 events. 93/1046 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4924 event pairs, 23 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 637. Up to 80 conditions per place. [2024-10-11 17:22:35,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 163 transitions, 381 flow [2024-10-11 17:22:35,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 163 transitions, 381 flow [2024-10-11 17:22:35,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:22:35,734 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;@2196c5d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:22:35,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 17:22:35,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:22:35,737 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-11 17:22:35,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:22:35,737 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:22:35,737 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] [2024-10-11 17:22:35,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:22:35,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:22:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash -143201679, now seen corresponding path program 1 times [2024-10-11 17:22:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:22:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509743759] [2024-10-11 17:22:35,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:22:35,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:22:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:22:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:22:35,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:22:35,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509743759] [2024-10-11 17:22:35,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509743759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:22:35,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:22:35,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:22:35,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410038322] [2024-10-11 17:22:35,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:22:35,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:22:35,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:22:35,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:22:35,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:22:35,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2024-10-11 17:22:35,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:22:35,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:22:35,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2024-10-11 17:22:35,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand