./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-4.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 bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:40:21,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:40:21,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:40:21,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:40:21,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:40:21,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:40:21,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:40:21,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:40:21,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:40:21,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:40:21,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:40:21,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:40:21,101 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:40:21,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:40:21,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:40:21,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:40:21,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:40:21,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:40:21,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:40:21,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:40:21,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:40:21,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:40:21,105 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:40:21,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:40:21,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:40:21,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:40:21,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:40:21,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:40:21,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:40:21,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:40:21,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:40:21,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:21,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:40:21,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:40:21,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:40:21,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:40:21,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:40:21,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:40:21,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:40:21,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:40:21,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:40:21,130 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 -> bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd [2024-11-10 14:40:21,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:40:21,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:40:21,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:40:21,461 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:40:21,461 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:40:21,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-4.wvr.c [2024-11-10 14:40:22,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:40:23,129 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:40:23,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-4.wvr.c [2024-11-10 14:40:23,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5a3cca54/969e1f1b84e34b23956aa08024f9d800/FLAGb6e3c3861 [2024-11-10 14:40:23,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5a3cca54/969e1f1b84e34b23956aa08024f9d800 [2024-11-10 14:40:23,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:40:23,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:40:23,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:23,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:40:23,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:40:23,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213c3841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23, skipping insertion in model container [2024-11-10 14:40:23,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:40:23,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:23,453 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:40:23,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:23,511 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:40:23,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23 WrapperNode [2024-11-10 14:40:23,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:23,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:23,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:40:23,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:40:23,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,567 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 294 [2024-11-10 14:40:23,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:23,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:40:23,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:40:23,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:40:23,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:40:23,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:40:23,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:40:23,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:40:23,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (1/1) ... [2024-11-10 14:40:23,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:23,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:23,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:40:23,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:40:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:40:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:40:23,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:40:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:40:23,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:40:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:40:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:40:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:40:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:40:23,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:40:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:40:23,688 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:40:23,803 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:40:23,805 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:40:24,340 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:40:24,340 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:40:24,373 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:40:24,373 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:40:24,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:24 BoogieIcfgContainer [2024-11-10 14:40:24,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:40:24,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:40:24,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:40:24,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:40:24,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:40:23" (1/3) ... [2024-11-10 14:40:24,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791311a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:24, skipping insertion in model container [2024-11-10 14:40:24,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:23" (2/3) ... [2024-11-10 14:40:24,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791311a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:24, skipping insertion in model container [2024-11-10 14:40:24,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:24" (3/3) ... [2024-11-10 14:40:24,385 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2024-11-10 14:40:24,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:40:24,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-10 14:40:24,403 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:40:24,533 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:40:24,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 381 places, 395 transitions, 804 flow [2024-11-10 14:40:24,756 INFO L124 PetriNetUnfolderBase]: 21/393 cut-off events. [2024-11-10 14:40:24,757 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:40:24,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 393 events. 21/393 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 544 event pairs, 0 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 255. Up to 2 conditions per place. [2024-11-10 14:40:24,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 381 places, 395 transitions, 804 flow [2024-11-10 14:40:24,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 363 places, 376 transitions, 764 flow [2024-11-10 14:40:24,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:40:24,829 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;@4e3e1d2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:40:24,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2024-11-10 14:40:24,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:40:24,834 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2024-11-10 14:40:24,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:40:24,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:24,836 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] [2024-11-10 14:40:24,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 640755503, now seen corresponding path program 1 times [2024-11-10 14:40:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337925932] [2024-11-10 14:40:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:25,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:25,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337925932] [2024-11-10 14:40:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337925932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:25,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:25,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627632907] [2024-11-10 14:40:25,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:25,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:25,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:25,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:25,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 395 [2024-11-10 14:40:25,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 376 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:25,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:25,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 395 [2024-11-10 14:40:25,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:25,265 INFO L124 PetriNetUnfolderBase]: 15/471 cut-off events. [2024-11-10 14:40:25,266 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-10 14:40:25,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 471 events. 15/471 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1077 event pairs, 3 based on Foata normal form. 12/399 useless extension candidates. Maximal degree in co-relation 365. Up to 19 conditions per place. [2024-11-10 14:40:25,275 INFO L140 encePairwiseOnDemand]: 380/395 looper letters, 10 selfloop transitions, 2 changer transitions 4/363 dead transitions. [2024-11-10 14:40:25,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 363 transitions, 762 flow [2024-11-10 14:40:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2024-11-10 14:40:25,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950210970464135 [2024-11-10 14:40:25,301 INFO L175 Difference]: Start difference. First operand has 363 places, 376 transitions, 764 flow. Second operand 3 states and 1126 transitions. [2024-11-10 14:40:25,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 363 transitions, 762 flow [2024-11-10 14:40:25,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 363 transitions, 754 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 14:40:25,314 INFO L231 Difference]: Finished difference. Result has 360 places, 359 transitions, 726 flow [2024-11-10 14:40:25,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=360, PETRI_TRANSITIONS=359} [2024-11-10 14:40:25,322 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -3 predicate places. [2024-11-10 14:40:25,323 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 359 transitions, 726 flow [2024-11-10 14:40:25,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:25,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:25,324 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] [2024-11-10 14:40:25,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:40:25,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:25,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash -109479189, now seen corresponding path program 1 times [2024-11-10 14:40:25,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:25,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025099662] [2024-11-10 14:40:25,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:25,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:25,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025099662] [2024-11-10 14:40:25,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025099662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:25,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935338254] [2024-11-10 14:40:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:25,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:25,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:25,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 395 [2024-11-10 14:40:25,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 359 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:25,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:25,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 395 [2024-11-10 14:40:25,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:25,567 INFO L124 PetriNetUnfolderBase]: 22/559 cut-off events. [2024-11-10 14:40:25,567 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 14:40:25,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 559 events. 22/559 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1417 event pairs, 9 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 573. Up to 33 conditions per place. [2024-11-10 14:40:25,573 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 14 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-10 14:40:25,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 756 flow [2024-11-10 14:40:25,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2024-11-10 14:40:25,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-11-10 14:40:25,577 INFO L175 Difference]: Start difference. First operand has 360 places, 359 transitions, 726 flow. Second operand 3 states and 1106 transitions. [2024-11-10 14:40:25,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 756 flow [2024-11-10 14:40:25,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:25,586 INFO L231 Difference]: Finished difference. Result has 355 places, 358 transitions, 724 flow [2024-11-10 14:40:25,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=355, PETRI_TRANSITIONS=358} [2024-11-10 14:40:25,589 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -8 predicate places. [2024-11-10 14:40:25,589 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 358 transitions, 724 flow [2024-11-10 14:40:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:25,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:25,590 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] [2024-11-10 14:40:25,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:40:25,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:25,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1506724659, now seen corresponding path program 1 times [2024-11-10 14:40:25,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:25,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890911122] [2024-11-10 14:40:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:25,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:25,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890911122] [2024-11-10 14:40:25,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890911122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:25,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:25,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370912978] [2024-11-10 14:40:25,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:25,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:25,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:25,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:25,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:25,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 395 [2024-11-10 14:40:25,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 358 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 356.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:25,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:25,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 395 [2024-11-10 14:40:25,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:25,901 INFO L124 PetriNetUnfolderBase]: 79/1187 cut-off events. [2024-11-10 14:40:25,902 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-10 14:40:25,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 1187 events. 79/1187 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5193 event pairs, 26 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1258. Up to 97 conditions per place. [2024-11-10 14:40:25,916 INFO L140 encePairwiseOnDemand]: 387/395 looper letters, 18 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2024-11-10 14:40:25,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 351 transitions, 748 flow [2024-11-10 14:40:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2024-11-10 14:40:25,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.920675105485232 [2024-11-10 14:40:25,921 INFO L175 Difference]: Start difference. First operand has 355 places, 358 transitions, 724 flow. Second operand 3 states and 1091 transitions. [2024-11-10 14:40:25,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 351 transitions, 748 flow [2024-11-10 14:40:25,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 351 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:25,927 INFO L231 Difference]: Finished difference. Result has 348 places, 351 transitions, 708 flow [2024-11-10 14:40:25,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=348, PETRI_TRANSITIONS=351} [2024-11-10 14:40:25,929 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -15 predicate places. [2024-11-10 14:40:25,929 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 351 transitions, 708 flow [2024-11-10 14:40:25,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:25,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:25,931 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-11-10 14:40:25,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:40:25,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:25,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:25,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1841899093, now seen corresponding path program 1 times [2024-11-10 14:40:25,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:25,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057316598] [2024-11-10 14:40:25,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:25,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:26,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-11-10 14:40:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057316598] [2024-11-10 14:40:26,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057316598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:26,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:26,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667790088] [2024-11-10 14:40:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:26,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:26,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 395 [2024-11-10 14:40:26,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 351 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 344.5) internal successors, (2067), 6 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:26,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:26,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 395 [2024-11-10 14:40:26,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:26,924 INFO L124 PetriNetUnfolderBase]: 154/1468 cut-off events. [2024-11-10 14:40:26,924 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-10 14:40:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 1468 events. 154/1468 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7304 event pairs, 84 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1687. Up to 240 conditions per place. [2024-11-10 14:40:26,937 INFO L140 encePairwiseOnDemand]: 389/395 looper letters, 32 selfloop transitions, 5 changer transitions 0/350 dead transitions. [2024-11-10 14:40:26,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 350 transitions, 780 flow [2024-11-10 14:40:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2096 transitions. [2024-11-10 14:40:26,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8843881856540085 [2024-11-10 14:40:26,942 INFO L175 Difference]: Start difference. First operand has 348 places, 351 transitions, 708 flow. Second operand 6 states and 2096 transitions. [2024-11-10 14:40:26,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 350 transitions, 780 flow [2024-11-10 14:40:26,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 350 transitions, 779 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:26,949 INFO L231 Difference]: Finished difference. Result has 351 places, 350 transitions, 715 flow [2024-11-10 14:40:26,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=715, PETRI_PLACES=351, PETRI_TRANSITIONS=350} [2024-11-10 14:40:26,950 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -12 predicate places. [2024-11-10 14:40:26,951 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 350 transitions, 715 flow [2024-11-10 14:40:26,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.5) internal successors, (2067), 6 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:26,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:26,953 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-11-10 14:40:26,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:40:26,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 722587477, now seen corresponding path program 1 times [2024-11-10 14:40:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66713194] [2024-11-10 14:40:26,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:26,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66713194] [2024-11-10 14:40:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66713194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:26,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363300536] [2024-11-10 14:40:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:26,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:26,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:27,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 395 [2024-11-10 14:40:27,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 350 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:27,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 395 [2024-11-10 14:40:27,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:27,142 INFO L124 PetriNetUnfolderBase]: 22/546 cut-off events. [2024-11-10 14:40:27,142 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 14:40:27,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 546 events. 22/546 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1381 event pairs, 9 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 572. Up to 31 conditions per place. [2024-11-10 14:40:27,147 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 12 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2024-11-10 14:40:27,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 349 transitions, 741 flow [2024-11-10 14:40:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1110 transitions. [2024-11-10 14:40:27,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367088607594937 [2024-11-10 14:40:27,150 INFO L175 Difference]: Start difference. First operand has 351 places, 350 transitions, 715 flow. Second operand 3 states and 1110 transitions. [2024-11-10 14:40:27,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 349 transitions, 741 flow [2024-11-10 14:40:27,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 349 transitions, 731 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:27,157 INFO L231 Difference]: Finished difference. Result has 347 places, 349 transitions, 707 flow [2024-11-10 14:40:27,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=707, PETRI_PLACES=347, PETRI_TRANSITIONS=349} [2024-11-10 14:40:27,158 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -16 predicate places. [2024-11-10 14:40:27,160 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 349 transitions, 707 flow [2024-11-10 14:40:27,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:27,161 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] [2024-11-10 14:40:27,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:40:27,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:27,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:27,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1525531942, now seen corresponding path program 1 times [2024-11-10 14:40:27,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:27,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161242446] [2024-11-10 14:40:27,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:27,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:27,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161242446] [2024-11-10 14:40:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161242446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:27,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353516111] [2024-11-10 14:40:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:27,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:27,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:27,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 395 [2024-11-10 14:40:27,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 349 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:27,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 395 [2024-11-10 14:40:27,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:27,340 INFO L124 PetriNetUnfolderBase]: 36/990 cut-off events. [2024-11-10 14:40:27,340 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:40:27,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 990 events. 36/990 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4005 event pairs, 8 based on Foata normal form. 0/825 useless extension candidates. Maximal degree in co-relation 997. Up to 32 conditions per place. [2024-11-10 14:40:27,347 INFO L140 encePairwiseOnDemand]: 391/395 looper letters, 10 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2024-11-10 14:40:27,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 346 transitions, 723 flow [2024-11-10 14:40:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-10 14:40:27,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9409282700421941 [2024-11-10 14:40:27,350 INFO L175 Difference]: Start difference. First operand has 347 places, 349 transitions, 707 flow. Second operand 3 states and 1115 transitions. [2024-11-10 14:40:27,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 346 transitions, 723 flow [2024-11-10 14:40:27,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 346 transitions, 719 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:27,357 INFO L231 Difference]: Finished difference. Result has 344 places, 346 transitions, 699 flow [2024-11-10 14:40:27,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=344, PETRI_TRANSITIONS=346} [2024-11-10 14:40:27,359 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -19 predicate places. [2024-11-10 14:40:27,359 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 346 transitions, 699 flow [2024-11-10 14:40:27,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:27,360 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] [2024-11-10 14:40:27,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:40:27,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:27,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2020235481, now seen corresponding path program 1 times [2024-11-10 14:40:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:27,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741849861] [2024-11-10 14:40:27,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741849861] [2024-11-10 14:40:27,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741849861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:27,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866420562] [2024-11-10 14:40:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:27,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 395 [2024-11-10 14:40:27,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 346 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:27,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 395 [2024-11-10 14:40:27,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:27,528 INFO L124 PetriNetUnfolderBase]: 21/564 cut-off events. [2024-11-10 14:40:27,528 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:40:27,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 564 events. 21/564 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1144 event pairs, 1 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 570. Up to 20 conditions per place. [2024-11-10 14:40:27,532 INFO L140 encePairwiseOnDemand]: 388/395 looper letters, 11 selfloop transitions, 3 changer transitions 0/343 dead transitions. [2024-11-10 14:40:27,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 343 transitions, 722 flow [2024-11-10 14:40:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1110 transitions. [2024-11-10 14:40:27,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367088607594937 [2024-11-10 14:40:27,535 INFO L175 Difference]: Start difference. First operand has 344 places, 346 transitions, 699 flow. Second operand 3 states and 1110 transitions. [2024-11-10 14:40:27,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 343 transitions, 722 flow [2024-11-10 14:40:27,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 343 transitions, 721 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:27,540 INFO L231 Difference]: Finished difference. Result has 341 places, 342 transitions, 696 flow [2024-11-10 14:40:27,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=341, PETRI_TRANSITIONS=342} [2024-11-10 14:40:27,542 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -22 predicate places. [2024-11-10 14:40:27,542 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 342 transitions, 696 flow [2024-11-10 14:40:27,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:27,543 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] [2024-11-10 14:40:27,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:40:27,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:27,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1568996650, now seen corresponding path program 1 times [2024-11-10 14:40:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:27,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81539075] [2024-11-10 14:40:27,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:27,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:27,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81539075] [2024-11-10 14:40:27,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81539075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:27,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:27,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:27,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275391093] [2024-11-10 14:40:27,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:27,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:27,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:27,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:27,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 395 [2024-11-10 14:40:27,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 342 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:27,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 395 [2024-11-10 14:40:27,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:27,719 INFO L124 PetriNetUnfolderBase]: 40/489 cut-off events. [2024-11-10 14:40:27,719 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-10 14:40:27,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 489 events. 40/489 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1380 event pairs, 4 based on Foata normal form. 1/446 useless extension candidates. Maximal degree in co-relation 553. Up to 73 conditions per place. [2024-11-10 14:40:27,724 INFO L140 encePairwiseOnDemand]: 373/395 looper letters, 24 selfloop transitions, 8 changer transitions 4/330 dead transitions. [2024-11-10 14:40:27,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 330 transitions, 741 flow [2024-11-10 14:40:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2024-11-10 14:40:27,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8852320675105485 [2024-11-10 14:40:27,726 INFO L175 Difference]: Start difference. First operand has 341 places, 342 transitions, 696 flow. Second operand 3 states and 1049 transitions. [2024-11-10 14:40:27,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 330 transitions, 741 flow [2024-11-10 14:40:27,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 330 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:27,732 INFO L231 Difference]: Finished difference. Result has 328 places, 325 transitions, 671 flow [2024-11-10 14:40:27,733 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=671, PETRI_PLACES=328, PETRI_TRANSITIONS=325} [2024-11-10 14:40:27,733 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -35 predicate places. [2024-11-10 14:40:27,734 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 325 transitions, 671 flow [2024-11-10 14:40:27,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:27,735 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] [2024-11-10 14:40:27,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:40:27,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash -941389645, now seen corresponding path program 1 times [2024-11-10 14:40:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039445221] [2024-11-10 14:40:27,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039445221] [2024-11-10 14:40:27,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039445221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:27,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:27,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567263577] [2024-11-10 14:40:27,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:27,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:27,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:27,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:27,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 395 [2024-11-10 14:40:27,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 325 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:27,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 395 [2024-11-10 14:40:27,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:27,918 INFO L124 PetriNetUnfolderBase]: 71/992 cut-off events. [2024-11-10 14:40:27,918 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-10 14:40:27,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 992 events. 71/992 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3936 event pairs, 8 based on Foata normal form. 0/897 useless extension candidates. Maximal degree in co-relation 1089. Up to 86 conditions per place. [2024-11-10 14:40:27,925 INFO L140 encePairwiseOnDemand]: 388/395 looper letters, 16 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2024-11-10 14:40:27,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 324 transitions, 707 flow [2024-11-10 14:40:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2024-11-10 14:40:27,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-11-10 14:40:27,929 INFO L175 Difference]: Start difference. First operand has 328 places, 325 transitions, 671 flow. Second operand 3 states and 1106 transitions. [2024-11-10 14:40:27,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 324 transitions, 707 flow [2024-11-10 14:40:27,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 324 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:27,937 INFO L231 Difference]: Finished difference. Result has 320 places, 322 transitions, 659 flow [2024-11-10 14:40:27,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=320, PETRI_TRANSITIONS=322} [2024-11-10 14:40:27,938 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -43 predicate places. [2024-11-10 14:40:27,939 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 322 transitions, 659 flow [2024-11-10 14:40:27,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:27,940 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] [2024-11-10 14:40:27,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:40:27,940 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:27,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1846246761, now seen corresponding path program 1 times [2024-11-10 14:40:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:27,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083451593] [2024-11-10 14:40:27,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083451593] [2024-11-10 14:40:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083451593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:40:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009618430] [2024-11-10 14:40:28,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:28,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:40:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:28,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:40:28,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:40:28,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 395 [2024-11-10 14:40:28,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 322 transitions, 659 flow. Second operand has 4 states, 4 states have (on average 371.25) internal successors, (1485), 4 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:28,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:28,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 395 [2024-11-10 14:40:28,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:28,244 INFO L124 PetriNetUnfolderBase]: 44/1154 cut-off events. [2024-11-10 14:40:28,245 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:40:28,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 1154 events. 44/1154 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4406 event pairs, 3 based on Foata normal form. 0/1042 useless extension candidates. Maximal degree in co-relation 1189. Up to 18 conditions per place. [2024-11-10 14:40:28,253 INFO L140 encePairwiseOnDemand]: 389/395 looper letters, 13 selfloop transitions, 6 changer transitions 0/331 dead transitions. [2024-11-10 14:40:28,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 331 transitions, 719 flow [2024-11-10 14:40:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:40:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:40:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1870 transitions. [2024-11-10 14:40:28,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468354430379747 [2024-11-10 14:40:28,257 INFO L175 Difference]: Start difference. First operand has 320 places, 322 transitions, 659 flow. Second operand 5 states and 1870 transitions. [2024-11-10 14:40:28,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 331 transitions, 719 flow [2024-11-10 14:40:28,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 331 transitions, 719 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:28,262 INFO L231 Difference]: Finished difference. Result has 327 places, 326 transitions, 697 flow [2024-11-10 14:40:28,263 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=697, PETRI_PLACES=327, PETRI_TRANSITIONS=326} [2024-11-10 14:40:28,264 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -36 predicate places. [2024-11-10 14:40:28,264 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 326 transitions, 697 flow [2024-11-10 14:40:28,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 371.25) internal successors, (1485), 4 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:28,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:28,265 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] [2024-11-10 14:40:28,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:40:28,266 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:28,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:28,266 INFO L85 PathProgramCache]: Analyzing trace with hash 96886111, now seen corresponding path program 1 times [2024-11-10 14:40:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:28,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309715986] [2024-11-10 14:40:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309715986] [2024-11-10 14:40:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309715986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:28,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77930510] [2024-11-10 14:40:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:28,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:28,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 395 [2024-11-10 14:40:28,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 326 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 364.5) internal successors, (2187), 6 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:28,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:28,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 395 [2024-11-10 14:40:28,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:29,148 INFO L124 PetriNetUnfolderBase]: 38/896 cut-off events. [2024-11-10 14:40:29,148 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-10 14:40:29,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 896 events. 38/896 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2786 event pairs, 2 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 952. Up to 17 conditions per place. [2024-11-10 14:40:29,155 INFO L140 encePairwiseOnDemand]: 389/395 looper letters, 15 selfloop transitions, 6 changer transitions 0/329 dead transitions. [2024-11-10 14:40:29,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 329 transitions, 749 flow [2024-11-10 14:40:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2199 transitions. [2024-11-10 14:40:29,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9278481012658227 [2024-11-10 14:40:29,161 INFO L175 Difference]: Start difference. First operand has 327 places, 326 transitions, 697 flow. Second operand 6 states and 2199 transitions. [2024-11-10 14:40:29,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 329 transitions, 749 flow [2024-11-10 14:40:29,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 329 transitions, 749 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:29,169 INFO L231 Difference]: Finished difference. Result has 331 places, 325 transitions, 707 flow [2024-11-10 14:40:29,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=707, PETRI_PLACES=331, PETRI_TRANSITIONS=325} [2024-11-10 14:40:29,170 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -32 predicate places. [2024-11-10 14:40:29,170 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 325 transitions, 707 flow [2024-11-10 14:40:29,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 364.5) internal successors, (2187), 6 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:29,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:29,172 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] [2024-11-10 14:40:29,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:40:29,172 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:29,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:29,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1565690927, now seen corresponding path program 1 times [2024-11-10 14:40:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:29,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348742949] [2024-11-10 14:40:29,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:29,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:29,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:29,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348742949] [2024-11-10 14:40:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348742949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:29,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:29,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:40:29,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650339011] [2024-11-10 14:40:29,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:29,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:40:29,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:40:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:40:29,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 395 [2024-11-10 14:40:29,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 325 transitions, 707 flow. Second operand has 4 states, 4 states have (on average 368.5) internal successors, (1474), 4 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:29,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:29,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 395 [2024-11-10 14:40:29,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:29,505 INFO L124 PetriNetUnfolderBase]: 56/1125 cut-off events. [2024-11-10 14:40:29,505 INFO L125 PetriNetUnfolderBase]: For 34/35 co-relation queries the response was YES. [2024-11-10 14:40:29,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 1125 events. 56/1125 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4880 event pairs, 6 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 1227. Up to 60 conditions per place. [2024-11-10 14:40:29,514 INFO L140 encePairwiseOnDemand]: 389/395 looper letters, 15 selfloop transitions, 6 changer transitions 0/333 dead transitions. [2024-11-10 14:40:29,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 333 transitions, 768 flow [2024-11-10 14:40:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:40:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:40:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1857 transitions. [2024-11-10 14:40:29,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9402531645569621 [2024-11-10 14:40:29,518 INFO L175 Difference]: Start difference. First operand has 331 places, 325 transitions, 707 flow. Second operand 5 states and 1857 transitions. [2024-11-10 14:40:29,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 333 transitions, 768 flow [2024-11-10 14:40:29,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 333 transitions, 756 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:29,523 INFO L231 Difference]: Finished difference. Result has 333 places, 329 transitions, 733 flow [2024-11-10 14:40:29,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=733, PETRI_PLACES=333, PETRI_TRANSITIONS=329} [2024-11-10 14:40:29,524 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -30 predicate places. [2024-11-10 14:40:29,525 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 329 transitions, 733 flow [2024-11-10 14:40:29,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 368.5) internal successors, (1474), 4 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:29,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:29,526 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] [2024-11-10 14:40:29,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:40:29,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:29,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:29,527 INFO L85 PathProgramCache]: Analyzing trace with hash -670840159, now seen corresponding path program 1 times [2024-11-10 14:40:29,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:29,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607572615] [2024-11-10 14:40:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:29,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607572615] [2024-11-10 14:40:29,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607572615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:29,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:29,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858829154] [2024-11-10 14:40:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:29,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:29,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:29,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:29,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2024-11-10 14:40:29,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 329 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:29,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:29,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2024-11-10 14:40:29,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:29,781 INFO L124 PetriNetUnfolderBase]: 51/1451 cut-off events. [2024-11-10 14:40:29,782 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-10 14:40:29,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1451 events. 51/1451 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 6543 event pairs, 10 based on Foata normal form. 0/1329 useless extension candidates. Maximal degree in co-relation 1591. Up to 34 conditions per place. [2024-11-10 14:40:29,792 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 9 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2024-11-10 14:40:29,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 329 transitions, 756 flow [2024-11-10 14:40:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1116 transitions. [2024-11-10 14:40:29,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417721518987342 [2024-11-10 14:40:29,798 INFO L175 Difference]: Start difference. First operand has 333 places, 329 transitions, 733 flow. Second operand 3 states and 1116 transitions. [2024-11-10 14:40:29,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 329 transitions, 756 flow [2024-11-10 14:40:29,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 329 transitions, 756 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:29,804 INFO L231 Difference]: Finished difference. Result has 334 places, 328 transitions, 735 flow [2024-11-10 14:40:29,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=334, PETRI_TRANSITIONS=328} [2024-11-10 14:40:29,806 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -29 predicate places. [2024-11-10 14:40:29,806 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 328 transitions, 735 flow [2024-11-10 14:40:29,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:29,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:29,807 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] [2024-11-10 14:40:29,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:40:29,808 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:29,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1310065372, now seen corresponding path program 1 times [2024-11-10 14:40:29,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:29,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577062510] [2024-11-10 14:40:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:29,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:30,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:30,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577062510] [2024-11-10 14:40:30,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577062510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:30,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:30,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:30,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898229463] [2024-11-10 14:40:30,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:30,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:30,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:30,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:30,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 395 [2024-11-10 14:40:30,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 328 transitions, 735 flow. Second operand has 6 states, 6 states have (on average 343.6666666666667) internal successors, (2062), 6 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:30,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:30,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 395 [2024-11-10 14:40:30,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:30,644 INFO L124 PetriNetUnfolderBase]: 86/977 cut-off events. [2024-11-10 14:40:30,644 INFO L125 PetriNetUnfolderBase]: For 79/80 co-relation queries the response was YES. [2024-11-10 14:40:30,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 977 events. 86/977 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4694 event pairs, 10 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 1236. Up to 70 conditions per place. [2024-11-10 14:40:30,650 INFO L140 encePairwiseOnDemand]: 371/395 looper letters, 18 selfloop transitions, 21 changer transitions 0/328 dead transitions. [2024-11-10 14:40:30,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 328 transitions, 817 flow [2024-11-10 14:40:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2094 transitions. [2024-11-10 14:40:30,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8835443037974684 [2024-11-10 14:40:30,657 INFO L175 Difference]: Start difference. First operand has 334 places, 328 transitions, 735 flow. Second operand 6 states and 2094 transitions. [2024-11-10 14:40:30,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 328 transitions, 817 flow [2024-11-10 14:40:30,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 328 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:30,664 INFO L231 Difference]: Finished difference. Result has 333 places, 324 transitions, 765 flow [2024-11-10 14:40:30,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=765, PETRI_PLACES=333, PETRI_TRANSITIONS=324} [2024-11-10 14:40:30,665 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -30 predicate places. [2024-11-10 14:40:30,665 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 324 transitions, 765 flow [2024-11-10 14:40:30,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 343.6666666666667) internal successors, (2062), 6 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:30,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:30,667 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] [2024-11-10 14:40:30,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:40:30,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:30,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2096381790, now seen corresponding path program 1 times [2024-11-10 14:40:30,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:30,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454940147] [2024-11-10 14:40:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:30,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:30,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:30,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454940147] [2024-11-10 14:40:30,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454940147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:30,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:30,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035449806] [2024-11-10 14:40:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:30,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:30,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:30,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:30,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 395 [2024-11-10 14:40:30,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 324 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:30,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:30,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 395 [2024-11-10 14:40:30,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:30,919 INFO L124 PetriNetUnfolderBase]: 76/1112 cut-off events. [2024-11-10 14:40:30,920 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2024-11-10 14:40:30,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1112 events. 76/1112 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5241 event pairs, 42 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1437. Up to 142 conditions per place. [2024-11-10 14:40:30,928 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 21 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2024-11-10 14:40:30,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 324 transitions, 812 flow [2024-11-10 14:40:30,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2024-11-10 14:40:30,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9215189873417722 [2024-11-10 14:40:30,932 INFO L175 Difference]: Start difference. First operand has 333 places, 324 transitions, 765 flow. Second operand 3 states and 1092 transitions. [2024-11-10 14:40:30,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 324 transitions, 812 flow [2024-11-10 14:40:30,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 324 transitions, 770 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:30,939 INFO L231 Difference]: Finished difference. Result has 329 places, 323 transitions, 725 flow [2024-11-10 14:40:30,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=329, PETRI_TRANSITIONS=323} [2024-11-10 14:40:30,941 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -34 predicate places. [2024-11-10 14:40:30,941 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 323 transitions, 725 flow [2024-11-10 14:40:30,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:30,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:30,942 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] [2024-11-10 14:40:30,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:40:30,942 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:30,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash -213268430, now seen corresponding path program 1 times [2024-11-10 14:40:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:30,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122570698] [2024-11-10 14:40:30,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:30,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122570698] [2024-11-10 14:40:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122570698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:31,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:31,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92646252] [2024-11-10 14:40:31,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:31,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:31,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:31,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:31,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 395 [2024-11-10 14:40:31,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 323 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:31,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:31,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 395 [2024-11-10 14:40:31,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:31,287 INFO L124 PetriNetUnfolderBase]: 75/1075 cut-off events. [2024-11-10 14:40:31,288 INFO L125 PetriNetUnfolderBase]: For 71/72 co-relation queries the response was YES. [2024-11-10 14:40:31,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 1075 events. 75/1075 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4979 event pairs, 42 based on Foata normal form. 0/1014 useless extension candidates. Maximal degree in co-relation 1290. Up to 142 conditions per place. [2024-11-10 14:40:31,294 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 21 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2024-11-10 14:40:31,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 323 transitions, 772 flow [2024-11-10 14:40:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2024-11-10 14:40:31,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9215189873417722 [2024-11-10 14:40:31,298 INFO L175 Difference]: Start difference. First operand has 329 places, 323 transitions, 725 flow. Second operand 3 states and 1092 transitions. [2024-11-10 14:40:31,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 323 transitions, 772 flow [2024-11-10 14:40:31,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 323 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:31,304 INFO L231 Difference]: Finished difference. Result has 328 places, 322 transitions, 723 flow [2024-11-10 14:40:31,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=328, PETRI_TRANSITIONS=322} [2024-11-10 14:40:31,305 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -35 predicate places. [2024-11-10 14:40:31,306 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 322 transitions, 723 flow [2024-11-10 14:40:31,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:31,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:31,307 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] [2024-11-10 14:40:31,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:40:31,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:31,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash 23351910, now seen corresponding path program 1 times [2024-11-10 14:40:31,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:31,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652635619] [2024-11-10 14:40:31,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:31,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:31,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652635619] [2024-11-10 14:40:31,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652635619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:31,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705738912] [2024-11-10 14:40:31,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:31,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:31,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:31,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 395 [2024-11-10 14:40:31,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 322 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:31,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:31,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 395 [2024-11-10 14:40:31,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:31,653 INFO L124 PetriNetUnfolderBase]: 74/1037 cut-off events. [2024-11-10 14:40:31,654 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2024-11-10 14:40:31,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 1037 events. 74/1037 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4692 event pairs, 42 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1251. Up to 142 conditions per place. [2024-11-10 14:40:31,662 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 21 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2024-11-10 14:40:31,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 322 transitions, 770 flow [2024-11-10 14:40:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2024-11-10 14:40:31,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9215189873417722 [2024-11-10 14:40:31,665 INFO L175 Difference]: Start difference. First operand has 328 places, 322 transitions, 723 flow. Second operand 3 states and 1092 transitions. [2024-11-10 14:40:31,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 322 transitions, 770 flow [2024-11-10 14:40:31,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 322 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:31,670 INFO L231 Difference]: Finished difference. Result has 327 places, 321 transitions, 721 flow [2024-11-10 14:40:31,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=327, PETRI_TRANSITIONS=321} [2024-11-10 14:40:31,671 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -36 predicate places. [2024-11-10 14:40:31,671 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 321 transitions, 721 flow [2024-11-10 14:40:31,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:31,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:31,672 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] [2024-11-10 14:40:31,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:40:31,672 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-11-10 14:40:31,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:31,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1083651578, now seen corresponding path program 1 times [2024-11-10 14:40:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:31,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95036945] [2024-11-10 14:40:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:31,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95036945] [2024-11-10 14:40:31,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95036945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:31,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:31,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:31,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386703326] [2024-11-10 14:40:31,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:31,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:31,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:31,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 395 [2024-11-10 14:40:31,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 321 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:31,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:31,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 395 [2024-11-10 14:40:31,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:31,949 INFO L124 PetriNetUnfolderBase]: 73/999 cut-off events. [2024-11-10 14:40:31,950 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2024-11-10 14:40:31,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 999 events. 73/999 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4487 event pairs, 42 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 1213. Up to 142 conditions per place. [2024-11-10 14:40:31,955 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 0 selfloop transitions, 0 changer transitions 321/321 dead transitions. [2024-11-10 14:40:31,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 321 transitions, 768 flow [2024-11-10 14:40:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2024-11-10 14:40:31,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9215189873417722 [2024-11-10 14:40:31,959 INFO L175 Difference]: Start difference. First operand has 327 places, 321 transitions, 721 flow. Second operand 3 states and 1092 transitions. [2024-11-10 14:40:31,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 321 transitions, 768 flow [2024-11-10 14:40:31,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 321 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:31,963 INFO L231 Difference]: Finished difference. Result has 326 places, 0 transitions, 0 flow [2024-11-10 14:40:31,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=326, PETRI_TRANSITIONS=0} [2024-11-10 14:40:31,964 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -37 predicate places. [2024-11-10 14:40:31,964 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 0 transitions, 0 flow [2024-11-10 14:40:31,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (84 of 85 remaining) [2024-11-10 14:40:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (83 of 85 remaining) [2024-11-10 14:40:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 85 remaining) [2024-11-10 14:40:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 85 remaining) [2024-11-10 14:40:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (80 of 85 remaining) [2024-11-10 14:40:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (79 of 85 remaining) [2024-11-10 14:40:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (78 of 85 remaining) [2024-11-10 14:40:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (77 of 85 remaining) [2024-11-10 14:40:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (76 of 85 remaining) [2024-11-10 14:40:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (75 of 85 remaining) [2024-11-10 14:40:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (74 of 85 remaining) [2024-11-10 14:40:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (73 of 85 remaining) [2024-11-10 14:40:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (72 of 85 remaining) [2024-11-10 14:40:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (71 of 85 remaining) [2024-11-10 14:40:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (70 of 85 remaining) [2024-11-10 14:40:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 85 remaining) [2024-11-10 14:40:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (68 of 85 remaining) [2024-11-10 14:40:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (67 of 85 remaining) [2024-11-10 14:40:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (66 of 85 remaining) [2024-11-10 14:40:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (65 of 85 remaining) [2024-11-10 14:40:31,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (64 of 85 remaining) [2024-11-10 14:40:31,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (63 of 85 remaining) [2024-11-10 14:40:31,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (62 of 85 remaining) [2024-11-10 14:40:31,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (61 of 85 remaining) [2024-11-10 14:40:31,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (60 of 85 remaining) [2024-11-10 14:40:31,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (59 of 85 remaining) [2024-11-10 14:40:31,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (58 of 85 remaining) [2024-11-10 14:40:31,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (57 of 85 remaining) [2024-11-10 14:40:31,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (56 of 85 remaining) [2024-11-10 14:40:31,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (55 of 85 remaining) [2024-11-10 14:40:31,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 85 remaining) [2024-11-10 14:40:31,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 85 remaining) [2024-11-10 14:40:31,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (52 of 85 remaining) [2024-11-10 14:40:31,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 85 remaining) [2024-11-10 14:40:31,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (50 of 85 remaining) [2024-11-10 14:40:31,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (49 of 85 remaining) [2024-11-10 14:40:31,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (48 of 85 remaining) [2024-11-10 14:40:31,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (47 of 85 remaining) [2024-11-10 14:40:31,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (46 of 85 remaining) [2024-11-10 14:40:31,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (45 of 85 remaining) [2024-11-10 14:40:31,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 85 remaining) [2024-11-10 14:40:31,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 85 remaining) [2024-11-10 14:40:31,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 85 remaining) [2024-11-10 14:40:31,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 85 remaining) [2024-11-10 14:40:31,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 85 remaining) [2024-11-10 14:40:31,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 85 remaining) [2024-11-10 14:40:31,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 85 remaining) [2024-11-10 14:40:31,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 85 remaining) [2024-11-10 14:40:31,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 85 remaining) [2024-11-10 14:40:31,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 85 remaining) [2024-11-10 14:40:31,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (34 of 85 remaining) [2024-11-10 14:40:31,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (33 of 85 remaining) [2024-11-10 14:40:31,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 85 remaining) [2024-11-10 14:40:31,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 85 remaining) [2024-11-10 14:40:31,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 85 remaining) [2024-11-10 14:40:31,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 85 remaining) [2024-11-10 14:40:31,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (28 of 85 remaining) [2024-11-10 14:40:31,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (27 of 85 remaining) [2024-11-10 14:40:31,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (26 of 85 remaining) [2024-11-10 14:40:31,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (25 of 85 remaining) [2024-11-10 14:40:31,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (24 of 85 remaining) [2024-11-10 14:40:31,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 85 remaining) [2024-11-10 14:40:31,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 85 remaining) [2024-11-10 14:40:31,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (21 of 85 remaining) [2024-11-10 14:40:31,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (20 of 85 remaining) [2024-11-10 14:40:31,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 85 remaining) [2024-11-10 14:40:31,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 85 remaining) [2024-11-10 14:40:31,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 85 remaining) [2024-11-10 14:40:31,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 85 remaining) [2024-11-10 14:40:31,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 85 remaining) [2024-11-10 14:40:31,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 85 remaining) [2024-11-10 14:40:31,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 85 remaining) [2024-11-10 14:40:31,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 85 remaining) [2024-11-10 14:40:31,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 85 remaining) [2024-11-10 14:40:31,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 85 remaining) [2024-11-10 14:40:31,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 85 remaining) [2024-11-10 14:40:31,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 85 remaining) [2024-11-10 14:40:31,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 85 remaining) [2024-11-10 14:40:31,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 85 remaining) [2024-11-10 14:40:31,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 85 remaining) [2024-11-10 14:40:31,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 85 remaining) [2024-11-10 14:40:31,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 85 remaining) [2024-11-10 14:40:31,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 85 remaining) [2024-11-10 14:40:31,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 85 remaining) [2024-11-10 14:40:31,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 85 remaining) [2024-11-10 14:40:31,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:40:31,980 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:31,985 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:40:31,986 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:40:31,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:40:31 BasicIcfg [2024-11-10 14:40:31,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:40:31,991 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:40:31,992 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:40:31,992 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:40:31,992 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:24" (3/4) ... [2024-11-10 14:40:31,994 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:40:31,997 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:40:31,997 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:40:32,001 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-10 14:40:32,002 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:40:32,002 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:40:32,002 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:40:32,095 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:40:32,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:40:32,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:40:32,096 INFO L158 Benchmark]: Toolchain (without parser) took 8930.89ms. Allocated memory was 157.3MB in the beginning and 434.1MB in the end (delta: 276.8MB). Free memory was 124.3MB in the beginning and 144.5MB in the end (delta: -20.2MB). Peak memory consumption was 256.4MB. Max. memory is 16.1GB. [2024-11-10 14:40:32,096 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:40:32,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.60ms. Allocated memory is still 157.3MB. Free memory was 124.3MB in the beginning and 109.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:40:32,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.07ms. Allocated memory is still 157.3MB. Free memory was 109.8MB in the beginning and 107.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:32,098 INFO L158 Benchmark]: Boogie Preprocessor took 36.60ms. Allocated memory is still 157.3MB. Free memory was 107.0MB in the beginning and 104.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:32,098 INFO L158 Benchmark]: IcfgBuilder took 768.09ms. Allocated memory is still 157.3MB. Free memory was 104.2MB in the beginning and 102.4MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 14:40:32,098 INFO L158 Benchmark]: TraceAbstraction took 7611.87ms. Allocated memory was 157.3MB in the beginning and 434.1MB in the end (delta: 276.8MB). Free memory was 102.4MB in the beginning and 150.8MB in the end (delta: -48.5MB). Peak memory consumption was 230.3MB. Max. memory is 16.1GB. [2024-11-10 14:40:32,098 INFO L158 Benchmark]: Witness Printer took 104.27ms. Allocated memory is still 434.1MB. Free memory was 150.8MB in the beginning and 144.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:40:32,100 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.60ms. Allocated memory is still 157.3MB. Free memory was 124.3MB in the beginning and 109.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.07ms. Allocated memory is still 157.3MB. Free memory was 109.8MB in the beginning and 107.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.60ms. Allocated memory is still 157.3MB. Free memory was 107.0MB in the beginning and 104.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 768.09ms. Allocated memory is still 157.3MB. Free memory was 104.2MB in the beginning and 102.4MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7611.87ms. Allocated memory was 157.3MB in the beginning and 434.1MB in the end (delta: 276.8MB). Free memory was 102.4MB in the beginning and 150.8MB in the end (delta: -48.5MB). Peak memory consumption was 230.3MB. Max. memory is 16.1GB. * Witness Printer took 104.27ms. Allocated memory is still 434.1MB. Free memory was 150.8MB in the beginning and 144.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 610 locations, 85 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1425 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 591 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1521 IncrementalHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 236 mSolverCounterUnsat, 247 mSDtfsCounter, 1521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=765occurred in iteration=14, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1860 NumberOfCodeBlocks, 1860 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1842 ConstructedInterpolants, 0 QuantifiedInterpolants, 2563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 46 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:40:32,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE