./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:15:45,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:15:45,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:15:45,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:15:45,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:15:45,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:15:45,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:15:45,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:15:45,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:15:45,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:15:45,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:15:45,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:15:45,887 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:15:45,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:15:45,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:15:45,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:15:45,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:15:45,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:15:45,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:15:45,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:15:45,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:15:45,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:15:45,893 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:15:45,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:15:45,894 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:15:45,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:15:45,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:15:45,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:15:45,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:15:45,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:15:45,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:15:45,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:45,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:15:45,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:15:45,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:15:45,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:15:45,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:15:45,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:15:45,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:15:45,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:15:45,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:15:45,901 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c [2024-10-11 17:15:46,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:15:46,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:15:46,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:15:46,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:15:46,160 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:15:46,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2024-10-11 17:15:47,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:15:47,609 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:15:47,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2024-10-11 17:15:47,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/376a59709/992c61ee5a7b41ed8f8ece8e90547e70/FLAG4b0c8a2a1 [2024-10-11 17:15:47,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/376a59709/992c61ee5a7b41ed8f8ece8e90547e70 [2024-10-11 17:15:47,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:15:47,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:15:47,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:47,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:15:47,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:15:47,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:47,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5c467b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47, skipping insertion in model container [2024-10-11 17:15:47,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:47,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:15:47,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:47,882 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:15:47,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:47,963 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:15:47,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47 WrapperNode [2024-10-11 17:15:47,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:47,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:47,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:15:47,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:15:47,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:47,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,006 INFO L138 Inliner]: procedures = 21, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2024-10-11 17:15:48,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:48,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:15:48,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:15:48,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:15:48,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:15:48,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:15:48,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:15:48,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:15:48,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (1/1) ... [2024-10-11 17:15:48,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:48,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:15:48,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:15:48,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:15:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:15:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:15:48,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:15:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:15:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:15:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:15:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:15:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:15:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:15:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:15:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:15:48,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:15:48,122 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:15:48,199 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:15:48,202 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:15:48,478 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:15:48,479 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:15:48,550 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:15:48,550 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 17:15:48,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:48 BoogieIcfgContainer [2024-10-11 17:15:48,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:15:48,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:15:48,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:15:48,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:15:48,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:15:47" (1/3) ... [2024-10-11 17:15:48,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5773ac51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:48, skipping insertion in model container [2024-10-11 17:15:48,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:47" (2/3) ... [2024-10-11 17:15:48,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5773ac51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:48, skipping insertion in model container [2024-10-11 17:15:48,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:48" (3/3) ... [2024-10-11 17:15:48,560 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2024-10-11 17:15:48,575 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:15:48,575 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-11 17:15:48,575 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:15:48,667 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:15:48,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 235 transitions, 491 flow [2024-10-11 17:15:48,775 INFO L124 PetriNetUnfolderBase]: 16/232 cut-off events. [2024-10-11 17:15:48,776 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:15:48,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 232 events. 16/232 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 528 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 165. Up to 4 conditions per place. [2024-10-11 17:15:48,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 235 transitions, 491 flow [2024-10-11 17:15:48,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 215 transitions, 448 flow [2024-10-11 17:15:48,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:15:48,817 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;@6ea3f832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:15:48,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2024-10-11 17:15:48,822 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:15:48,823 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-10-11 17:15:48,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:15:48,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:48,823 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] [2024-10-11 17:15:48,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:48,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1070996745, now seen corresponding path program 1 times [2024-10-11 17:15:48,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:48,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882536020] [2024-10-11 17:15:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:49,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:49,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882536020] [2024-10-11 17:15:49,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882536020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:49,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:49,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022362850] [2024-10-11 17:15:49,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:49,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:49,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:49,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:49,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 235 [2024-10-11 17:15:49,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 215 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:49,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 235 [2024-10-11 17:15:49,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:49,329 INFO L124 PetriNetUnfolderBase]: 134/713 cut-off events. [2024-10-11 17:15:49,331 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-11 17:15:49,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 713 events. 134/713 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3797 event pairs, 47 based on Foata normal form. 48/618 useless extension candidates. Maximal degree in co-relation 795. Up to 152 conditions per place. [2024-10-11 17:15:49,351 INFO L140 encePairwiseOnDemand]: 217/235 looper letters, 19 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-10-11 17:15:49,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 199 transitions, 458 flow [2024-10-11 17:15:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2024-10-11 17:15:49,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8822695035460993 [2024-10-11 17:15:49,372 INFO L175 Difference]: Start difference. First operand has 210 places, 215 transitions, 448 flow. Second operand 3 states and 622 transitions. [2024-10-11 17:15:49,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 199 transitions, 458 flow [2024-10-11 17:15:49,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 199 transitions, 446 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:15:49,383 INFO L231 Difference]: Finished difference. Result has 193 places, 199 transitions, 408 flow [2024-10-11 17:15:49,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=193, PETRI_TRANSITIONS=199} [2024-10-11 17:15:49,391 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -17 predicate places. [2024-10-11 17:15:49,391 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 199 transitions, 408 flow [2024-10-11 17:15:49,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:49,392 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] [2024-10-11 17:15:49,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:15:49,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:49,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash -538025797, now seen corresponding path program 1 times [2024-10-11 17:15:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:49,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799531856] [2024-10-11 17:15:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799531856] [2024-10-11 17:15:49,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799531856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:49,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969619804] [2024-10-11 17:15:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:49,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:49,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:49,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:49,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:49,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 235 [2024-10-11 17:15:49,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 199 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:49,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 235 [2024-10-11 17:15:49,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:49,586 INFO L124 PetriNetUnfolderBase]: 134/595 cut-off events. [2024-10-11 17:15:49,587 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-11 17:15:49,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 595 events. 134/595 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3019 event pairs, 55 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 753. Up to 166 conditions per place. [2024-10-11 17:15:49,595 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 19 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2024-10-11 17:15:49,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 198 transitions, 448 flow [2024-10-11 17:15:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2024-10-11 17:15:49,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8609929078014185 [2024-10-11 17:15:49,601 INFO L175 Difference]: Start difference. First operand has 193 places, 199 transitions, 408 flow. Second operand 3 states and 607 transitions. [2024-10-11 17:15:49,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 198 transitions, 448 flow [2024-10-11 17:15:49,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 198 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:49,606 INFO L231 Difference]: Finished difference. Result has 192 places, 198 transitions, 406 flow [2024-10-11 17:15:49,608 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=192, PETRI_TRANSITIONS=198} [2024-10-11 17:15:49,609 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -18 predicate places. [2024-10-11 17:15:49,609 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 198 transitions, 406 flow [2024-10-11 17:15:49,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:49,610 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-10-11 17:15:49,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:15:49,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:49,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash 377681158, now seen corresponding path program 1 times [2024-10-11 17:15:49,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:49,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842363649] [2024-10-11 17:15:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:49,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:49,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842363649] [2024-10-11 17:15:49,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842363649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:49,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:49,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:49,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238381072] [2024-10-11 17:15:49,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:49,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:49,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:49,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:49,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:49,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 235 [2024-10-11 17:15:49,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 198 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:49,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 235 [2024-10-11 17:15:49,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:49,770 INFO L124 PetriNetUnfolderBase]: 118/538 cut-off events. [2024-10-11 17:15:49,770 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-10-11 17:15:49,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 538 events. 118/538 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2483 event pairs, 47 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 663. Up to 146 conditions per place. [2024-10-11 17:15:49,776 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 19 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2024-10-11 17:15:49,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 197 transitions, 446 flow [2024-10-11 17:15:49,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2024-10-11 17:15:49,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8609929078014185 [2024-10-11 17:15:49,778 INFO L175 Difference]: Start difference. First operand has 192 places, 198 transitions, 406 flow. Second operand 3 states and 607 transitions. [2024-10-11 17:15:49,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 197 transitions, 446 flow [2024-10-11 17:15:49,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 197 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:49,783 INFO L231 Difference]: Finished difference. Result has 191 places, 197 transitions, 404 flow [2024-10-11 17:15:49,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=191, PETRI_TRANSITIONS=197} [2024-10-11 17:15:49,784 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -19 predicate places. [2024-10-11 17:15:49,784 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 197 transitions, 404 flow [2024-10-11 17:15:49,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:49,786 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:49,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:15:49,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:49,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:49,787 INFO L85 PathProgramCache]: Analyzing trace with hash -516106470, now seen corresponding path program 1 times [2024-10-11 17:15:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:49,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008047513] [2024-10-11 17:15:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:49,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008047513] [2024-10-11 17:15:49,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008047513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:49,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:49,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:49,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419043427] [2024-10-11 17:15:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:49,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:49,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:49,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 235 [2024-10-11 17:15:49,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 197 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:49,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 235 [2024-10-11 17:15:49,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:49,939 INFO L124 PetriNetUnfolderBase]: 98/594 cut-off events. [2024-10-11 17:15:49,939 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:15:49,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 594 events. 98/594 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2871 event pairs, 31 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 682. Up to 108 conditions per place. [2024-10-11 17:15:49,944 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 17 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2024-10-11 17:15:49,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 196 transitions, 440 flow [2024-10-11 17:15:49,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2024-10-11 17:15:49,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2024-10-11 17:15:49,946 INFO L175 Difference]: Start difference. First operand has 191 places, 197 transitions, 404 flow. Second operand 3 states and 611 transitions. [2024-10-11 17:15:49,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 196 transitions, 440 flow [2024-10-11 17:15:49,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 196 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:49,949 INFO L231 Difference]: Finished difference. Result has 190 places, 196 transitions, 402 flow [2024-10-11 17:15:49,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=190, PETRI_TRANSITIONS=196} [2024-10-11 17:15:49,950 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -20 predicate places. [2024-10-11 17:15:49,951 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 196 transitions, 402 flow [2024-10-11 17:15:49,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:49,951 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] [2024-10-11 17:15:49,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:15:49,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:49,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1229263252, now seen corresponding path program 1 times [2024-10-11 17:15:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:49,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608092538] [2024-10-11 17:15:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608092538] [2024-10-11 17:15:49,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608092538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:49,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:49,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:49,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204087498] [2024-10-11 17:15:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:49,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:49,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:49,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:49,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:49,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 235 [2024-10-11 17:15:49,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 196 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:49,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 235 [2024-10-11 17:15:49,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,061 INFO L124 PetriNetUnfolderBase]: 100/556 cut-off events. [2024-10-11 17:15:50,061 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:15:50,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 556 events. 100/556 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2777 event pairs, 35 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 645. Up to 116 conditions per place. [2024-10-11 17:15:50,067 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 17 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2024-10-11 17:15:50,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 195 transitions, 438 flow [2024-10-11 17:15:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2024-10-11 17:15:50,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2024-10-11 17:15:50,069 INFO L175 Difference]: Start difference. First operand has 190 places, 196 transitions, 402 flow. Second operand 3 states and 611 transitions. [2024-10-11 17:15:50,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 195 transitions, 438 flow [2024-10-11 17:15:50,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 195 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:50,072 INFO L231 Difference]: Finished difference. Result has 189 places, 195 transitions, 400 flow [2024-10-11 17:15:50,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=189, PETRI_TRANSITIONS=195} [2024-10-11 17:15:50,073 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -21 predicate places. [2024-10-11 17:15:50,073 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 195 transitions, 400 flow [2024-10-11 17:15:50,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,074 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] [2024-10-11 17:15:50,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:15:50,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1752913406, now seen corresponding path program 1 times [2024-10-11 17:15:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27903900] [2024-10-11 17:15:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:50,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27903900] [2024-10-11 17:15:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27903900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464611438] [2024-10-11 17:15:50,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 235 [2024-10-11 17:15:50,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 235 [2024-10-11 17:15:50,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,191 INFO L124 PetriNetUnfolderBase]: 91/514 cut-off events. [2024-10-11 17:15:50,191 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-11 17:15:50,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 514 events. 91/514 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2381 event pairs, 31 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 583. Up to 105 conditions per place. [2024-10-11 17:15:50,196 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 17 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-10-11 17:15:50,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 194 transitions, 436 flow [2024-10-11 17:15:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2024-10-11 17:15:50,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2024-10-11 17:15:50,199 INFO L175 Difference]: Start difference. First operand has 189 places, 195 transitions, 400 flow. Second operand 3 states and 611 transitions. [2024-10-11 17:15:50,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 194 transitions, 436 flow [2024-10-11 17:15:50,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 194 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:50,202 INFO L231 Difference]: Finished difference. Result has 188 places, 194 transitions, 398 flow [2024-10-11 17:15:50,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=188, PETRI_TRANSITIONS=194} [2024-10-11 17:15:50,204 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -22 predicate places. [2024-10-11 17:15:50,205 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 194 transitions, 398 flow [2024-10-11 17:15:50,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,205 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:50,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:15:50,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:50,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1779764577, now seen corresponding path program 1 times [2024-10-11 17:15:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712888622] [2024-10-11 17:15:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712888622] [2024-10-11 17:15:50,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712888622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360214099] [2024-10-11 17:15:50,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 235 [2024-10-11 17:15:50,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 194 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 235 [2024-10-11 17:15:50,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,331 INFO L124 PetriNetUnfolderBase]: 109/589 cut-off events. [2024-10-11 17:15:50,331 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:15:50,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 589 events. 109/589 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2823 event pairs, 10 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 688. Up to 97 conditions per place. [2024-10-11 17:15:50,336 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 21 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2024-10-11 17:15:50,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 200 transitions, 458 flow [2024-10-11 17:15:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2024-10-11 17:15:50,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8893617021276595 [2024-10-11 17:15:50,338 INFO L175 Difference]: Start difference. First operand has 188 places, 194 transitions, 398 flow. Second operand 3 states and 627 transitions. [2024-10-11 17:15:50,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 200 transitions, 458 flow [2024-10-11 17:15:50,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 200 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:50,341 INFO L231 Difference]: Finished difference. Result has 188 places, 194 transitions, 402 flow [2024-10-11 17:15:50,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=188, PETRI_TRANSITIONS=194} [2024-10-11 17:15:50,342 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -22 predicate places. [2024-10-11 17:15:50,342 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 194 transitions, 402 flow [2024-10-11 17:15:50,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,343 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] [2024-10-11 17:15:50,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:15:50,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:50,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash -404091330, now seen corresponding path program 1 times [2024-10-11 17:15:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375431909] [2024-10-11 17:15:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:50,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375431909] [2024-10-11 17:15:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375431909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954565817] [2024-10-11 17:15:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 235 [2024-10-11 17:15:50,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 194 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 235 [2024-10-11 17:15:50,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,500 INFO L124 PetriNetUnfolderBase]: 171/646 cut-off events. [2024-10-11 17:15:50,500 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-11 17:15:50,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 646 events. 171/646 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3365 event pairs, 15 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 812. Up to 171 conditions per place. [2024-10-11 17:15:50,507 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 27 selfloop transitions, 3 changer transitions 0/201 dead transitions. [2024-10-11 17:15:50,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 201 transitions, 481 flow [2024-10-11 17:15:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2024-10-11 17:15:50,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8765957446808511 [2024-10-11 17:15:50,509 INFO L175 Difference]: Start difference. First operand has 188 places, 194 transitions, 402 flow. Second operand 3 states and 618 transitions. [2024-10-11 17:15:50,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 201 transitions, 481 flow [2024-10-11 17:15:50,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 201 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:50,513 INFO L231 Difference]: Finished difference. Result has 187 places, 192 transitions, 407 flow [2024-10-11 17:15:50,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=187, PETRI_TRANSITIONS=192} [2024-10-11 17:15:50,515 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -23 predicate places. [2024-10-11 17:15:50,515 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 192 transitions, 407 flow [2024-10-11 17:15:50,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,516 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] [2024-10-11 17:15:50,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:15:50,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:50,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1086025729, now seen corresponding path program 1 times [2024-10-11 17:15:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022758103] [2024-10-11 17:15:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:50,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022758103] [2024-10-11 17:15:50,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022758103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374118433] [2024-10-11 17:15:50,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,575 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 235 [2024-10-11 17:15:50,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 192 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 235 [2024-10-11 17:15:50,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,683 INFO L124 PetriNetUnfolderBase]: 187/1083 cut-off events. [2024-10-11 17:15:50,683 INFO L125 PetriNetUnfolderBase]: For 25/32 co-relation queries the response was YES. [2024-10-11 17:15:50,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1083 events. 187/1083 cut-off events. For 25/32 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6368 event pairs, 34 based on Foata normal form. 1/861 useless extension candidates. Maximal degree in co-relation 870. Up to 137 conditions per place. [2024-10-11 17:15:50,693 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 21 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2024-10-11 17:15:50,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 198 transitions, 467 flow [2024-10-11 17:15:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2024-10-11 17:15:50,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8893617021276595 [2024-10-11 17:15:50,695 INFO L175 Difference]: Start difference. First operand has 187 places, 192 transitions, 407 flow. Second operand 3 states and 627 transitions. [2024-10-11 17:15:50,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 198 transitions, 467 flow [2024-10-11 17:15:50,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 198 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:50,698 INFO L231 Difference]: Finished difference. Result has 188 places, 192 transitions, 412 flow [2024-10-11 17:15:50,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=188, PETRI_TRANSITIONS=192} [2024-10-11 17:15:50,699 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -22 predicate places. [2024-10-11 17:15:50,700 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 192 transitions, 412 flow [2024-10-11 17:15:50,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,700 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] [2024-10-11 17:15:50,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:15:50,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:50,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 196858190, now seen corresponding path program 1 times [2024-10-11 17:15:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382278959] [2024-10-11 17:15:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:50,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382278959] [2024-10-11 17:15:50,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382278959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51872628] [2024-10-11 17:15:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 235 [2024-10-11 17:15:50,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 192 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 235 [2024-10-11 17:15:50,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,873 INFO L124 PetriNetUnfolderBase]: 258/892 cut-off events. [2024-10-11 17:15:50,874 INFO L125 PetriNetUnfolderBase]: For 53/68 co-relation queries the response was YES. [2024-10-11 17:15:50,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 892 events. 258/892 cut-off events. For 53/68 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5101 event pairs, 20 based on Foata normal form. 3/768 useless extension candidates. Maximal degree in co-relation 900. Up to 257 conditions per place. [2024-10-11 17:15:50,882 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 26 selfloop transitions, 3 changer transitions 0/198 dead transitions. [2024-10-11 17:15:50,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 198 transitions, 486 flow [2024-10-11 17:15:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2024-10-11 17:15:50,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875177304964539 [2024-10-11 17:15:50,885 INFO L175 Difference]: Start difference. First operand has 188 places, 192 transitions, 412 flow. Second operand 3 states and 617 transitions. [2024-10-11 17:15:50,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 198 transitions, 486 flow [2024-10-11 17:15:50,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 198 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:50,890 INFO L231 Difference]: Finished difference. Result has 187 places, 190 transitions, 417 flow [2024-10-11 17:15:50,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=187, PETRI_TRANSITIONS=190} [2024-10-11 17:15:50,891 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -23 predicate places. [2024-10-11 17:15:50,891 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 190 transitions, 417 flow [2024-10-11 17:15:50,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,892 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:50,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:15:50,893 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:50,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1339665671, now seen corresponding path program 1 times [2024-10-11 17:15:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641041375] [2024-10-11 17:15:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:50,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641041375] [2024-10-11 17:15:50,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641041375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733329646] [2024-10-11 17:15:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 235 [2024-10-11 17:15:50,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 190 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 235 [2024-10-11 17:15:50,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,059 INFO L124 PetriNetUnfolderBase]: 184/776 cut-off events. [2024-10-11 17:15:51,060 INFO L125 PetriNetUnfolderBase]: For 26/39 co-relation queries the response was YES. [2024-10-11 17:15:51,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 776 events. 184/776 cut-off events. For 26/39 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4504 event pairs, 62 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 913. Up to 194 conditions per place. [2024-10-11 17:15:51,068 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 25 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2024-10-11 17:15:51,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 195 transitions, 483 flow [2024-10-11 17:15:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2024-10-11 17:15:51,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8765957446808511 [2024-10-11 17:15:51,071 INFO L175 Difference]: Start difference. First operand has 187 places, 190 transitions, 417 flow. Second operand 3 states and 618 transitions. [2024-10-11 17:15:51,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 195 transitions, 483 flow [2024-10-11 17:15:51,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:51,075 INFO L231 Difference]: Finished difference. Result has 187 places, 189 transitions, 416 flow [2024-10-11 17:15:51,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=187, PETRI_TRANSITIONS=189} [2024-10-11 17:15:51,076 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -23 predicate places. [2024-10-11 17:15:51,076 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 189 transitions, 416 flow [2024-10-11 17:15:51,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:51,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:15:51,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:51,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash -71110337, now seen corresponding path program 1 times [2024-10-11 17:15:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710147237] [2024-10-11 17:15:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710147237] [2024-10-11 17:15:51,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710147237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281736180] [2024-10-11 17:15:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 235 [2024-10-11 17:15:51,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 235 [2024-10-11 17:15:51,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,210 INFO L124 PetriNetUnfolderBase]: 151/656 cut-off events. [2024-10-11 17:15:51,211 INFO L125 PetriNetUnfolderBase]: For 31/39 co-relation queries the response was YES. [2024-10-11 17:15:51,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 656 events. 151/656 cut-off events. For 31/39 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3350 event pairs, 30 based on Foata normal form. 1/559 useless extension candidates. Maximal degree in co-relation 633. Up to 132 conditions per place. [2024-10-11 17:15:51,219 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 21 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2024-10-11 17:15:51,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 195 transitions, 476 flow [2024-10-11 17:15:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2024-10-11 17:15:51,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8893617021276595 [2024-10-11 17:15:51,221 INFO L175 Difference]: Start difference. First operand has 187 places, 189 transitions, 416 flow. Second operand 3 states and 627 transitions. [2024-10-11 17:15:51,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 195 transitions, 476 flow [2024-10-11 17:15:51,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 195 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:51,223 INFO L231 Difference]: Finished difference. Result has 187 places, 189 transitions, 420 flow [2024-10-11 17:15:51,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=187, PETRI_TRANSITIONS=189} [2024-10-11 17:15:51,224 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -23 predicate places. [2024-10-11 17:15:51,224 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 189 transitions, 420 flow [2024-10-11 17:15:51,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,225 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] [2024-10-11 17:15:51,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:15:51,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:51,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1028416900, now seen corresponding path program 1 times [2024-10-11 17:15:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605733208] [2024-10-11 17:15:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:51,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605733208] [2024-10-11 17:15:51,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605733208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220013214] [2024-10-11 17:15:51,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 235 [2024-10-11 17:15:51,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 235 [2024-10-11 17:15:51,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,379 INFO L124 PetriNetUnfolderBase]: 236/892 cut-off events. [2024-10-11 17:15:51,379 INFO L125 PetriNetUnfolderBase]: For 83/92 co-relation queries the response was YES. [2024-10-11 17:15:51,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 892 events. 236/892 cut-off events. For 83/92 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5413 event pairs, 22 based on Foata normal form. 1/796 useless extension candidates. Maximal degree in co-relation 902. Up to 252 conditions per place. [2024-10-11 17:15:51,384 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 25 selfloop transitions, 3 changer transitions 0/194 dead transitions. [2024-10-11 17:15:51,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 194 transitions, 489 flow [2024-10-11 17:15:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2024-10-11 17:15:51,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.873758865248227 [2024-10-11 17:15:51,386 INFO L175 Difference]: Start difference. First operand has 187 places, 189 transitions, 420 flow. Second operand 3 states and 616 transitions. [2024-10-11 17:15:51,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 194 transitions, 489 flow [2024-10-11 17:15:51,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 194 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:51,389 INFO L231 Difference]: Finished difference. Result has 186 places, 187 transitions, 425 flow [2024-10-11 17:15:51,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=186, PETRI_TRANSITIONS=187} [2024-10-11 17:15:51,390 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -24 predicate places. [2024-10-11 17:15:51,390 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 187 transitions, 425 flow [2024-10-11 17:15:51,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,391 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] [2024-10-11 17:15:51,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:15:51,391 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:51,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash -83577415, now seen corresponding path program 1 times [2024-10-11 17:15:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761089467] [2024-10-11 17:15:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:51,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761089467] [2024-10-11 17:15:51,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761089467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970761078] [2024-10-11 17:15:51,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 235 [2024-10-11 17:15:51,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 187 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 235 [2024-10-11 17:15:51,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,562 INFO L124 PetriNetUnfolderBase]: 264/1031 cut-off events. [2024-10-11 17:15:51,562 INFO L125 PetriNetUnfolderBase]: For 73/81 co-relation queries the response was YES. [2024-10-11 17:15:51,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 1031 events. 264/1031 cut-off events. For 73/81 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6105 event pairs, 87 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 949. Up to 269 conditions per place. [2024-10-11 17:15:51,569 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 25 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2024-10-11 17:15:51,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 192 transitions, 491 flow [2024-10-11 17:15:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2024-10-11 17:15:51,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8765957446808511 [2024-10-11 17:15:51,571 INFO L175 Difference]: Start difference. First operand has 186 places, 187 transitions, 425 flow. Second operand 3 states and 618 transitions. [2024-10-11 17:15:51,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 192 transitions, 491 flow [2024-10-11 17:15:51,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 192 transitions, 488 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:51,575 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 424 flow [2024-10-11 17:15:51,575 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=186, PETRI_TRANSITIONS=186} [2024-10-11 17:15:51,575 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -24 predicate places. [2024-10-11 17:15:51,575 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 424 flow [2024-10-11 17:15:51,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,576 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] [2024-10-11 17:15:51,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:15:51,576 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:51,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2085112529, now seen corresponding path program 1 times [2024-10-11 17:15:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187758679] [2024-10-11 17:15:51,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187758679] [2024-10-11 17:15:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187758679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426004662] [2024-10-11 17:15:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 235 [2024-10-11 17:15:51,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 235 [2024-10-11 17:15:51,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,693 INFO L124 PetriNetUnfolderBase]: 167/771 cut-off events. [2024-10-11 17:15:51,693 INFO L125 PetriNetUnfolderBase]: For 26/33 co-relation queries the response was YES. [2024-10-11 17:15:51,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 771 events. 167/771 cut-off events. For 26/33 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4301 event pairs, 54 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 1052. Up to 178 conditions per place. [2024-10-11 17:15:51,699 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 23 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2024-10-11 17:15:51,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 191 transitions, 486 flow [2024-10-11 17:15:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2024-10-11 17:15:51,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8822695035460993 [2024-10-11 17:15:51,701 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 424 flow. Second operand 3 states and 622 transitions. [2024-10-11 17:15:51,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 191 transitions, 486 flow [2024-10-11 17:15:51,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 191 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:51,703 INFO L231 Difference]: Finished difference. Result has 185 places, 185 transitions, 422 flow [2024-10-11 17:15:51,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=185, PETRI_TRANSITIONS=185} [2024-10-11 17:15:51,704 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -25 predicate places. [2024-10-11 17:15:51,704 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 185 transitions, 422 flow [2024-10-11 17:15:51,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,704 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] [2024-10-11 17:15:51,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:15:51,705 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:51,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1486821401, now seen corresponding path program 1 times [2024-10-11 17:15:51,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038605605] [2024-10-11 17:15:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038605605] [2024-10-11 17:15:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038605605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026671754] [2024-10-11 17:15:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 235 [2024-10-11 17:15:51,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 185 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 235 [2024-10-11 17:15:51,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,850 INFO L124 PetriNetUnfolderBase]: 236/873 cut-off events. [2024-10-11 17:15:51,851 INFO L125 PetriNetUnfolderBase]: For 96/104 co-relation queries the response was YES. [2024-10-11 17:15:51,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 873 events. 236/873 cut-off events. For 96/104 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5144 event pairs, 92 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 1312. Up to 263 conditions per place. [2024-10-11 17:15:51,856 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 25 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2024-10-11 17:15:51,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 190 transitions, 488 flow [2024-10-11 17:15:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2024-10-11 17:15:51,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8765957446808511 [2024-10-11 17:15:51,857 INFO L175 Difference]: Start difference. First operand has 185 places, 185 transitions, 422 flow. Second operand 3 states and 618 transitions. [2024-10-11 17:15:51,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 190 transitions, 488 flow [2024-10-11 17:15:51,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 190 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:51,860 INFO L231 Difference]: Finished difference. Result has 184 places, 184 transitions, 420 flow [2024-10-11 17:15:51,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=184, PETRI_TRANSITIONS=184} [2024-10-11 17:15:51,860 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -26 predicate places. [2024-10-11 17:15:51,860 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 184 transitions, 420 flow [2024-10-11 17:15:51,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,861 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,861 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] [2024-10-11 17:15:51,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:15:51,861 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:51,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -551234207, now seen corresponding path program 1 times [2024-10-11 17:15:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854259798] [2024-10-11 17:15:51,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:51,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854259798] [2024-10-11 17:15:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854259798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732749951] [2024-10-11 17:15:51,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 235 [2024-10-11 17:15:51,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 184 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 235 [2024-10-11 17:15:51,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,983 INFO L124 PetriNetUnfolderBase]: 240/1014 cut-off events. [2024-10-11 17:15:51,983 INFO L125 PetriNetUnfolderBase]: For 71/75 co-relation queries the response was YES. [2024-10-11 17:15:51,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 1014 events. 240/1014 cut-off events. For 71/75 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5774 event pairs, 74 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1097. Up to 237 conditions per place. [2024-10-11 17:15:51,989 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 23 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2024-10-11 17:15:51,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 189 transitions, 482 flow [2024-10-11 17:15:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2024-10-11 17:15:51,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8822695035460993 [2024-10-11 17:15:51,991 INFO L175 Difference]: Start difference. First operand has 184 places, 184 transitions, 420 flow. Second operand 3 states and 622 transitions. [2024-10-11 17:15:51,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 189 transitions, 482 flow [2024-10-11 17:15:51,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 189 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:51,993 INFO L231 Difference]: Finished difference. Result has 183 places, 183 transitions, 418 flow [2024-10-11 17:15:51,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=183, PETRI_TRANSITIONS=183} [2024-10-11 17:15:51,994 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -27 predicate places. [2024-10-11 17:15:51,994 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 183 transitions, 418 flow [2024-10-11 17:15:51,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:15:51,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash -333532642, now seen corresponding path program 1 times [2024-10-11 17:15:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672544579] [2024-10-11 17:15:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672544579] [2024-10-11 17:15:52,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672544579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:52,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:52,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:52,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397061362] [2024-10-11 17:15:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:52,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:52,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:52,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:52,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2024-10-11 17:15:52,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 183 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:52,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2024-10-11 17:15:52,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:52,079 INFO L124 PetriNetUnfolderBase]: 78/500 cut-off events. [2024-10-11 17:15:52,079 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2024-10-11 17:15:52,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 500 events. 78/500 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2306 event pairs, 22 based on Foata normal form. 8/456 useless extension candidates. Maximal degree in co-relation 658. Up to 94 conditions per place. [2024-10-11 17:15:52,082 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 11 selfloop transitions, 0 changer transitions 2/182 dead transitions. [2024-10-11 17:15:52,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 442 flow [2024-10-11 17:15:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2024-10-11 17:15:52,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8836879432624114 [2024-10-11 17:15:52,084 INFO L175 Difference]: Start difference. First operand has 183 places, 183 transitions, 418 flow. Second operand 3 states and 623 transitions. [2024-10-11 17:15:52,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 442 flow [2024-10-11 17:15:52,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 182 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:52,086 INFO L231 Difference]: Finished difference. Result has 182 places, 180 transitions, 407 flow [2024-10-11 17:15:52,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=182, PETRI_TRANSITIONS=180} [2024-10-11 17:15:52,088 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -28 predicate places. [2024-10-11 17:15:52,088 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 407 flow [2024-10-11 17:15:52,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:52,089 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] [2024-10-11 17:15:52,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:15:52,089 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-11 17:15:52,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2110047503, now seen corresponding path program 1 times [2024-10-11 17:15:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129022559] [2024-10-11 17:15:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:52,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:52,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129022559] [2024-10-11 17:15:52,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129022559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:52,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:52,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:52,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080976327] [2024-10-11 17:15:52,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:52,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:52,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:52,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:52,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 235 [2024-10-11 17:15:52,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:52,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 235 [2024-10-11 17:15:52,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:52,210 INFO L124 PetriNetUnfolderBase]: 212/816 cut-off events. [2024-10-11 17:15:52,210 INFO L125 PetriNetUnfolderBase]: For 87/94 co-relation queries the response was YES. [2024-10-11 17:15:52,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 816 events. 212/816 cut-off events. For 87/94 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4695 event pairs, 78 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 1221. Up to 223 conditions per place. [2024-10-11 17:15:52,214 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 0 selfloop transitions, 0 changer transitions 185/185 dead transitions. [2024-10-11 17:15:52,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 185 transitions, 467 flow [2024-10-11 17:15:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2024-10-11 17:15:52,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8808510638297873 [2024-10-11 17:15:52,215 INFO L175 Difference]: Start difference. First operand has 182 places, 180 transitions, 407 flow. Second operand 3 states and 621 transitions. [2024-10-11 17:15:52,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 185 transitions, 467 flow [2024-10-11 17:15:52,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 185 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:52,217 INFO L231 Difference]: Finished difference. Result has 180 places, 0 transitions, 0 flow [2024-10-11 17:15:52,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=180, PETRI_TRANSITIONS=0} [2024-10-11 17:15:52,218 INFO L277 CegarLoopForPetriNet]: 210 programPoint places, -30 predicate places. [2024-10-11 17:15:52,218 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 0 transitions, 0 flow [2024-10-11 17:15:52,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 70 remaining) [2024-10-11 17:15:52,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 70 remaining) [2024-10-11 17:15:52,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (55 of 70 remaining) [2024-10-11 17:15:52,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (54 of 70 remaining) [2024-10-11 17:15:52,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 70 remaining) [2024-10-11 17:15:52,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (52 of 70 remaining) [2024-10-11 17:15:52,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (51 of 70 remaining) [2024-10-11 17:15:52,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (50 of 70 remaining) [2024-10-11 17:15:52,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (49 of 70 remaining) [2024-10-11 17:15:52,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (48 of 70 remaining) [2024-10-11 17:15:52,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (47 of 70 remaining) [2024-10-11 17:15:52,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (46 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (43 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (42 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (41 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (40 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 70 remaining) [2024-10-11 17:15:52,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 70 remaining) [2024-10-11 17:15:52,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (24 of 70 remaining) [2024-10-11 17:15:52,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (23 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (21 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (19 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (18 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (17 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (16 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (15 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (12 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 70 remaining) [2024-10-11 17:15:52,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (10 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (9 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (8 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (7 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (5 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (4 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (2 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (1 of 70 remaining) [2024-10-11 17:15:52,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (0 of 70 remaining) [2024-10-11 17:15:52,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:15:52,230 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:52,235 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:15:52,235 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:15:52,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:15:52 BasicIcfg [2024-10-11 17:15:52,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:15:52,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:15:52,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:15:52,240 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:15:52,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:48" (3/4) ... [2024-10-11 17:15:52,242 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:15:52,244 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:15:52,244 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:15:52,244 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:15:52,248 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 17:15:52,248 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:15:52,248 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:15:52,248 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:15:52,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:15:52,315 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:15:52,315 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:15:52,315 INFO L158 Benchmark]: Toolchain (without parser) took 4678.27ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 95.7MB in the beginning and 222.0MB in the end (delta: -126.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,315 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:15:52,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.93ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 136.4MB in the end (delta: -40.7MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.28ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 136.3MB in the beginning and 216.6MB in the end (delta: -80.3MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,316 INFO L158 Benchmark]: Boogie Preprocessor took 40.31ms. Allocated memory is still 245.4MB. Free memory was 216.6MB in the beginning and 214.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,316 INFO L158 Benchmark]: RCFGBuilder took 502.70ms. Allocated memory is still 245.4MB. Free memory was 214.6MB in the beginning and 186.3MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,316 INFO L158 Benchmark]: TraceAbstraction took 3686.06ms. Allocated memory was 245.4MB in the beginning and 295.7MB in the end (delta: 50.3MB). Free memory was 185.2MB in the beginning and 227.3MB in the end (delta: -42.1MB). Peak memory consumption was 143.5MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,317 INFO L158 Benchmark]: Witness Printer took 74.51ms. Allocated memory is still 295.7MB. Free memory was 227.3MB in the beginning and 222.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,318 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.22ms. Allocated memory is still 167.8MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.93ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 136.4MB in the end (delta: -40.7MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.28ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 136.3MB in the beginning and 216.6MB in the end (delta: -80.3MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.31ms. Allocated memory is still 245.4MB. Free memory was 216.6MB in the beginning and 214.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.70ms. Allocated memory is still 245.4MB. Free memory was 214.6MB in the beginning and 186.3MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3686.06ms. Allocated memory was 245.4MB in the beginning and 295.7MB in the end (delta: 50.3MB). Free memory was 185.2MB in the beginning and 227.3MB in the end (delta: -42.1MB). Peak memory consumption was 143.5MB. Max. memory is 16.1GB. * Witness Printer took 74.51ms. Allocated memory is still 295.7MB. Free memory was 227.3MB in the beginning and 222.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 65]: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: 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 - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: 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 7 procedures, 349 locations, 70 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: 3.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 529 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 880 IncrementalHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 118 mSDtfsCounter, 880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=0, InterpolantAutomatonStates: 57, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1139 NumberOfCodeBlocks, 1139 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 37 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:15:52,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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