./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/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:57:25,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:57:26,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:57:26,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:57:26,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:57:26,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:57:26,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:57:26,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:57:26,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:57:26,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:57:26,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:57:26,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:57:26,054 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:57:26,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:57:26,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:57:26,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:57:26,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:57:26,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:57:26,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:57:26,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:57:26,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:57:26,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:57:26,062 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:57:26,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:57:26,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:57:26,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:57:26,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:57:26,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:57:26,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:57:26,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:57:26,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:57:26,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:26,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:57:26,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:57:26,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:57:26,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:57:26,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:57:26,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:57:26,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:57:26,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:57:26,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:57:26,069 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2024-10-13 09:57:26,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:57:26,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:57:26,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:57:26,374 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:57:26,375 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:57:26,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2024-10-13 09:57:27,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:57:28,052 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:57:28,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2024-10-13 09:57:28,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e283a3d0/f96397a948b44c1bbd5e02c449df8d22/FLAG3b7ee359e [2024-10-13 09:57:28,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e283a3d0/f96397a948b44c1bbd5e02c449df8d22 [2024-10-13 09:57:28,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:57:28,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:57:28,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:28,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:57:28,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:57:28,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:28,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4525fa91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28, skipping insertion in model container [2024-10-13 09:57:28,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:28,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:57:28,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:28,769 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:57:28,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:28,859 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:57:28,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28 WrapperNode [2024-10-13 09:57:28,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:28,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:28,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:57:28,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:57:28,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:28,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:28,931 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 793 [2024-10-13 09:57:28,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:28,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:57:28,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:57:28,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:57:28,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:28,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:28,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:28,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:29,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:29,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:29,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:29,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:29,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:57:29,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:57:29,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:57:29,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:57:29,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (1/1) ... [2024-10-13 09:57:29,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:57:29,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:57:29,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:57:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:57:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:57:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:57:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:57:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:57:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:57:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:57:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:57:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:57:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:57:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:57:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:57:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:57:29,195 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:57:29,368 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:57:29,370 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:57:30,417 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:57:30,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:57:30,463 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:57:30,463 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 09:57:30,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:30 BoogieIcfgContainer [2024-10-13 09:57:30,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:57:30,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:57:30,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:57:30,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:57:30,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:28" (1/3) ... [2024-10-13 09:57:30,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f51427b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:30, skipping insertion in model container [2024-10-13 09:57:30,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:28" (2/3) ... [2024-10-13 09:57:30,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f51427b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:30, skipping insertion in model container [2024-10-13 09:57:30,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:30" (3/3) ... [2024-10-13 09:57:30,478 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2024-10-13 09:57:30,495 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:57:30,495 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 114 error locations. [2024-10-13 09:57:30,496 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:57:30,708 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:57:30,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1010 places, 1048 transitions, 2117 flow [2024-10-13 09:57:31,203 INFO L124 PetriNetUnfolderBase]: 48/1045 cut-off events. [2024-10-13 09:57:31,203 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:31,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 1045 events. 48/1045 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2154 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 855. Up to 2 conditions per place. [2024-10-13 09:57:31,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 1010 places, 1048 transitions, 2117 flow [2024-10-13 09:57:31,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 988 places, 1024 transitions, 2066 flow [2024-10-13 09:57:31,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:57:31,275 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;@6ee2481f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:57:31,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2024-10-13 09:57:31,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:57:31,281 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2024-10-13 09:57:31,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:57:31,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:31,283 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:31,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:31,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1350031626, now seen corresponding path program 1 times [2024-10-13 09:57:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:31,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905818935] [2024-10-13 09:57:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:31,558 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-13 09:57:31,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905818935] [2024-10-13 09:57:31,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905818935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:31,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:31,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:31,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627324651] [2024-10-13 09:57:31,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:31,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:31,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:31,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:31,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1048 [2024-10-13 09:57:31,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1024 transitions, 2066 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 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-13 09:57:31,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:31,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1048 [2024-10-13 09:57:31,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:32,396 INFO L124 PetriNetUnfolderBase]: 54/1757 cut-off events. [2024-10-13 09:57:32,397 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-13 09:57:32,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1757 events. 54/1757 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8002 event pairs, 21 based on Foata normal form. 59/1515 useless extension candidates. Maximal degree in co-relation 1271. Up to 62 conditions per place. [2024-10-13 09:57:32,454 INFO L140 encePairwiseOnDemand]: 1017/1048 looper letters, 19 selfloop transitions, 2 changer transitions 16/995 dead transitions. [2024-10-13 09:57:32,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 995 transitions, 2050 flow [2024-10-13 09:57:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3035 transitions. [2024-10-13 09:57:32,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9653307888040712 [2024-10-13 09:57:32,488 INFO L175 Difference]: Start difference. First operand has 988 places, 1024 transitions, 2066 flow. Second operand 3 states and 3035 transitions. [2024-10-13 09:57:32,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 995 transitions, 2050 flow [2024-10-13 09:57:32,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 995 transitions, 2038 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 09:57:32,524 INFO L231 Difference]: Finished difference. Result has 983 places, 979 transitions, 1968 flow [2024-10-13 09:57:32,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=993, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=983, PETRI_TRANSITIONS=979} [2024-10-13 09:57:32,534 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -5 predicate places. [2024-10-13 09:57:32,534 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 979 transitions, 1968 flow [2024-10-13 09:57:32,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 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-13 09:57:32,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:32,537 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] [2024-10-13 09:57:32,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:57:32,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:32,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash 860022617, now seen corresponding path program 1 times [2024-10-13 09:57:32,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:32,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266974109] [2024-10-13 09:57:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:32,622 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-13 09:57:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266974109] [2024-10-13 09:57:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266974109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:32,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:32,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560928637] [2024-10-13 09:57:32,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:32,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:32,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1048 [2024-10-13 09:57:32,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 979 transitions, 1968 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 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-13 09:57:32,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:32,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1048 [2024-10-13 09:57:32,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:33,751 INFO L124 PetriNetUnfolderBase]: 114/2523 cut-off events. [2024-10-13 09:57:33,752 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-13 09:57:33,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 2523 events. 114/2523 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 15113 event pairs, 60 based on Foata normal form. 0/2116 useless extension candidates. Maximal degree in co-relation 2647. Up to 146 conditions per place. [2024-10-13 09:57:33,820 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/969 dead transitions. [2024-10-13 09:57:33,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 969 transitions, 2002 flow [2024-10-13 09:57:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2024-10-13 09:57:33,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478371501272265 [2024-10-13 09:57:33,830 INFO L175 Difference]: Start difference. First operand has 983 places, 979 transitions, 1968 flow. Second operand 3 states and 2980 transitions. [2024-10-13 09:57:33,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 969 transitions, 2002 flow [2024-10-13 09:57:33,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 969 transitions, 1998 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:33,856 INFO L231 Difference]: Finished difference. Result has 957 places, 969 transitions, 1946 flow [2024-10-13 09:57:33,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1946, PETRI_PLACES=957, PETRI_TRANSITIONS=969} [2024-10-13 09:57:33,859 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2024-10-13 09:57:33,859 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 969 transitions, 1946 flow [2024-10-13 09:57:33,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 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-13 09:57:33,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:33,862 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:33,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:57:33,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:33,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1639064396, now seen corresponding path program 1 times [2024-10-13 09:57:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:33,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833471435] [2024-10-13 09:57:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:33,940 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-13 09:57:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833471435] [2024-10-13 09:57:33,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833471435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:33,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:33,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508079689] [2024-10-13 09:57:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:33,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:33,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:33,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:34,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1048 [2024-10-13 09:57:34,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 969 transitions, 1946 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 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-13 09:57:34,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:34,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1048 [2024-10-13 09:57:34,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:34,886 INFO L124 PetriNetUnfolderBase]: 90/2666 cut-off events. [2024-10-13 09:57:34,886 INFO L125 PetriNetUnfolderBase]: For 5/9 co-relation queries the response was YES. [2024-10-13 09:57:34,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2666 events. 90/2666 cut-off events. For 5/9 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16387 event pairs, 39 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 2738. Up to 89 conditions per place. [2024-10-13 09:57:34,955 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 19 selfloop transitions, 2 changer transitions 0/968 dead transitions. [2024-10-13 09:57:34,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 968 transitions, 1986 flow [2024-10-13 09:57:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2024-10-13 09:57:34,965 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9564249363867684 [2024-10-13 09:57:34,966 INFO L175 Difference]: Start difference. First operand has 957 places, 969 transitions, 1946 flow. Second operand 3 states and 3007 transitions. [2024-10-13 09:57:34,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 968 transitions, 1986 flow [2024-10-13 09:57:35,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 968 transitions, 1985 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:35,055 INFO L231 Difference]: Finished difference. Result has 957 places, 968 transitions, 1947 flow [2024-10-13 09:57:35,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1947, PETRI_PLACES=957, PETRI_TRANSITIONS=968} [2024-10-13 09:57:35,058 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2024-10-13 09:57:35,058 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 968 transitions, 1947 flow [2024-10-13 09:57:35,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 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-13 09:57:35,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:35,060 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:35,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:57:35,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:35,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash 752671738, now seen corresponding path program 1 times [2024-10-13 09:57:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:35,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917749501] [2024-10-13 09:57:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:35,120 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-13 09:57:35,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:35,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917749501] [2024-10-13 09:57:35,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917749501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:35,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:35,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5644831] [2024-10-13 09:57:35,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:35,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:35,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:35,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:35,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:35,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1048 [2024-10-13 09:57:35,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 968 transitions, 1947 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 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-13 09:57:35,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:35,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1048 [2024-10-13 09:57:35,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:36,299 INFO L124 PetriNetUnfolderBase]: 225/3970 cut-off events. [2024-10-13 09:57:36,300 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-13 09:57:36,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4298 conditions, 3970 events. 225/3970 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 30239 event pairs, 132 based on Foata normal form. 0/3337 useless extension candidates. Maximal degree in co-relation 4256. Up to 264 conditions per place. [2024-10-13 09:57:36,385 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/958 dead transitions. [2024-10-13 09:57:36,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 958 transitions, 1981 flow [2024-10-13 09:57:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2024-10-13 09:57:36,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478371501272265 [2024-10-13 09:57:36,393 INFO L175 Difference]: Start difference. First operand has 957 places, 968 transitions, 1947 flow. Second operand 3 states and 2980 transitions. [2024-10-13 09:57:36,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 958 transitions, 1981 flow [2024-10-13 09:57:36,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 958 transitions, 1977 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:36,411 INFO L231 Difference]: Finished difference. Result has 947 places, 958 transitions, 1925 flow [2024-10-13 09:57:36,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1925, PETRI_PLACES=947, PETRI_TRANSITIONS=958} [2024-10-13 09:57:36,413 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2024-10-13 09:57:36,414 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 958 transitions, 1925 flow [2024-10-13 09:57:36,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 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-13 09:57:36,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:36,416 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:36,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:57:36,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1448313385, now seen corresponding path program 1 times [2024-10-13 09:57:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680025325] [2024-10-13 09:57:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:36,497 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-13 09:57:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:36,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680025325] [2024-10-13 09:57:36,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680025325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:36,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:36,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646475558] [2024-10-13 09:57:36,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:36,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:36,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:36,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:36,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:36,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1048 [2024-10-13 09:57:36,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 958 transitions, 1925 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 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-13 09:57:36,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:36,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1048 [2024-10-13 09:57:36,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:37,100 INFO L124 PetriNetUnfolderBase]: 75/1833 cut-off events. [2024-10-13 09:57:37,100 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2024-10-13 09:57:37,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 1833 events. 75/1833 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8414 event pairs, 39 based on Foata normal form. 0/1560 useless extension candidates. Maximal degree in co-relation 1891. Up to 89 conditions per place. [2024-10-13 09:57:37,143 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 19 selfloop transitions, 2 changer transitions 0/957 dead transitions. [2024-10-13 09:57:37,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 957 transitions, 1965 flow [2024-10-13 09:57:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2024-10-13 09:57:37,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9564249363867684 [2024-10-13 09:57:37,151 INFO L175 Difference]: Start difference. First operand has 947 places, 958 transitions, 1925 flow. Second operand 3 states and 3007 transitions. [2024-10-13 09:57:37,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 957 transitions, 1965 flow [2024-10-13 09:57:37,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 957 transitions, 1964 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:37,166 INFO L231 Difference]: Finished difference. Result has 947 places, 957 transitions, 1926 flow [2024-10-13 09:57:37,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1926, PETRI_PLACES=947, PETRI_TRANSITIONS=957} [2024-10-13 09:57:37,169 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2024-10-13 09:57:37,169 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 957 transitions, 1926 flow [2024-10-13 09:57:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 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-13 09:57:37,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:37,171 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:37,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:57:37,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:37,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash 573038134, now seen corresponding path program 1 times [2024-10-13 09:57:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:37,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136265716] [2024-10-13 09:57:37,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:37,235 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-13 09:57:37,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:37,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136265716] [2024-10-13 09:57:37,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136265716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:37,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:37,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:37,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475760625] [2024-10-13 09:57:37,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:37,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:37,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:37,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:37,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:37,280 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1048 [2024-10-13 09:57:37,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 957 transitions, 1926 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 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-13 09:57:37,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:37,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1048 [2024-10-13 09:57:37,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:38,191 INFO L124 PetriNetUnfolderBase]: 227/3703 cut-off events. [2024-10-13 09:57:38,192 INFO L125 PetriNetUnfolderBase]: For 65/94 co-relation queries the response was YES. [2024-10-13 09:57:38,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 3703 events. 227/3703 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 26982 event pairs, 132 based on Foata normal form. 0/3155 useless extension candidates. Maximal degree in co-relation 3952. Up to 274 conditions per place. [2024-10-13 09:57:38,279 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/947 dead transitions. [2024-10-13 09:57:38,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 947 transitions, 1960 flow [2024-10-13 09:57:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2024-10-13 09:57:38,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478371501272265 [2024-10-13 09:57:38,287 INFO L175 Difference]: Start difference. First operand has 947 places, 957 transitions, 1926 flow. Second operand 3 states and 2980 transitions. [2024-10-13 09:57:38,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 947 transitions, 1960 flow [2024-10-13 09:57:38,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 947 transitions, 1956 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:38,302 INFO L231 Difference]: Finished difference. Result has 937 places, 947 transitions, 1904 flow [2024-10-13 09:57:38,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=937, PETRI_TRANSITIONS=947} [2024-10-13 09:57:38,306 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2024-10-13 09:57:38,307 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 947 transitions, 1904 flow [2024-10-13 09:57:38,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 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-13 09:57:38,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:57:38,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:57:38,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:38,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:38,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1789936871, now seen corresponding path program 1 times [2024-10-13 09:57:38,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:38,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770801399] [2024-10-13 09:57:38,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:38,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:38,360 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-13 09:57:38,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:38,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770801399] [2024-10-13 09:57:38,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770801399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:38,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:38,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:38,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326036871] [2024-10-13 09:57:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:38,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:38,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:38,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:38,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:38,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1048 [2024-10-13 09:57:38,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 947 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 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-13 09:57:38,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:38,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1048 [2024-10-13 09:57:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:38,686 INFO L124 PetriNetUnfolderBase]: 26/1247 cut-off events. [2024-10-13 09:57:38,686 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-13 09:57:38,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 1247 events. 26/1247 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3288 event pairs, 2 based on Foata normal form. 0/1094 useless extension candidates. Maximal degree in co-relation 1232. Up to 16 conditions per place. [2024-10-13 09:57:38,705 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2024-10-13 09:57:38,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 946 transitions, 1928 flow [2024-10-13 09:57:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2024-10-13 09:57:38,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9615139949109415 [2024-10-13 09:57:38,711 INFO L175 Difference]: Start difference. First operand has 937 places, 947 transitions, 1904 flow. Second operand 3 states and 3023 transitions. [2024-10-13 09:57:38,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 946 transitions, 1928 flow [2024-10-13 09:57:38,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 946 transitions, 1927 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:38,726 INFO L231 Difference]: Finished difference. Result has 937 places, 946 transitions, 1905 flow [2024-10-13 09:57:38,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1905, PETRI_PLACES=937, PETRI_TRANSITIONS=946} [2024-10-13 09:57:38,728 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2024-10-13 09:57:38,728 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 946 transitions, 1905 flow [2024-10-13 09:57:38,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 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-13 09:57:38,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:38,731 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:38,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:57:38,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:38,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2041858837, now seen corresponding path program 1 times [2024-10-13 09:57:38,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:38,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398762855] [2024-10-13 09:57:38,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:38,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:38,766 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-13 09:57:38,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:38,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398762855] [2024-10-13 09:57:38,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398762855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:38,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:38,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:38,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104383694] [2024-10-13 09:57:38,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:38,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:38,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:38,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:38,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:38,793 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1048 [2024-10-13 09:57:38,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 946 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:38,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:38,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1048 [2024-10-13 09:57:38,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:39,210 INFO L124 PetriNetUnfolderBase]: 42/1848 cut-off events. [2024-10-13 09:57:39,210 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-10-13 09:57:39,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 1848 events. 42/1848 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8271 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1848. Up to 25 conditions per place. [2024-10-13 09:57:39,261 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/945 dead transitions. [2024-10-13 09:57:39,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 945 transitions, 1931 flow [2024-10-13 09:57:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2024-10-13 09:57:39,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608778625954199 [2024-10-13 09:57:39,268 INFO L175 Difference]: Start difference. First operand has 937 places, 946 transitions, 1905 flow. Second operand 3 states and 3021 transitions. [2024-10-13 09:57:39,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 945 transitions, 1931 flow [2024-10-13 09:57:39,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 945 transitions, 1927 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:39,282 INFO L231 Difference]: Finished difference. Result has 936 places, 945 transitions, 1903 flow [2024-10-13 09:57:39,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=936, PETRI_TRANSITIONS=945} [2024-10-13 09:57:39,284 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -52 predicate places. [2024-10-13 09:57:39,285 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 945 transitions, 1903 flow [2024-10-13 09:57:39,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:39,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:39,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:39,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:57:39,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:39,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1369086112, now seen corresponding path program 1 times [2024-10-13 09:57:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534148754] [2024-10-13 09:57:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:39,326 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-13 09:57:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:39,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534148754] [2024-10-13 09:57:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534148754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:39,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:39,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076232410] [2024-10-13 09:57:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:39,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1048 [2024-10-13 09:57:39,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 945 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:39,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:39,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1048 [2024-10-13 09:57:39,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:39,691 INFO L124 PetriNetUnfolderBase]: 42/1847 cut-off events. [2024-10-13 09:57:39,692 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-10-13 09:57:39,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1847 events. 42/1847 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 8260 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1847. Up to 25 conditions per place. [2024-10-13 09:57:39,776 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2024-10-13 09:57:39,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 944 transitions, 1929 flow [2024-10-13 09:57:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2024-10-13 09:57:39,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608778625954199 [2024-10-13 09:57:39,784 INFO L175 Difference]: Start difference. First operand has 936 places, 945 transitions, 1903 flow. Second operand 3 states and 3021 transitions. [2024-10-13 09:57:39,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 944 transitions, 1929 flow [2024-10-13 09:57:39,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 944 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:39,801 INFO L231 Difference]: Finished difference. Result has 935 places, 944 transitions, 1901 flow [2024-10-13 09:57:39,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=935, PETRI_TRANSITIONS=944} [2024-10-13 09:57:39,803 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -53 predicate places. [2024-10-13 09:57:39,803 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 944 transitions, 1901 flow [2024-10-13 09:57:39,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:39,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:39,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:39,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:57:39,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:39,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:39,806 INFO L85 PathProgramCache]: Analyzing trace with hash 41052617, now seen corresponding path program 1 times [2024-10-13 09:57:39,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:39,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536760785] [2024-10-13 09:57:39,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:39,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:39,853 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-13 09:57:39,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536760785] [2024-10-13 09:57:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536760785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:39,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790516476] [2024-10-13 09:57:39,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:39,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:39,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:39,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:39,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:39,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1048 [2024-10-13 09:57:39,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 944 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 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-13 09:57:39,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:39,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1048 [2024-10-13 09:57:39,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:40,181 INFO L124 PetriNetUnfolderBase]: 23/1094 cut-off events. [2024-10-13 09:57:40,181 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-10-13 09:57:40,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1094 events. 23/1094 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2533 event pairs, 2 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1080. Up to 16 conditions per place. [2024-10-13 09:57:40,208 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/943 dead transitions. [2024-10-13 09:57:40,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 943 transitions, 1925 flow [2024-10-13 09:57:40,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2024-10-13 09:57:40,216 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9615139949109415 [2024-10-13 09:57:40,216 INFO L175 Difference]: Start difference. First operand has 935 places, 944 transitions, 1901 flow. Second operand 3 states and 3023 transitions. [2024-10-13 09:57:40,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 943 transitions, 1925 flow [2024-10-13 09:57:40,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 943 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:40,236 INFO L231 Difference]: Finished difference. Result has 934 places, 943 transitions, 1899 flow [2024-10-13 09:57:40,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=934, PETRI_TRANSITIONS=943} [2024-10-13 09:57:40,239 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -54 predicate places. [2024-10-13 09:57:40,240 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 943 transitions, 1899 flow [2024-10-13 09:57:40,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 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-13 09:57:40,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:40,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:57:40,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:40,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash -327954564, now seen corresponding path program 1 times [2024-10-13 09:57:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734004440] [2024-10-13 09:57:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734004440] [2024-10-13 09:57:40,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734004440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:40,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:40,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:40,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712129224] [2024-10-13 09:57:40,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:40,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:40,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:40,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:40,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:40,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1048 [2024-10-13 09:57:40,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 943 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:40,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:40,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1048 [2024-10-13 09:57:40,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:40,674 INFO L124 PetriNetUnfolderBase]: 33/1395 cut-off events. [2024-10-13 09:57:40,675 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2024-10-13 09:57:40,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1395 events. 33/1395 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4826 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1392. Up to 25 conditions per place. [2024-10-13 09:57:40,714 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2024-10-13 09:57:40,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 942 transitions, 1925 flow [2024-10-13 09:57:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2024-10-13 09:57:40,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608778625954199 [2024-10-13 09:57:40,722 INFO L175 Difference]: Start difference. First operand has 934 places, 943 transitions, 1899 flow. Second operand 3 states and 3021 transitions. [2024-10-13 09:57:40,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 942 transitions, 1925 flow [2024-10-13 09:57:40,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 942 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:40,740 INFO L231 Difference]: Finished difference. Result has 933 places, 942 transitions, 1897 flow [2024-10-13 09:57:40,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1897, PETRI_PLACES=933, PETRI_TRANSITIONS=942} [2024-10-13 09:57:40,742 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -55 predicate places. [2024-10-13 09:57:40,742 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 942 transitions, 1897 flow [2024-10-13 09:57:40,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:40,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:40,744 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:40,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:57:40,745 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:40,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1927998895, now seen corresponding path program 1 times [2024-10-13 09:57:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:40,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775836612] [2024-10-13 09:57:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:40,818 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-13 09:57:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:40,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775836612] [2024-10-13 09:57:40,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775836612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:40,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:40,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:40,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794015699] [2024-10-13 09:57:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:40,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:40,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:40,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:40,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1048 [2024-10-13 09:57:40,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 942 transitions, 1897 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:40,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:40,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1048 [2024-10-13 09:57:40,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:41,204 INFO L124 PetriNetUnfolderBase]: 33/1394 cut-off events. [2024-10-13 09:57:41,204 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2024-10-13 09:57:41,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 1394 events. 33/1394 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4815 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1391. Up to 25 conditions per place. [2024-10-13 09:57:41,238 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/941 dead transitions. [2024-10-13 09:57:41,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 941 transitions, 1923 flow [2024-10-13 09:57:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2024-10-13 09:57:41,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608778625954199 [2024-10-13 09:57:41,246 INFO L175 Difference]: Start difference. First operand has 933 places, 942 transitions, 1897 flow. Second operand 3 states and 3021 transitions. [2024-10-13 09:57:41,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 941 transitions, 1923 flow [2024-10-13 09:57:41,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 932 places, 941 transitions, 1919 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:41,266 INFO L231 Difference]: Finished difference. Result has 932 places, 941 transitions, 1895 flow [2024-10-13 09:57:41,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=930, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=932, PETRI_TRANSITIONS=941} [2024-10-13 09:57:41,268 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -56 predicate places. [2024-10-13 09:57:41,269 INFO L471 AbstractCegarLoop]: Abstraction has has 932 places, 941 transitions, 1895 flow [2024-10-13 09:57:41,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:41,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:41,271 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:41,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:57:41,271 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:41,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1055677271, now seen corresponding path program 1 times [2024-10-13 09:57:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399260318] [2024-10-13 09:57:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:41,323 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-13 09:57:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399260318] [2024-10-13 09:57:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399260318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:41,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:41,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405507620] [2024-10-13 09:57:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:41,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:41,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1048 [2024-10-13 09:57:41,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 941 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 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-13 09:57:41,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:41,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1048 [2024-10-13 09:57:41,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:41,582 INFO L124 PetriNetUnfolderBase]: 20/970 cut-off events. [2024-10-13 09:57:41,582 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-13 09:57:41,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 970 events. 20/970 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2064 event pairs, 2 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 955. Up to 16 conditions per place. [2024-10-13 09:57:41,601 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/940 dead transitions. [2024-10-13 09:57:41,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 940 transitions, 1919 flow [2024-10-13 09:57:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2024-10-13 09:57:41,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9615139949109415 [2024-10-13 09:57:41,608 INFO L175 Difference]: Start difference. First operand has 932 places, 941 transitions, 1895 flow. Second operand 3 states and 3023 transitions. [2024-10-13 09:57:41,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 940 transitions, 1919 flow [2024-10-13 09:57:41,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 940 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:41,625 INFO L231 Difference]: Finished difference. Result has 931 places, 940 transitions, 1893 flow [2024-10-13 09:57:41,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=938, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1893, PETRI_PLACES=931, PETRI_TRANSITIONS=940} [2024-10-13 09:57:41,626 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -57 predicate places. [2024-10-13 09:57:41,627 INFO L471 AbstractCegarLoop]: Abstraction has has 931 places, 940 transitions, 1893 flow [2024-10-13 09:57:41,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 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-13 09:57:41,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:41,628 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:41,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:57:41,628 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:41,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:41,629 INFO L85 PathProgramCache]: Analyzing trace with hash 79333507, now seen corresponding path program 1 times [2024-10-13 09:57:41,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:41,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91881497] [2024-10-13 09:57:41,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:41,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:41,667 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-13 09:57:41,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91881497] [2024-10-13 09:57:41,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91881497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:41,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:41,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:41,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427528629] [2024-10-13 09:57:41,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:41,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:41,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:41,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:41,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:41,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1048 [2024-10-13 09:57:41,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 940 transitions, 1893 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:41,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:41,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1048 [2024-10-13 09:57:41,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:42,003 INFO L124 PetriNetUnfolderBase]: 30/1205 cut-off events. [2024-10-13 09:57:42,003 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2024-10-13 09:57:42,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 1205 events. 30/1205 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3074 event pairs, 6 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1199. Up to 25 conditions per place. [2024-10-13 09:57:42,026 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/939 dead transitions. [2024-10-13 09:57:42,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 939 transitions, 1919 flow [2024-10-13 09:57:42,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2024-10-13 09:57:42,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608778625954199 [2024-10-13 09:57:42,033 INFO L175 Difference]: Start difference. First operand has 931 places, 940 transitions, 1893 flow. Second operand 3 states and 3021 transitions. [2024-10-13 09:57:42,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 939 transitions, 1919 flow [2024-10-13 09:57:42,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 939 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:42,052 INFO L231 Difference]: Finished difference. Result has 930 places, 939 transitions, 1891 flow [2024-10-13 09:57:42,053 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1891, PETRI_PLACES=930, PETRI_TRANSITIONS=939} [2024-10-13 09:57:42,054 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -58 predicate places. [2024-10-13 09:57:42,054 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 939 transitions, 1891 flow [2024-10-13 09:57:42,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:42,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:42,056 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:42,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:57:42,056 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:42,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash -426821869, now seen corresponding path program 1 times [2024-10-13 09:57:42,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:42,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507326651] [2024-10-13 09:57:42,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:42,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:42,102 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-13 09:57:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:42,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507326651] [2024-10-13 09:57:42,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507326651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:42,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:42,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:42,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349729005] [2024-10-13 09:57:42,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:42,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:42,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:42,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:42,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:42,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1048 [2024-10-13 09:57:42,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 939 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:42,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:42,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1048 [2024-10-13 09:57:42,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:42,368 INFO L124 PetriNetUnfolderBase]: 30/1166 cut-off events. [2024-10-13 09:57:42,368 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2024-10-13 09:57:42,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1166 events. 30/1166 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2943 event pairs, 6 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1160. Up to 25 conditions per place. [2024-10-13 09:57:42,387 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/938 dead transitions. [2024-10-13 09:57:42,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 938 transitions, 1917 flow [2024-10-13 09:57:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2024-10-13 09:57:42,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608778625954199 [2024-10-13 09:57:42,393 INFO L175 Difference]: Start difference. First operand has 930 places, 939 transitions, 1891 flow. Second operand 3 states and 3021 transitions. [2024-10-13 09:57:42,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 938 transitions, 1917 flow [2024-10-13 09:57:42,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 938 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:42,407 INFO L231 Difference]: Finished difference. Result has 929 places, 938 transitions, 1889 flow [2024-10-13 09:57:42,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1889, PETRI_PLACES=929, PETRI_TRANSITIONS=938} [2024-10-13 09:57:42,410 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -59 predicate places. [2024-10-13 09:57:42,411 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 938 transitions, 1889 flow [2024-10-13 09:57:42,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 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-13 09:57:42,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:42,412 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:57:42,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:57:42,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:42,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1654271590, now seen corresponding path program 1 times [2024-10-13 09:57:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:42,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545659366] [2024-10-13 09:57:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:42,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:42,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545659366] [2024-10-13 09:57:42,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545659366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:42,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:42,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:42,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98925617] [2024-10-13 09:57:42,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:42,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:42,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:42,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:42,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:42,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2024-10-13 09:57:42,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 938 transitions, 1889 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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-13 09:57:42,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:42,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2024-10-13 09:57:42,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:42,807 INFO L124 PetriNetUnfolderBase]: 42/1529 cut-off events. [2024-10-13 09:57:42,807 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:42,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 1529 events. 42/1529 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6395 event pairs, 12 based on Foata normal form. 0/1336 useless extension candidates. Maximal degree in co-relation 1540. Up to 38 conditions per place. [2024-10-13 09:57:42,835 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/937 dead transitions. [2024-10-13 09:57:42,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 937 transitions, 1917 flow [2024-10-13 09:57:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2024-10-13 09:57:42,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602417302798982 [2024-10-13 09:57:42,839 INFO L175 Difference]: Start difference. First operand has 929 places, 938 transitions, 1889 flow. Second operand 3 states and 3019 transitions. [2024-10-13 09:57:42,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 937 transitions, 1917 flow [2024-10-13 09:57:42,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 937 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:42,853 INFO L231 Difference]: Finished difference. Result has 928 places, 937 transitions, 1887 flow [2024-10-13 09:57:42,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=928, PETRI_TRANSITIONS=937} [2024-10-13 09:57:42,854 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -60 predicate places. [2024-10-13 09:57:42,854 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 937 transitions, 1887 flow [2024-10-13 09:57:42,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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-13 09:57:42,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:42,855 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:57:42,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:57:42,856 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:57:42,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2077651223, now seen corresponding path program 1 times [2024-10-13 09:57:42,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:42,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969948570] [2024-10-13 09:57:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:43,499 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-13 09:57:43,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969948570] [2024-10-13 09:57:43,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969948570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:43,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:43,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:57:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140469683] [2024-10-13 09:57:43,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:43,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:57:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:43,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:57:43,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:57:44,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1048 [2024-10-13 09:57:44,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 937 transitions, 1887 flow. Second operand has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 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-13 09:57:44,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:44,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1048 [2024-10-13 09:57:44,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:03,322 INFO L124 PetriNetUnfolderBase]: 15257/85351 cut-off events. [2024-10-13 09:58:03,322 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2024-10-13 09:58:03,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107780 conditions, 85351 events. 15257/85351 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 1263411 event pairs, 14040 based on Foata normal form. 0/74616 useless extension candidates. Maximal degree in co-relation 107738. Up to 22026 conditions per place. [2024-10-13 09:58:04,030 INFO L140 encePairwiseOnDemand]: 1030/1048 looper letters, 87 selfloop transitions, 15 changer transitions 0/934 dead transitions. [2024-10-13 09:58:04,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 934 transitions, 2085 flow [2024-10-13 09:58:04,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:58:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:58:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5583 transitions. [2024-10-13 09:58:04,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.887881679389313 [2024-10-13 09:58:04,040 INFO L175 Difference]: Start difference. First operand has 928 places, 937 transitions, 1887 flow. Second operand 6 states and 5583 transitions. [2024-10-13 09:58:04,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 934 transitions, 2085 flow [2024-10-13 09:58:04,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 934 transitions, 2081 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:04,055 INFO L231 Difference]: Finished difference. Result has 928 places, 934 transitions, 1907 flow [2024-10-13 09:58:04,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1907, PETRI_PLACES=928, PETRI_TRANSITIONS=934} [2024-10-13 09:58:04,057 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -60 predicate places. [2024-10-13 09:58:04,058 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 934 transitions, 1907 flow [2024-10-13 09:58:04,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 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-13 09:58:04,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:04,060 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:58:04,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:58:04,060 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:58:04,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2010193129, now seen corresponding path program 1 times [2024-10-13 09:58:04,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:04,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986616744] [2024-10-13 09:58:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:04,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:04,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:04,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986616744] [2024-10-13 09:58:04,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986616744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:04,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:04,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776582830] [2024-10-13 09:58:04,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:04,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:04,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:04,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:04,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2024-10-13 09:58:04,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 934 transitions, 1907 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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-13 09:58:04,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:04,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2024-10-13 09:58:04,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:04,809 INFO L124 PetriNetUnfolderBase]: 62/2127 cut-off events. [2024-10-13 09:58:04,809 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-10-13 09:58:04,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 2127 events. 62/2127 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10866 event pairs, 20 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 2169. Up to 50 conditions per place. [2024-10-13 09:58:04,837 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/933 dead transitions. [2024-10-13 09:58:04,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 933 transitions, 1935 flow [2024-10-13 09:58:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2024-10-13 09:58:04,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602417302798982 [2024-10-13 09:58:04,843 INFO L175 Difference]: Start difference. First operand has 928 places, 934 transitions, 1907 flow. Second operand 3 states and 3019 transitions. [2024-10-13 09:58:04,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 929 places, 933 transitions, 1935 flow [2024-10-13 09:58:04,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 933 transitions, 1905 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:58:04,856 INFO L231 Difference]: Finished difference. Result has 924 places, 933 transitions, 1879 flow [2024-10-13 09:58:04,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=924, PETRI_TRANSITIONS=933} [2024-10-13 09:58:04,858 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -64 predicate places. [2024-10-13 09:58:04,858 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 933 transitions, 1879 flow [2024-10-13 09:58:04,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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-13 09:58:04,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:04,859 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:58:04,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:58:04,860 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:58:04,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1239658904, now seen corresponding path program 1 times [2024-10-13 09:58:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:04,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957752054] [2024-10-13 09:58:04,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:04,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:04,931 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-13 09:58:04,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:04,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957752054] [2024-10-13 09:58:04,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957752054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:04,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:04,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117675621] [2024-10-13 09:58:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:04,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:04,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:04,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:04,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:04,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2024-10-13 09:58:04,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 933 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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-13 09:58:04,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:04,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2024-10-13 09:58:04,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:05,298 INFO L124 PetriNetUnfolderBase]: 53/1627 cut-off events. [2024-10-13 09:58:05,298 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2024-10-13 09:58:05,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 1627 events. 53/1627 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6153 event pairs, 20 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1648. Up to 50 conditions per place. [2024-10-13 09:58:05,331 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/932 dead transitions. [2024-10-13 09:58:05,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 932 transitions, 1907 flow [2024-10-13 09:58:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2024-10-13 09:58:05,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602417302798982 [2024-10-13 09:58:05,337 INFO L175 Difference]: Start difference. First operand has 924 places, 933 transitions, 1879 flow. Second operand 3 states and 3019 transitions. [2024-10-13 09:58:05,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 932 transitions, 1907 flow [2024-10-13 09:58:05,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 932 transitions, 1903 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:05,349 INFO L231 Difference]: Finished difference. Result has 923 places, 932 transitions, 1877 flow [2024-10-13 09:58:05,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1877, PETRI_PLACES=923, PETRI_TRANSITIONS=932} [2024-10-13 09:58:05,351 INFO L277 CegarLoopForPetriNet]: 988 programPoint places, -65 predicate places. [2024-10-13 09:58:05,351 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 932 transitions, 1877 flow [2024-10-13 09:58:05,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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-13 09:58:05,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:05,352 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:58:05,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:58:05,353 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2024-10-13 09:58:05,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:05,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1430515027, now seen corresponding path program 1 times [2024-10-13 09:58:05,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:05,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502190493] [2024-10-13 09:58:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:05,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:05,514 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-13 09:58:05,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:05,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502190493] [2024-10-13 09:58:05,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502190493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:05,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:05,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:05,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369863312] [2024-10-13 09:58:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:05,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:05,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1048 [2024-10-13 09:58:05,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 932 transitions, 1877 flow. Second operand has 3 states, 3 states have (on average 915.0) internal successors, (2745), 3 states have internal predecessors, (2745), 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-13 09:58:05,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:05,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1048 [2024-10-13 09:58:05,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand