./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:46:31,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:46:31,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:46:31,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:46:31,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:46:31,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:46:31,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:46:31,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:46:31,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:46:31,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:46:31,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:46:31,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:46:31,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:46:31,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:46:31,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:46:31,524 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:46:31,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:46:31,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:46:31,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:46:31,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:46:31,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:46:31,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:46:31,527 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:46:31,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:46:31,528 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:46:31,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:46:31,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:46:31,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:46:31,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:46:31,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:46:31,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:46:31,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:46:31,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:46:31,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:46:31,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:46:31,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:46:31,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:46:31,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:46:31,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:46:31,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:46:31,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:46:31,534 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2024-11-16 23:46:31,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:46:31,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:46:31,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:46:31,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:46:31,807 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:46:31,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-11-16 23:46:33,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:46:33,279 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:46:33,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-11-16 23:46:33,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbef65684/e643261b0b00497c8c47624c8cd1cfba/FLAG94221b6b1 [2024-11-16 23:46:33,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbef65684/e643261b0b00497c8c47624c8cd1cfba [2024-11-16 23:46:33,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:46:33,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:46:33,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:46:33,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:46:33,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:46:33,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:33,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e226fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33, skipping insertion in model container [2024-11-16 23:46:33,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:33,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:46:33,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:46:33,925 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:46:33,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:46:33,972 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:46:33,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33 WrapperNode [2024-11-16 23:46:33,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:46:33,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:46:33,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:46:33,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:46:33,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:33,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,010 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-16 23:46:34,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:46:34,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:46:34,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:46:34,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:46:34,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,038 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:46:34,059 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:46:34,059 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:46:34,059 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:46:34,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (1/1) ... [2024-11-16 23:46:34,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:46:34,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:46:34,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:46:34,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:46:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:46:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 23:46:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 23:46:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 23:46:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 23:46:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 23:46:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 23:46:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:46:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:46:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:46:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:46:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:46:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:46:34,175 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:46:34,276 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:46:34,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:46:34,672 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:46:34,672 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:46:34,696 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:46:34,696 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:46:34,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:34 BoogieIcfgContainer [2024-11-16 23:46:34,696 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:46:34,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:46:34,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:46:34,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:46:34,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:46:33" (1/3) ... [2024-11-16 23:46:34,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179cc649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:34, skipping insertion in model container [2024-11-16 23:46:34,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:33" (2/3) ... [2024-11-16 23:46:34,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179cc649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:34, skipping insertion in model container [2024-11-16 23:46:34,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:34" (3/3) ... [2024-11-16 23:46:34,706 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2024-11-16 23:46:34,719 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:46:34,719 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-11-16 23:46:34,720 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:46:34,810 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:46:34,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 333 places, 340 transitions, 701 flow [2024-11-16 23:46:34,973 INFO L124 PetriNetUnfolderBase]: 17/337 cut-off events. [2024-11-16 23:46:34,974 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:46:34,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 337 events. 17/337 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 730 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 252. Up to 2 conditions per place. [2024-11-16 23:46:34,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 333 places, 340 transitions, 701 flow [2024-11-16 23:46:34,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 317 transitions, 652 flow [2024-11-16 23:46:34,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:46:35,005 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;@5ec93403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:46:35,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-16 23:46:35,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:46:35,015 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-16 23:46:35,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:46:35,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:35,016 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] [2024-11-16 23:46:35,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:35,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash 101011961, now seen corresponding path program 1 times [2024-11-16 23:46:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:35,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423225181] [2024-11-16 23:46:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:35,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:35,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:35,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423225181] [2024-11-16 23:46:35,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423225181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:35,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:35,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:35,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813705681] [2024-11-16 23:46:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:35,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:35,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:35,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:35,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 340 [2024-11-16 23:46:35,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 317 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:35,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:35,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 340 [2024-11-16 23:46:35,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:35,405 INFO L124 PetriNetUnfolderBase]: 28/614 cut-off events. [2024-11-16 23:46:35,405 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-16 23:46:35,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 614 events. 28/614 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2733 event pairs, 7 based on Foata normal form. 16/524 useless extension candidates. Maximal degree in co-relation 439. Up to 31 conditions per place. [2024-11-16 23:46:35,416 INFO L140 encePairwiseOnDemand]: 330/340 looper letters, 13 selfloop transitions, 2 changer transitions 3/309 dead transitions. [2024-11-16 23:46:35,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 666 flow [2024-11-16 23:46:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2024-11-16 23:46:35,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2024-11-16 23:46:35,438 INFO L175 Difference]: Start difference. First operand has 312 places, 317 transitions, 652 flow. Second operand 3 states and 965 transitions. [2024-11-16 23:46:35,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 666 flow [2024-11-16 23:46:35,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 309 transitions, 654 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 23:46:35,449 INFO L231 Difference]: Finished difference. Result has 307 places, 306 transitions, 622 flow [2024-11-16 23:46:35,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=307, PETRI_TRANSITIONS=306} [2024-11-16 23:46:35,454 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -5 predicate places. [2024-11-16 23:46:35,456 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 306 transitions, 622 flow [2024-11-16 23:46:35,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:35,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:35,458 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] [2024-11-16 23:46:35,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:46:35,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:35,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1894252251, now seen corresponding path program 1 times [2024-11-16 23:46:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:35,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371047254] [2024-11-16 23:46:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:35,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:35,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371047254] [2024-11-16 23:46:35,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371047254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:35,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:35,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:35,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116975313] [2024-11-16 23:46:35,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:35,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:35,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:35,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:35,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:35,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 340 [2024-11-16 23:46:35,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 306 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:35,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:35,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 340 [2024-11-16 23:46:35,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:35,647 INFO L124 PetriNetUnfolderBase]: 19/456 cut-off events. [2024-11-16 23:46:35,648 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:46:35,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 456 events. 19/456 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1756 event pairs, 5 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 463. Up to 27 conditions per place. [2024-11-16 23:46:35,655 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 13 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-11-16 23:46:35,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 305 transitions, 650 flow [2024-11-16 23:46:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2024-11-16 23:46:35,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392156862745098 [2024-11-16 23:46:35,659 INFO L175 Difference]: Start difference. First operand has 307 places, 306 transitions, 622 flow. Second operand 3 states and 958 transitions. [2024-11-16 23:46:35,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 305 transitions, 650 flow [2024-11-16 23:46:35,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 305 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:35,665 INFO L231 Difference]: Finished difference. Result has 303 places, 305 transitions, 620 flow [2024-11-16 23:46:35,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=303, PETRI_TRANSITIONS=305} [2024-11-16 23:46:35,666 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-11-16 23:46:35,666 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 305 transitions, 620 flow [2024-11-16 23:46:35,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:35,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:35,667 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:35,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:46:35,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:35,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1380299047, now seen corresponding path program 1 times [2024-11-16 23:46:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416684548] [2024-11-16 23:46:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:35,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-11-16 23:46:35,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416684548] [2024-11-16 23:46:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416684548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:35,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:35,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298098946] [2024-11-16 23:46:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:35,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:35,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:35,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:35,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 340 [2024-11-16 23:46:35,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 305 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:35,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:35,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 340 [2024-11-16 23:46:35,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:35,827 INFO L124 PetriNetUnfolderBase]: 34/597 cut-off events. [2024-11-16 23:46:35,827 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-16 23:46:35,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 597 events. 34/597 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2844 event pairs, 12 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 617. Up to 46 conditions per place. [2024-11-16 23:46:35,834 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 14 selfloop transitions, 1 changer transitions 0/301 dead transitions. [2024-11-16 23:46:35,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 301 transitions, 642 flow [2024-11-16 23:46:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2024-11-16 23:46:35,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9362745098039216 [2024-11-16 23:46:35,837 INFO L175 Difference]: Start difference. First operand has 303 places, 305 transitions, 620 flow. Second operand 3 states and 955 transitions. [2024-11-16 23:46:35,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 301 transitions, 642 flow [2024-11-16 23:46:35,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 301 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:35,841 INFO L231 Difference]: Finished difference. Result has 299 places, 301 transitions, 610 flow [2024-11-16 23:46:35,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=299, PETRI_TRANSITIONS=301} [2024-11-16 23:46:35,842 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -13 predicate places. [2024-11-16 23:46:35,842 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 301 transitions, 610 flow [2024-11-16 23:46:35,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:35,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:35,843 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-11-16 23:46:35,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:46:35,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:35,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1072785789, now seen corresponding path program 1 times [2024-11-16 23:46:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:35,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599322526] [2024-11-16 23:46:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:35,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:35,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:35,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599322526] [2024-11-16 23:46:35,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599322526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:35,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:35,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:35,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547761340] [2024-11-16 23:46:35,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:35,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:35,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:35,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:35,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:35,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 340 [2024-11-16 23:46:35,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 301 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:35,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:35,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 340 [2024-11-16 23:46:35,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:36,131 INFO L124 PetriNetUnfolderBase]: 84/908 cut-off events. [2024-11-16 23:46:36,131 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-16 23:46:36,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 908 events. 84/908 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5332 event pairs, 56 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 999. Up to 112 conditions per place. [2024-11-16 23:46:36,142 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 15 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-11-16 23:46:36,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 300 transitions, 642 flow [2024-11-16 23:46:36,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 954 transitions. [2024-11-16 23:46:36,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9352941176470588 [2024-11-16 23:46:36,145 INFO L175 Difference]: Start difference. First operand has 299 places, 301 transitions, 610 flow. Second operand 3 states and 954 transitions. [2024-11-16 23:46:36,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 300 transitions, 642 flow [2024-11-16 23:46:36,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 300 transitions, 641 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:36,149 INFO L231 Difference]: Finished difference. Result has 299 places, 300 transitions, 611 flow [2024-11-16 23:46:36,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=299, PETRI_TRANSITIONS=300} [2024-11-16 23:46:36,151 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -13 predicate places. [2024-11-16 23:46:36,151 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 300 transitions, 611 flow [2024-11-16 23:46:36,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:36,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:36,152 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-11-16 23:46:36,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:46:36,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:36,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash -875899729, now seen corresponding path program 1 times [2024-11-16 23:46:36,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:36,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076719673] [2024-11-16 23:46:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:36,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076719673] [2024-11-16 23:46:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076719673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:36,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861809684] [2024-11-16 23:46:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:36,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:36,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:36,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:36,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 340 [2024-11-16 23:46:36,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 300 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 288.5) internal successors, (1731), 6 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:36,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:36,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 340 [2024-11-16 23:46:36,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:38,216 INFO L124 PetriNetUnfolderBase]: 2073/9422 cut-off events. [2024-11-16 23:46:38,216 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-11-16 23:46:38,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12327 conditions, 9422 events. 2073/9422 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 101321 event pairs, 1520 based on Foata normal form. 0/7730 useless extension candidates. Maximal degree in co-relation 12289. Up to 2804 conditions per place. [2024-11-16 23:46:38,313 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 38 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2024-11-16 23:46:38,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 299 transitions, 695 flow [2024-11-16 23:46:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1766 transitions. [2024-11-16 23:46:38,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.865686274509804 [2024-11-16 23:46:38,320 INFO L175 Difference]: Start difference. First operand has 299 places, 300 transitions, 611 flow. Second operand 6 states and 1766 transitions. [2024-11-16 23:46:38,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 299 transitions, 695 flow [2024-11-16 23:46:38,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 299 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:38,325 INFO L231 Difference]: Finished difference. Result has 301 places, 299 transitions, 615 flow [2024-11-16 23:46:38,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2024-11-16 23:46:38,326 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -11 predicate places. [2024-11-16 23:46:38,326 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 615 flow [2024-11-16 23:46:38,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 288.5) internal successors, (1731), 6 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:38,328 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-11-16 23:46:38,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:46:38,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash 824054738, now seen corresponding path program 1 times [2024-11-16 23:46:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828106820] [2024-11-16 23:46:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:38,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828106820] [2024-11-16 23:46:38,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828106820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:38,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:38,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847055122] [2024-11-16 23:46:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:38,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:38,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:38,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 340 [2024-11-16 23:46:38,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:38,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 340 [2024-11-16 23:46:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:38,472 INFO L124 PetriNetUnfolderBase]: 17/397 cut-off events. [2024-11-16 23:46:38,472 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:46:38,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 397 events. 17/397 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1382 event pairs, 4 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 420. Up to 24 conditions per place. [2024-11-16 23:46:38,477 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 12 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-11-16 23:46:38,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 298 transitions, 641 flow [2024-11-16 23:46:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-11-16 23:46:38,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-16 23:46:38,480 INFO L175 Difference]: Start difference. First operand has 301 places, 299 transitions, 615 flow. Second operand 3 states and 960 transitions. [2024-11-16 23:46:38,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 298 transitions, 641 flow [2024-11-16 23:46:38,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 298 transitions, 631 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:46:38,485 INFO L231 Difference]: Finished difference. Result has 297 places, 298 transitions, 607 flow [2024-11-16 23:46:38,485 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=297, PETRI_TRANSITIONS=298} [2024-11-16 23:46:38,487 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -15 predicate places. [2024-11-16 23:46:38,488 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 298 transitions, 607 flow [2024-11-16 23:46:38,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:38,489 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] [2024-11-16 23:46:38,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:46:38,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:38,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1007794976, now seen corresponding path program 1 times [2024-11-16 23:46:38,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:38,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918725836] [2024-11-16 23:46:38,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:38,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:38,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:38,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918725836] [2024-11-16 23:46:38,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918725836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:38,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:38,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613381014] [2024-11-16 23:46:38,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:38,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:38,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:38,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:38,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:38,548 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 340 [2024-11-16 23:46:38,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 298 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:38,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 340 [2024-11-16 23:46:38,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:38,587 INFO L124 PetriNetUnfolderBase]: 17/398 cut-off events. [2024-11-16 23:46:38,588 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:46:38,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 398 events. 17/398 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1280 event pairs, 4 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 395. Up to 24 conditions per place. [2024-11-16 23:46:38,592 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 12 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-11-16 23:46:38,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 633 flow [2024-11-16 23:46:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-11-16 23:46:38,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-16 23:46:38,594 INFO L175 Difference]: Start difference. First operand has 297 places, 298 transitions, 607 flow. Second operand 3 states and 960 transitions. [2024-11-16 23:46:38,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 633 flow [2024-11-16 23:46:38,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 297 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:38,597 INFO L231 Difference]: Finished difference. Result has 296 places, 297 transitions, 605 flow [2024-11-16 23:46:38,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=296, PETRI_TRANSITIONS=297} [2024-11-16 23:46:38,598 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -16 predicate places. [2024-11-16 23:46:38,598 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 297 transitions, 605 flow [2024-11-16 23:46:38,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:38,599 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] [2024-11-16 23:46:38,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:46:38,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:38,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash 466279151, now seen corresponding path program 1 times [2024-11-16 23:46:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941661283] [2024-11-16 23:46:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941661283] [2024-11-16 23:46:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941661283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648963327] [2024-11-16 23:46:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:38,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:38,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:38,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:38,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:38,643 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 340 [2024-11-16 23:46:38,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 297 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:38,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 340 [2024-11-16 23:46:38,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:38,673 INFO L124 PetriNetUnfolderBase]: 12/304 cut-off events. [2024-11-16 23:46:38,673 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:46:38,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 304 events. 12/304 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 738 event pairs, 4 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 296. Up to 21 conditions per place. [2024-11-16 23:46:38,676 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-11-16 23:46:38,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 631 flow [2024-11-16 23:46:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-11-16 23:46:38,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-16 23:46:38,678 INFO L175 Difference]: Start difference. First operand has 296 places, 297 transitions, 605 flow. Second operand 3 states and 960 transitions. [2024-11-16 23:46:38,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 631 flow [2024-11-16 23:46:38,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:38,682 INFO L231 Difference]: Finished difference. Result has 295 places, 296 transitions, 603 flow [2024-11-16 23:46:38,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=295, PETRI_TRANSITIONS=296} [2024-11-16 23:46:38,685 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -17 predicate places. [2024-11-16 23:46:38,685 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 296 transitions, 603 flow [2024-11-16 23:46:38,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:38,686 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] [2024-11-16 23:46:38,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:46:38,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:38,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash 998319672, now seen corresponding path program 1 times [2024-11-16 23:46:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624177506] [2024-11-16 23:46:38,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:38,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:38,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624177506] [2024-11-16 23:46:38,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624177506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:38,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:38,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:38,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737826902] [2024-11-16 23:46:38,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:38,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:38,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:38,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 340 [2024-11-16 23:46:38,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 296 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:38,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 340 [2024-11-16 23:46:38,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:38,807 INFO L124 PetriNetUnfolderBase]: 49/748 cut-off events. [2024-11-16 23:46:38,807 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-16 23:46:38,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 748 events. 49/748 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4097 event pairs, 20 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 777. Up to 56 conditions per place. [2024-11-16 23:46:38,813 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 14 selfloop transitions, 1 changer transitions 0/292 dead transitions. [2024-11-16 23:46:38,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 292 transitions, 625 flow [2024-11-16 23:46:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2024-11-16 23:46:38,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9362745098039216 [2024-11-16 23:46:38,816 INFO L175 Difference]: Start difference. First operand has 295 places, 296 transitions, 603 flow. Second operand 3 states and 955 transitions. [2024-11-16 23:46:38,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 292 transitions, 625 flow [2024-11-16 23:46:38,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 292 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:38,821 INFO L231 Difference]: Finished difference. Result has 291 places, 292 transitions, 593 flow [2024-11-16 23:46:38,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=291, PETRI_TRANSITIONS=292} [2024-11-16 23:46:38,822 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -21 predicate places. [2024-11-16 23:46:38,823 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 593 flow [2024-11-16 23:46:38,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:38,824 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:38,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:46:38,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:38,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1554843515, now seen corresponding path program 1 times [2024-11-16 23:46:38,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:38,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144365008] [2024-11-16 23:46:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:38,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:38,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144365008] [2024-11-16 23:46:38,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144365008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:38,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:38,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:38,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235527871] [2024-11-16 23:46:38,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:38,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:38,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:38,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:38,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:38,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 340 [2024-11-16 23:46:38,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 292 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:38,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 340 [2024-11-16 23:46:38,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:38,913 INFO L124 PetriNetUnfolderBase]: 19/389 cut-off events. [2024-11-16 23:46:38,913 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:46:38,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 389 events. 19/389 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1352 event pairs, 2 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 392. Up to 14 conditions per place. [2024-11-16 23:46:38,916 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 11 selfloop transitions, 3 changer transitions 0/292 dead transitions. [2024-11-16 23:46:38,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 292 transitions, 623 flow [2024-11-16 23:46:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2024-11-16 23:46:38,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9480392156862745 [2024-11-16 23:46:38,919 INFO L175 Difference]: Start difference. First operand has 291 places, 292 transitions, 593 flow. Second operand 3 states and 967 transitions. [2024-11-16 23:46:38,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 292 transitions, 623 flow [2024-11-16 23:46:38,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 292 transitions, 622 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:38,923 INFO L231 Difference]: Finished difference. Result has 290 places, 290 transitions, 594 flow [2024-11-16 23:46:38,924 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=290, PETRI_TRANSITIONS=290} [2024-11-16 23:46:38,924 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -22 predicate places. [2024-11-16 23:46:38,925 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 290 transitions, 594 flow [2024-11-16 23:46:38,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:38,926 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:38,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:46:38,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:38,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1503606568, now seen corresponding path program 1 times [2024-11-16 23:46:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838464734] [2024-11-16 23:46:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:38,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:38,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838464734] [2024-11-16 23:46:38,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838464734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:38,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:38,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:38,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600307246] [2024-11-16 23:46:38,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:38,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:38,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:38,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:38,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 340 [2024-11-16 23:46:38,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 290 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:38,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:38,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 340 [2024-11-16 23:46:38,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:39,418 INFO L124 PetriNetUnfolderBase]: 472/3524 cut-off events. [2024-11-16 23:46:39,419 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-16 23:46:39,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4174 conditions, 3524 events. 472/3524 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 32515 event pairs, 172 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 4136. Up to 577 conditions per place. [2024-11-16 23:46:39,455 INFO L140 encePairwiseOnDemand]: 331/340 looper letters, 24 selfloop transitions, 3 changer transitions 0/292 dead transitions. [2024-11-16 23:46:39,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 292 transitions, 657 flow [2024-11-16 23:46:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2024-11-16 23:46:39,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9323529411764706 [2024-11-16 23:46:39,458 INFO L175 Difference]: Start difference. First operand has 290 places, 290 transitions, 594 flow. Second operand 3 states and 951 transitions. [2024-11-16 23:46:39,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 292 transitions, 657 flow [2024-11-16 23:46:39,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 292 transitions, 651 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:39,465 INFO L231 Difference]: Finished difference. Result has 285 places, 287 transitions, 597 flow [2024-11-16 23:46:39,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=285, PETRI_TRANSITIONS=287} [2024-11-16 23:46:39,466 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -27 predicate places. [2024-11-16 23:46:39,466 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 287 transitions, 597 flow [2024-11-16 23:46:39,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:39,467 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:39,467 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:39,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:46:39,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:39,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:39,468 INFO L85 PathProgramCache]: Analyzing trace with hash -704000514, now seen corresponding path program 1 times [2024-11-16 23:46:39,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:39,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155641141] [2024-11-16 23:46:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:39,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155641141] [2024-11-16 23:46:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155641141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:39,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730328675] [2024-11-16 23:46:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:39,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:39,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:39,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:39,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 340 [2024-11-16 23:46:39,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 287 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:39,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:39,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 340 [2024-11-16 23:46:39,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:39,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] thread3EXIT-->L91-12: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][267], [365#(= |#race~M~0| 0), Black: 369#true, 373#true, 371#(= |#race~A~0| 0), 344#(= |#race~N~0| 0), 254#L91-12true]) [2024-11-16 23:46:39,634 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2024-11-16 23:46:39,634 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-11-16 23:46:39,634 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-16 23:46:39,634 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-16 23:46:39,635 INFO L124 PetriNetUnfolderBase]: 77/821 cut-off events. [2024-11-16 23:46:39,635 INFO L125 PetriNetUnfolderBase]: For 25/47 co-relation queries the response was YES. [2024-11-16 23:46:39,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 821 events. 77/821 cut-off events. For 25/47 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4145 event pairs, 7 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 925. Up to 47 conditions per place. [2024-11-16 23:46:39,643 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 11 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2024-11-16 23:46:39,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 287 transitions, 627 flow [2024-11-16 23:46:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2024-11-16 23:46:39,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9480392156862745 [2024-11-16 23:46:39,649 INFO L175 Difference]: Start difference. First operand has 285 places, 287 transitions, 597 flow. Second operand 3 states and 967 transitions. [2024-11-16 23:46:39,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 287 transitions, 627 flow [2024-11-16 23:46:39,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 287 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:46:39,652 INFO L231 Difference]: Finished difference. Result has 285 places, 285 transitions, 599 flow [2024-11-16 23:46:39,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=599, PETRI_PLACES=285, PETRI_TRANSITIONS=285} [2024-11-16 23:46:39,653 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -27 predicate places. [2024-11-16 23:46:39,653 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 285 transitions, 599 flow [2024-11-16 23:46:39,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:39,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:39,654 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:39,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:46:39,654 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:39,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1857877036, now seen corresponding path program 1 times [2024-11-16 23:46:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:39,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952447264] [2024-11-16 23:46:39,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:39,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952447264] [2024-11-16 23:46:39,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952447264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:39,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:39,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:39,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462770060] [2024-11-16 23:46:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:39,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:39,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:39,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:39,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 340 [2024-11-16 23:46:39,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 285 transitions, 599 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:39,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:39,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 340 [2024-11-16 23:46:39,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:39,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] thread3EXIT-->L91-12: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][266], [365#(= |#race~M~0| 0), Black: 369#true, 376#true, 373#true, 344#(= |#race~N~0| 0), 371#(= |#race~A~0| 0), 254#L91-12true]) [2024-11-16 23:46:39,772 INFO L294 olderBase$Statistics]: this new event has 246 ancestors and is cut-off event [2024-11-16 23:46:39,772 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-16 23:46:39,773 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-16 23:46:39,773 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-11-16 23:46:39,773 INFO L124 PetriNetUnfolderBase]: 65/762 cut-off events. [2024-11-16 23:46:39,773 INFO L125 PetriNetUnfolderBase]: For 8/46 co-relation queries the response was YES. [2024-11-16 23:46:39,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 762 events. 65/762 cut-off events. For 8/46 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3645 event pairs, 13 based on Foata normal form. 5/695 useless extension candidates. Maximal degree in co-relation 872. Up to 52 conditions per place. [2024-11-16 23:46:39,782 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 13 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2024-11-16 23:46:39,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 286 transitions, 633 flow [2024-11-16 23:46:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2024-11-16 23:46:39,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9480392156862745 [2024-11-16 23:46:39,784 INFO L175 Difference]: Start difference. First operand has 285 places, 285 transitions, 599 flow. Second operand 3 states and 967 transitions. [2024-11-16 23:46:39,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 286 transitions, 633 flow [2024-11-16 23:46:39,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 286 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:39,789 INFO L231 Difference]: Finished difference. Result has 284 places, 284 transitions, 595 flow [2024-11-16 23:46:39,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=284, PETRI_TRANSITIONS=284} [2024-11-16 23:46:39,790 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -28 predicate places. [2024-11-16 23:46:39,790 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 284 transitions, 595 flow [2024-11-16 23:46:39,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:39,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:39,791 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:39,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:46:39,791 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:39,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1156176914, now seen corresponding path program 1 times [2024-11-16 23:46:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:39,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478331697] [2024-11-16 23:46:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:39,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478331697] [2024-11-16 23:46:39,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478331697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:39,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:39,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 23:46:39,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754879114] [2024-11-16 23:46:39,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:39,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 23:46:39,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:39,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 23:46:39,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 23:46:40,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 340 [2024-11-16 23:46:40,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 284 transitions, 595 flow. Second operand has 7 states, 7 states have (on average 311.85714285714283) internal successors, (2183), 7 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:40,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:40,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 340 [2024-11-16 23:46:40,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:40,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] thread3EXIT-->L91-12: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][295], [365#(= |#race~M~0| 0), Black: 369#true, 376#true, 371#(= |#race~A~0| 0), 254#L91-12true, 344#(= |#race~N~0| 0), 379#true]) [2024-11-16 23:46:40,256 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2024-11-16 23:46:40,256 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-11-16 23:46:40,256 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-16 23:46:40,256 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-11-16 23:46:40,256 INFO L124 PetriNetUnfolderBase]: 95/1387 cut-off events. [2024-11-16 23:46:40,256 INFO L125 PetriNetUnfolderBase]: For 11/40 co-relation queries the response was YES. [2024-11-16 23:46:40,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 1387 events. 95/1387 cut-off events. For 11/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8607 event pairs, 18 based on Foata normal form. 4/1261 useless extension candidates. Maximal degree in co-relation 1562. Up to 67 conditions per place. [2024-11-16 23:46:40,274 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 22 selfloop transitions, 14 changer transitions 0/299 dead transitions. [2024-11-16 23:46:40,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 299 transitions, 705 flow [2024-11-16 23:46:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:46:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 23:46:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3137 transitions. [2024-11-16 23:46:40,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9226470588235294 [2024-11-16 23:46:40,281 INFO L175 Difference]: Start difference. First operand has 284 places, 284 transitions, 595 flow. Second operand 10 states and 3137 transitions. [2024-11-16 23:46:40,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 299 transitions, 705 flow [2024-11-16 23:46:40,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 299 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:40,287 INFO L231 Difference]: Finished difference. Result has 295 places, 291 transitions, 657 flow [2024-11-16 23:46:40,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=657, PETRI_PLACES=295, PETRI_TRANSITIONS=291} [2024-11-16 23:46:40,288 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -17 predicate places. [2024-11-16 23:46:40,288 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 291 transitions, 657 flow [2024-11-16 23:46:40,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 311.85714285714283) internal successors, (2183), 7 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:40,290 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:40,290 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:40,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:46:40,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:40,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash 691826085, now seen corresponding path program 1 times [2024-11-16 23:46:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:40,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958189969] [2024-11-16 23:46:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958189969] [2024-11-16 23:46:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958189969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:40,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:40,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033875889] [2024-11-16 23:46:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:40,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:40,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:40,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 340 [2024-11-16 23:46:40,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 291 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:40,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:40,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 340 [2024-11-16 23:46:40,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:40,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] thread3EXIT-->L91-12: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][259], [365#(= |#race~M~0| 0), 400#true, Black: 369#true, 254#L91-12true, 371#(= |#race~A~0| 0), 344#(= |#race~N~0| 0), Black: 391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 379#true, Black: 389#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 385#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 384#(<= ~N~0 0)]) [2024-11-16 23:46:40,544 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2024-11-16 23:46:40,544 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-11-16 23:46:40,544 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-11-16 23:46:40,544 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-16 23:46:40,545 INFO L124 PetriNetUnfolderBase]: 131/1344 cut-off events. [2024-11-16 23:46:40,545 INFO L125 PetriNetUnfolderBase]: For 54/99 co-relation queries the response was YES. [2024-11-16 23:46:40,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1344 events. 131/1344 cut-off events. For 54/99 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8168 event pairs, 27 based on Foata normal form. 4/1223 useless extension candidates. Maximal degree in co-relation 1590. Up to 112 conditions per place. [2024-11-16 23:46:40,554 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 13 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-11-16 23:46:40,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 292 transitions, 691 flow [2024-11-16 23:46:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2024-11-16 23:46:40,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9480392156862745 [2024-11-16 23:46:40,557 INFO L175 Difference]: Start difference. First operand has 295 places, 291 transitions, 657 flow. Second operand 3 states and 967 transitions. [2024-11-16 23:46:40,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 292 transitions, 691 flow [2024-11-16 23:46:40,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 292 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:40,562 INFO L231 Difference]: Finished difference. Result has 295 places, 290 transitions, 655 flow [2024-11-16 23:46:40,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=295, PETRI_TRANSITIONS=290} [2024-11-16 23:46:40,563 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -17 predicate places. [2024-11-16 23:46:40,564 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 290 transitions, 655 flow [2024-11-16 23:46:40,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:40,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:40,565 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:40,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:46:40,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:40,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:40,565 INFO L85 PathProgramCache]: Analyzing trace with hash -780776618, now seen corresponding path program 1 times [2024-11-16 23:46:40,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:40,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658561340] [2024-11-16 23:46:40,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:40,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:40,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658561340] [2024-11-16 23:46:40,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658561340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:40,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:40,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:40,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136045961] [2024-11-16 23:46:40,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:40,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:40,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:40,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:40,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 340 [2024-11-16 23:46:40,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 290 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:40,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:40,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 340 [2024-11-16 23:46:40,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:40,721 INFO L124 PetriNetUnfolderBase]: 119/1103 cut-off events. [2024-11-16 23:46:40,722 INFO L125 PetriNetUnfolderBase]: For 59/90 co-relation queries the response was YES. [2024-11-16 23:46:40,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1103 events. 119/1103 cut-off events. For 59/90 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6245 event pairs, 11 based on Foata normal form. 4/1007 useless extension candidates. Maximal degree in co-relation 1308. Up to 79 conditions per place. [2024-11-16 23:46:40,733 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 9 selfloop transitions, 2 changer transitions 8/290 dead transitions. [2024-11-16 23:46:40,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 290 transitions, 683 flow [2024-11-16 23:46:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2024-11-16 23:46:40,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470588235294117 [2024-11-16 23:46:40,735 INFO L175 Difference]: Start difference. First operand has 295 places, 290 transitions, 655 flow. Second operand 3 states and 966 transitions. [2024-11-16 23:46:40,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 290 transitions, 683 flow [2024-11-16 23:46:40,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 290 transitions, 679 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:40,740 INFO L231 Difference]: Finished difference. Result has 293 places, 280 transitions, 634 flow [2024-11-16 23:46:40,741 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=293, PETRI_TRANSITIONS=280} [2024-11-16 23:46:40,741 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -19 predicate places. [2024-11-16 23:46:40,741 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 280 transitions, 634 flow [2024-11-16 23:46:40,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:40,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:40,743 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:40,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:46:40,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:40,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -839797401, now seen corresponding path program 1 times [2024-11-16 23:46:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264851586] [2024-11-16 23:46:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:40,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:40,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264851586] [2024-11-16 23:46:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264851586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:40,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:40,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648821597] [2024-11-16 23:46:40,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:40,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:46:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:46:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:46:40,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 340 [2024-11-16 23:46:40,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 280 transitions, 634 flow. Second operand has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:40,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:40,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 340 [2024-11-16 23:46:40,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:41,079 INFO L124 PetriNetUnfolderBase]: 143/1838 cut-off events. [2024-11-16 23:46:41,080 INFO L125 PetriNetUnfolderBase]: For 57/74 co-relation queries the response was YES. [2024-11-16 23:46:41,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1838 events. 143/1838 cut-off events. For 57/74 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 12862 event pairs, 34 based on Foata normal form. 8/1695 useless extension candidates. Maximal degree in co-relation 2157. Up to 114 conditions per place. [2024-11-16 23:46:41,104 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 22 selfloop transitions, 5 changer transitions 0/290 dead transitions. [2024-11-16 23:46:41,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 290 transitions, 715 flow [2024-11-16 23:46:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:46:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 23:46:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1588 transitions. [2024-11-16 23:46:41,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9341176470588235 [2024-11-16 23:46:41,107 INFO L175 Difference]: Start difference. First operand has 293 places, 280 transitions, 634 flow. Second operand 5 states and 1588 transitions. [2024-11-16 23:46:41,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 290 transitions, 715 flow [2024-11-16 23:46:41,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 290 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:41,111 INFO L231 Difference]: Finished difference. Result has 289 places, 282 transitions, 655 flow [2024-11-16 23:46:41,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=289, PETRI_TRANSITIONS=282} [2024-11-16 23:46:41,112 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -23 predicate places. [2024-11-16 23:46:41,112 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 282 transitions, 655 flow [2024-11-16 23:46:41,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:41,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:41,113 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:41,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:46:41,113 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:41,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash -617601827, now seen corresponding path program 1 times [2024-11-16 23:46:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:41,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50369048] [2024-11-16 23:46:41,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:41,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:41,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:41,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50369048] [2024-11-16 23:46:41,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50369048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:41,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:41,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:41,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342173870] [2024-11-16 23:46:41,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:41,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:41,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:41,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:41,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 340 [2024-11-16 23:46:41,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 282 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:41,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:41,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 340 [2024-11-16 23:46:41,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:41,341 INFO L124 PetriNetUnfolderBase]: 233/1748 cut-off events. [2024-11-16 23:46:41,342 INFO L125 PetriNetUnfolderBase]: For 148/219 co-relation queries the response was YES. [2024-11-16 23:46:41,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 1748 events. 233/1748 cut-off events. For 148/219 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12101 event pairs, 56 based on Foata normal form. 0/1604 useless extension candidates. Maximal degree in co-relation 2198. Up to 235 conditions per place. [2024-11-16 23:46:41,357 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 11 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-11-16 23:46:41,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 283 transitions, 685 flow [2024-11-16 23:46:41,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2024-11-16 23:46:41,359 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2024-11-16 23:46:41,359 INFO L175 Difference]: Start difference. First operand has 289 places, 282 transitions, 655 flow. Second operand 3 states and 965 transitions. [2024-11-16 23:46:41,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 283 transitions, 685 flow [2024-11-16 23:46:41,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 283 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:41,363 INFO L231 Difference]: Finished difference. Result has 288 places, 281 transitions, 652 flow [2024-11-16 23:46:41,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=288, PETRI_TRANSITIONS=281} [2024-11-16 23:46:41,363 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -24 predicate places. [2024-11-16 23:46:41,364 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 281 transitions, 652 flow [2024-11-16 23:46:41,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:41,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:41,364 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:41,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:46:41,364 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:41,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash 466493485, now seen corresponding path program 1 times [2024-11-16 23:46:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:41,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138148605] [2024-11-16 23:46:41,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:41,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:41,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:41,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138148605] [2024-11-16 23:46:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138148605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:41,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:41,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504981018] [2024-11-16 23:46:41,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:41,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:41,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 340 [2024-11-16 23:46:41,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 281 transitions, 652 flow. Second operand has 6 states, 6 states have (on average 311.6666666666667) internal successors, (1870), 6 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:41,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:41,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 340 [2024-11-16 23:46:41,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:42,173 INFO L124 PetriNetUnfolderBase]: 151/1755 cut-off events. [2024-11-16 23:46:42,173 INFO L125 PetriNetUnfolderBase]: For 142/151 co-relation queries the response was YES. [2024-11-16 23:46:42,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 1755 events. 151/1755 cut-off events. For 142/151 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11833 event pairs, 37 based on Foata normal form. 0/1638 useless extension candidates. Maximal degree in co-relation 2172. Up to 142 conditions per place. [2024-11-16 23:46:42,190 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 25 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2024-11-16 23:46:42,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 289 transitions, 736 flow [2024-11-16 23:46:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1889 transitions. [2024-11-16 23:46:42,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9259803921568628 [2024-11-16 23:46:42,196 INFO L175 Difference]: Start difference. First operand has 288 places, 281 transitions, 652 flow. Second operand 6 states and 1889 transitions. [2024-11-16 23:46:42,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 289 transitions, 736 flow [2024-11-16 23:46:42,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:42,203 INFO L231 Difference]: Finished difference. Result has 291 places, 281 transitions, 662 flow [2024-11-16 23:46:42,204 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=662, PETRI_PLACES=291, PETRI_TRANSITIONS=281} [2024-11-16 23:46:42,205 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -21 predicate places. [2024-11-16 23:46:42,205 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 281 transitions, 662 flow [2024-11-16 23:46:42,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.6666666666667) internal successors, (1870), 6 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:42,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:42,206 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:42,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 23:46:42,206 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:42,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1684010463, now seen corresponding path program 1 times [2024-11-16 23:46:42,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:42,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612997803] [2024-11-16 23:46:42,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:42,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:42,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612997803] [2024-11-16 23:46:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612997803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:42,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:42,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189441111] [2024-11-16 23:46:42,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:42,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:42,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:42,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 340 [2024-11-16 23:46:42,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 281 transitions, 662 flow. Second operand has 6 states, 6 states have (on average 311.8333333333333) internal successors, (1871), 6 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:42,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:42,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 340 [2024-11-16 23:46:42,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:43,155 INFO L124 PetriNetUnfolderBase]: 232/1740 cut-off events. [2024-11-16 23:46:43,155 INFO L125 PetriNetUnfolderBase]: For 148/269 co-relation queries the response was YES. [2024-11-16 23:46:43,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 1740 events. 232/1740 cut-off events. For 148/269 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12211 event pairs, 52 based on Foata normal form. 4/1630 useless extension candidates. Maximal degree in co-relation 2229. Up to 219 conditions per place. [2024-11-16 23:46:43,174 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 23 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2024-11-16 23:46:43,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 289 transitions, 742 flow [2024-11-16 23:46:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1889 transitions. [2024-11-16 23:46:43,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9259803921568628 [2024-11-16 23:46:43,177 INFO L175 Difference]: Start difference. First operand has 291 places, 281 transitions, 662 flow. Second operand 6 states and 1889 transitions. [2024-11-16 23:46:43,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 289 transitions, 742 flow [2024-11-16 23:46:43,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 289 transitions, 734 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 23:46:43,182 INFO L231 Difference]: Finished difference. Result has 292 places, 281 transitions, 668 flow [2024-11-16 23:46:43,182 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=292, PETRI_TRANSITIONS=281} [2024-11-16 23:46:43,183 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -20 predicate places. [2024-11-16 23:46:43,183 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 281 transitions, 668 flow [2024-11-16 23:46:43,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.8333333333333) internal successors, (1871), 6 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:43,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:43,184 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:43,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 23:46:43,184 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:43,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -679702900, now seen corresponding path program 1 times [2024-11-16 23:46:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:43,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527712379] [2024-11-16 23:46:43,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527712379] [2024-11-16 23:46:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527712379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:46:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107128434] [2024-11-16 23:46:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:43,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:46:43,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:46:43,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:46:43,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 23:46:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:43,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 23:46:43,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:46:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:43,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:46:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:43,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107128434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:46:43,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:46:43,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-16 23:46:43,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188220332] [2024-11-16 23:46:43,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:46:43,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 23:46:43,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 23:46:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-11-16 23:46:44,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 340 [2024-11-16 23:46:44,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 281 transitions, 668 flow. Second operand has 19 states, 19 states have (on average 307.89473684210526) internal successors, (5850), 19 states have internal predecessors, (5850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:44,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:44,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 340 [2024-11-16 23:46:44,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:44,844 INFO L124 PetriNetUnfolderBase]: 162/2283 cut-off events. [2024-11-16 23:46:44,844 INFO L125 PetriNetUnfolderBase]: For 95/123 co-relation queries the response was YES. [2024-11-16 23:46:44,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2937 conditions, 2283 events. 162/2283 cut-off events. For 95/123 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16532 event pairs, 35 based on Foata normal form. 9/2171 useless extension candidates. Maximal degree in co-relation 2886. Up to 105 conditions per place. [2024-11-16 23:46:44,870 INFO L140 encePairwiseOnDemand]: 323/340 looper letters, 26 selfloop transitions, 27 changer transitions 0/303 dead transitions. [2024-11-16 23:46:44,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 303 transitions, 840 flow [2024-11-16 23:46:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 23:46:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-16 23:46:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4946 transitions. [2024-11-16 23:46:44,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9091911764705882 [2024-11-16 23:46:44,877 INFO L175 Difference]: Start difference. First operand has 292 places, 281 transitions, 668 flow. Second operand 16 states and 4946 transitions. [2024-11-16 23:46:44,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 303 transitions, 840 flow [2024-11-16 23:46:44,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 303 transitions, 832 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 23:46:44,882 INFO L231 Difference]: Finished difference. Result has 311 places, 292 transitions, 799 flow [2024-11-16 23:46:44,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=799, PETRI_PLACES=311, PETRI_TRANSITIONS=292} [2024-11-16 23:46:44,883 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -1 predicate places. [2024-11-16 23:46:44,883 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 292 transitions, 799 flow [2024-11-16 23:46:44,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 307.89473684210526) internal successors, (5850), 19 states have internal predecessors, (5850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:44,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:44,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:44,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 23:46:45,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-16 23:46:45,090 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:45,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash -748884653, now seen corresponding path program 1 times [2024-11-16 23:46:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:45,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627953853] [2024-11-16 23:46:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:45,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627953853] [2024-11-16 23:46:45,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627953853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:45,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:45,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446724455] [2024-11-16 23:46:45,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:45,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:45,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:45,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 340 [2024-11-16 23:46:45,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 292 transitions, 799 flow. Second operand has 6 states, 6 states have (on average 311.6666666666667) internal successors, (1870), 6 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:45,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:45,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 340 [2024-11-16 23:46:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:46,041 INFO L124 PetriNetUnfolderBase]: 198/2474 cut-off events. [2024-11-16 23:46:46,041 INFO L125 PetriNetUnfolderBase]: For 290/299 co-relation queries the response was YES. [2024-11-16 23:46:46,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3259 conditions, 2474 events. 198/2474 cut-off events. For 290/299 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 18751 event pairs, 51 based on Foata normal form. 0/2344 useless extension candidates. Maximal degree in co-relation 3198. Up to 196 conditions per place. [2024-11-16 23:46:46,070 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 25 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2024-11-16 23:46:46,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 299 transitions, 881 flow [2024-11-16 23:46:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1889 transitions. [2024-11-16 23:46:46,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9259803921568628 [2024-11-16 23:46:46,075 INFO L175 Difference]: Start difference. First operand has 311 places, 292 transitions, 799 flow. Second operand 6 states and 1889 transitions. [2024-11-16 23:46:46,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 299 transitions, 881 flow [2024-11-16 23:46:46,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 299 transitions, 864 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:46,081 INFO L231 Difference]: Finished difference. Result has 313 places, 291 transitions, 790 flow [2024-11-16 23:46:46,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=790, PETRI_PLACES=313, PETRI_TRANSITIONS=291} [2024-11-16 23:46:46,081 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, 1 predicate places. [2024-11-16 23:46:46,082 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 291 transitions, 790 flow [2024-11-16 23:46:46,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.6666666666667) internal successors, (1870), 6 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:46,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:46,087 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:46,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 23:46:46,087 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:46,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash -711189627, now seen corresponding path program 1 times [2024-11-16 23:46:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811323224] [2024-11-16 23:46:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:46,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:46,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811323224] [2024-11-16 23:46:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811323224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:46,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:46,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:46,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829169129] [2024-11-16 23:46:46,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:46,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:46,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:46,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:46,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:46,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 340 [2024-11-16 23:46:46,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 291 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 311.8333333333333) internal successors, (1871), 6 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:46,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:46,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 340 [2024-11-16 23:46:46,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:46,953 INFO L124 PetriNetUnfolderBase]: 310/2230 cut-off events. [2024-11-16 23:46:46,953 INFO L125 PetriNetUnfolderBase]: For 337/506 co-relation queries the response was YES. [2024-11-16 23:46:46,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 2230 events. 310/2230 cut-off events. For 337/506 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 16463 event pairs, 75 based on Foata normal form. 20/2126 useless extension candidates. Maximal degree in co-relation 3084. Up to 307 conditions per place. [2024-11-16 23:46:46,981 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 23 selfloop transitions, 5 changer transitions 13/298 dead transitions. [2024-11-16 23:46:46,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 298 transitions, 868 flow [2024-11-16 23:46:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1889 transitions. [2024-11-16 23:46:46,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9259803921568628 [2024-11-16 23:46:46,987 INFO L175 Difference]: Start difference. First operand has 313 places, 291 transitions, 790 flow. Second operand 6 states and 1889 transitions. [2024-11-16 23:46:46,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 298 transitions, 868 flow [2024-11-16 23:46:46,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 298 transitions, 856 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-16 23:46:46,995 INFO L231 Difference]: Finished difference. Result has 312 places, 277 transitions, 696 flow [2024-11-16 23:46:46,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=696, PETRI_PLACES=312, PETRI_TRANSITIONS=277} [2024-11-16 23:46:46,996 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, 0 predicate places. [2024-11-16 23:46:46,996 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 277 transitions, 696 flow [2024-11-16 23:46:46,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.8333333333333) internal successors, (1871), 6 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:46,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:46,997 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:46,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 23:46:46,997 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:46,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2035942102, now seen corresponding path program 2 times [2024-11-16 23:46:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344139686] [2024-11-16 23:46:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 23:46:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344139686] [2024-11-16 23:46:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344139686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:47,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275209229] [2024-11-16 23:46:47,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:47,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:47,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 340 [2024-11-16 23:46:47,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 277 transitions, 696 flow. Second operand has 6 states, 6 states have (on average 312.1666666666667) internal successors, (1873), 6 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:47,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:47,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 340 [2024-11-16 23:46:47,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:47,772 INFO L124 PetriNetUnfolderBase]: 96/1258 cut-off events. [2024-11-16 23:46:47,773 INFO L125 PetriNetUnfolderBase]: For 40/64 co-relation queries the response was YES. [2024-11-16 23:46:47,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 1258 events. 96/1258 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7454 event pairs, 21 based on Foata normal form. 8/1217 useless extension candidates. Maximal degree in co-relation 1659. Up to 88 conditions per place. [2024-11-16 23:46:47,789 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 23 selfloop transitions, 5 changer transitions 0/285 dead transitions. [2024-11-16 23:46:47,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 285 transitions, 776 flow [2024-11-16 23:46:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1889 transitions. [2024-11-16 23:46:47,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9259803921568628 [2024-11-16 23:46:47,792 INFO L175 Difference]: Start difference. First operand has 312 places, 277 transitions, 696 flow. Second operand 6 states and 1889 transitions. [2024-11-16 23:46:47,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 285 transitions, 776 flow [2024-11-16 23:46:47,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 285 transitions, 724 flow, removed 4 selfloop flow, removed 18 redundant places. [2024-11-16 23:46:47,796 INFO L231 Difference]: Finished difference. Result has 291 places, 277 transitions, 658 flow [2024-11-16 23:46:47,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=291, PETRI_TRANSITIONS=277} [2024-11-16 23:46:47,797 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -21 predicate places. [2024-11-16 23:46:47,797 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 277 transitions, 658 flow [2024-11-16 23:46:47,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 312.1666666666667) internal successors, (1873), 6 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:47,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:47,798 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:47,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 23:46:47,798 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-11-16 23:46:47,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash -685915056, now seen corresponding path program 1 times [2024-11-16 23:46:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:47,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409726487] [2024-11-16 23:46:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:47,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 23:46:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409726487] [2024-11-16 23:46:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409726487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:48,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:48,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:48,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056895854] [2024-11-16 23:46:48,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:48,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:48,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:48,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:48,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 340 [2024-11-16 23:46:48,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 277 transitions, 658 flow. Second operand has 6 states, 6 states have (on average 312.1666666666667) internal successors, (1873), 6 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:48,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:48,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 340 [2024-11-16 23:46:48,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:48,571 INFO L124 PetriNetUnfolderBase]: 96/1252 cut-off events. [2024-11-16 23:46:48,571 INFO L125 PetriNetUnfolderBase]: For 33/57 co-relation queries the response was YES. [2024-11-16 23:46:48,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1621 conditions, 1252 events. 96/1252 cut-off events. For 33/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7361 event pairs, 21 based on Foata normal form. 8/1205 useless extension candidates. Maximal degree in co-relation 1606. Up to 88 conditions per place. [2024-11-16 23:46:48,584 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 0 selfloop transitions, 0 changer transitions 284/284 dead transitions. [2024-11-16 23:46:48,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 284 transitions, 736 flow [2024-11-16 23:46:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1889 transitions. [2024-11-16 23:46:48,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9259803921568628 [2024-11-16 23:46:48,586 INFO L175 Difference]: Start difference. First operand has 291 places, 277 transitions, 658 flow. Second operand 6 states and 1889 transitions. [2024-11-16 23:46:48,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 284 transitions, 736 flow [2024-11-16 23:46:48,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 284 transitions, 728 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 23:46:48,590 INFO L231 Difference]: Finished difference. Result has 291 places, 0 transitions, 0 flow [2024-11-16 23:46:48,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=291, PETRI_TRANSITIONS=0} [2024-11-16 23:46:48,591 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -21 predicate places. [2024-11-16 23:46:48,591 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 0 transitions, 0 flow [2024-11-16 23:46:48,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 312.1666666666667) internal successors, (1873), 6 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:48,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (60 of 61 remaining) [2024-11-16 23:46:48,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2024-11-16 23:46:48,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2024-11-16 23:46:48,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2024-11-16 23:46:48,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2024-11-16 23:46:48,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2024-11-16 23:46:48,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2024-11-16 23:46:48,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2024-11-16 23:46:48,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2024-11-16 23:46:48,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2024-11-16 23:46:48,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2024-11-16 23:46:48,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2024-11-16 23:46:48,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2024-11-16 23:46:48,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2024-11-16 23:46:48,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2024-11-16 23:46:48,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2024-11-16 23:46:48,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2024-11-16 23:46:48,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2024-11-16 23:46:48,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2024-11-16 23:46:48,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2024-11-16 23:46:48,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2024-11-16 23:46:48,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2024-11-16 23:46:48,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2024-11-16 23:46:48,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2024-11-16 23:46:48,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2024-11-16 23:46:48,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2024-11-16 23:46:48,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2024-11-16 23:46:48,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2024-11-16 23:46:48,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2024-11-16 23:46:48,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2024-11-16 23:46:48,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2024-11-16 23:46:48,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2024-11-16 23:46:48,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2024-11-16 23:46:48,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2024-11-16 23:46:48,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2024-11-16 23:46:48,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2024-11-16 23:46:48,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2024-11-16 23:46:48,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2024-11-16 23:46:48,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2024-11-16 23:46:48,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2024-11-16 23:46:48,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 23:46:48,604 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:48,611 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 23:46:48,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:46:48,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:46:48 BasicIcfg [2024-11-16 23:46:48,617 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:46:48,618 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:46:48,618 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:46:48,618 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:46:48,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:34" (3/4) ... [2024-11-16 23:46:48,620 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 23:46:48,623 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-16 23:46:48,623 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-16 23:46:48,623 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-16 23:46:48,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-16 23:46:48,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 23:46:48,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 23:46:48,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 23:46:48,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:46:48,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 23:46:48,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:46:48,723 INFO L158 Benchmark]: Toolchain (without parser) took 15025.43ms. Allocated memory was 174.1MB in the beginning and 859.8MB in the end (delta: 685.8MB). Free memory was 105.0MB in the beginning and 546.6MB in the end (delta: -441.6MB). Peak memory consumption was 245.4MB. Max. memory is 16.1GB. [2024-11-16 23:46:48,723 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 77.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:46:48,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.72ms. Allocated memory is still 174.1MB. Free memory was 104.8MB in the beginning and 90.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 23:46:48,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.62ms. Allocated memory is still 174.1MB. Free memory was 90.3MB in the beginning and 88.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:46:48,723 INFO L158 Benchmark]: Boogie Preprocessor took 47.00ms. Allocated memory is still 174.1MB. Free memory was 88.2MB in the beginning and 144.7MB in the end (delta: -56.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-16 23:46:48,724 INFO L158 Benchmark]: IcfgBuilder took 637.85ms. Allocated memory is still 174.1MB. Free memory was 144.7MB in the beginning and 115.4MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 23:46:48,724 INFO L158 Benchmark]: TraceAbstraction took 13918.51ms. Allocated memory was 174.1MB in the beginning and 859.8MB in the end (delta: 685.8MB). Free memory was 114.7MB in the beginning and 552.9MB in the end (delta: -438.2MB). Peak memory consumption was 250.0MB. Max. memory is 16.1GB. [2024-11-16 23:46:48,724 INFO L158 Benchmark]: Witness Printer took 104.66ms. Allocated memory is still 859.8MB. Free memory was 552.9MB in the beginning and 546.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 23:46:48,725 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.20ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 77.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.72ms. Allocated memory is still 174.1MB. Free memory was 104.8MB in the beginning and 90.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.62ms. Allocated memory is still 174.1MB. Free memory was 90.3MB in the beginning and 88.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.00ms. Allocated memory is still 174.1MB. Free memory was 88.2MB in the beginning and 144.7MB in the end (delta: -56.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * IcfgBuilder took 637.85ms. Allocated memory is still 174.1MB. Free memory was 144.7MB in the beginning and 115.4MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13918.51ms. Allocated memory was 174.1MB in the beginning and 859.8MB in the end (delta: 685.8MB). Free memory was 114.7MB in the beginning and 552.9MB in the end (delta: -438.2MB). Peak memory consumption was 250.0MB. Max. memory is 16.1GB. * Witness Printer took 104.66ms. Allocated memory is still 859.8MB. Free memory was 552.9MB in the beginning and 546.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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, 474 locations, 61 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: 13.8s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2588 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1580 mSDsluCounter, 1609 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1381 mSDsCounter, 595 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4342 IncrementalHoareTripleChecker+Invalid, 4937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 595 mSolverCounterUnsat, 228 mSDtfsCounter, 4342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=799occurred in iteration=21, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2660 NumberOfCodeBlocks, 2660 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2764 ConstructedInterpolants, 0 QuantifiedInterpolants, 4719 SizeOfPredicates, 7 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 40/46 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 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-16 23:46:48,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE