./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:17:06,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:17:06,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:17:06,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:17:06,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:17:06,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:17:06,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:17:06,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:17:06,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:17:06,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:17:06,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:17:06,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:17:06,438 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:17:06,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:17:06,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:17:06,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:17:06,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:17:06,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:17:06,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:17:06,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:17:06,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:17:06,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:17:06,446 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:17:06,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:17:06,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:17:06,446 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:17:06,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:17:06,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:17:06,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:17:06,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:17:06,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:17:06,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:06,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:17:06,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:17:06,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:17:06,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:17:06,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:17:06,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:17:06,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:17:06,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:17:06,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:17:06,452 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2024-10-11 17:17:06,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:17:06,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:17:06,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:17:06,747 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:17:06,748 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:17:06,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-11 17:17:08,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:17:08,456 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:17:08,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-11 17:17:08,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b92d0616/877b3c19e03943179a332bbfb7f6bf7f/FLAGa12d13b47 [2024-10-11 17:17:08,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b92d0616/877b3c19e03943179a332bbfb7f6bf7f [2024-10-11 17:17:08,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:17:08,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:17:08,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:08,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:17:08,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:17:08,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694e06ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08, skipping insertion in model container [2024-10-11 17:17:08,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:17:08,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:08,755 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:17:08,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:08,803 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:17:08,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08 WrapperNode [2024-10-11 17:17:08,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:08,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:08,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:17:08,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:17:08,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,863 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-10-11 17:17:08,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:08,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:17:08,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:17:08,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:17:08,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:17:08,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:17:08,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:17:08,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:17:08,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (1/1) ... [2024-10-11 17:17:08,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:08,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:17:08,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:17:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:17:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:17:09,045 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:17:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:17:09,045 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:17:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:17:09,045 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:17:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:17:09,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:17:09,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:17:09,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:17:09,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:17:09,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:17:09,048 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:17:09,198 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:17:09,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:17:09,801 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:17:09,802 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:17:09,835 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:17:09,836 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:17:09,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:09 BoogieIcfgContainer [2024-10-11 17:17:09,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:17:09,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:17:09,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:17:09,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:17:09,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:17:08" (1/3) ... [2024-10-11 17:17:09,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374cd719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:09, skipping insertion in model container [2024-10-11 17:17:09,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:08" (2/3) ... [2024-10-11 17:17:09,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374cd719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:09, skipping insertion in model container [2024-10-11 17:17:09,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:09" (3/3) ... [2024-10-11 17:17:09,850 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2024-10-11 17:17:09,872 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:17:09,872 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-10-11 17:17:09,872 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:17:10,003 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:17:10,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 339 transitions, 699 flow [2024-10-11 17:17:10,186 INFO L124 PetriNetUnfolderBase]: 17/336 cut-off events. [2024-10-11 17:17:10,189 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:17:10,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 336 events. 17/336 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 702 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 251. Up to 2 conditions per place. [2024-10-11 17:17:10,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 339 transitions, 699 flow [2024-10-11 17:17:10,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 316 transitions, 650 flow [2024-10-11 17:17:10,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:17:10,228 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;@417134cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:17:10,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-10-11 17:17:10,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:17:10,234 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-11 17:17:10,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:17:10,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:10,235 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-10-11 17:17:10,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:10,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash -808695391, now seen corresponding path program 1 times [2024-10-11 17:17:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665252915] [2024-10-11 17:17:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:10,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:10,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665252915] [2024-10-11 17:17:10,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665252915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:10,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:10,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354342582] [2024-10-11 17:17:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:10,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:10,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:10,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:10,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:10,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 339 [2024-10-11 17:17:10,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 316 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:10,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:10,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 339 [2024-10-11 17:17:10,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:10,738 INFO L124 PetriNetUnfolderBase]: 28/613 cut-off events. [2024-10-11 17:17:10,739 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-10-11 17:17:10,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 613 events. 28/613 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2696 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-10-11 17:17:10,749 INFO L140 encePairwiseOnDemand]: 329/339 looper letters, 13 selfloop transitions, 2 changer transitions 3/308 dead transitions. [2024-10-11 17:17:10,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 664 flow [2024-10-11 17:17:10,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2024-10-11 17:17:10,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9459193706981318 [2024-10-11 17:17:10,774 INFO L175 Difference]: Start difference. First operand has 311 places, 316 transitions, 650 flow. Second operand 3 states and 962 transitions. [2024-10-11 17:17:10,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 664 flow [2024-10-11 17:17:10,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 308 transitions, 652 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:17:10,791 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 620 flow [2024-10-11 17:17:10,794 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2024-10-11 17:17:10,800 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -5 predicate places. [2024-10-11 17:17:10,800 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 620 flow [2024-10-11 17:17:10,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:10,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:10,802 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-10-11 17:17:10,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:17:10,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:10,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1436395452, now seen corresponding path program 1 times [2024-10-11 17:17:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:10,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957864776] [2024-10-11 17:17:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957864776] [2024-10-11 17:17:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957864776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:10,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:10,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:10,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388924231] [2024-10-11 17:17:10,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:10,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:10,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:10,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 339 [2024-10-11 17:17:10,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:10,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:10,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 339 [2024-10-11 17:17:10,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:11,031 INFO L124 PetriNetUnfolderBase]: 19/455 cut-off events. [2024-10-11 17:17:11,033 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:17:11,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 455 events. 19/455 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1753 event pairs, 5 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 462. Up to 27 conditions per place. [2024-10-11 17:17:11,043 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 13 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2024-10-11 17:17:11,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 304 transitions, 648 flow [2024-10-11 17:17:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2024-10-11 17:17:11,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9390363815142576 [2024-10-11 17:17:11,048 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 620 flow. Second operand 3 states and 955 transitions. [2024-10-11 17:17:11,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 304 transitions, 648 flow [2024-10-11 17:17:11,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 304 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:11,059 INFO L231 Difference]: Finished difference. Result has 302 places, 304 transitions, 618 flow [2024-10-11 17:17:11,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=302, PETRI_TRANSITIONS=304} [2024-10-11 17:17:11,061 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -9 predicate places. [2024-10-11 17:17:11,061 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 304 transitions, 618 flow [2024-10-11 17:17:11,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:11,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:11,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:11,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:17:11,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:11,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2079329439, now seen corresponding path program 1 times [2024-10-11 17:17:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422478342] [2024-10-11 17:17:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:11,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:11,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422478342] [2024-10-11 17:17:11,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422478342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:11,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:11,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:11,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697401783] [2024-10-11 17:17:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:11,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:11,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:11,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:11,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 339 [2024-10-11 17:17:11,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 304 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:11,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:11,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 339 [2024-10-11 17:17:11,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:11,346 INFO L124 PetriNetUnfolderBase]: 34/596 cut-off events. [2024-10-11 17:17:11,347 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:17:11,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 596 events. 34/596 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/502 useless extension candidates. Maximal degree in co-relation 616. Up to 46 conditions per place. [2024-10-11 17:17:11,352 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 14 selfloop transitions, 1 changer transitions 0/300 dead transitions. [2024-10-11 17:17:11,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 300 transitions, 640 flow [2024-10-11 17:17:11,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2024-10-11 17:17:11,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9360865290068829 [2024-10-11 17:17:11,355 INFO L175 Difference]: Start difference. First operand has 302 places, 304 transitions, 618 flow. Second operand 3 states and 952 transitions. [2024-10-11 17:17:11,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 300 transitions, 640 flow [2024-10-11 17:17:11,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 300 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:11,361 INFO L231 Difference]: Finished difference. Result has 298 places, 300 transitions, 608 flow [2024-10-11 17:17:11,362 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=298, PETRI_TRANSITIONS=300} [2024-10-11 17:17:11,363 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -13 predicate places. [2024-10-11 17:17:11,364 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 300 transitions, 608 flow [2024-10-11 17:17:11,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:11,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:11,365 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] [2024-10-11 17:17:11,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:17:11,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:11,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:11,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1966449611, now seen corresponding path program 1 times [2024-10-11 17:17:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:11,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720780952] [2024-10-11 17:17:11,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:11,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720780952] [2024-10-11 17:17:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720780952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:11,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:11,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:11,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769498386] [2024-10-11 17:17:11,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:11,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:12,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 339 [2024-10-11 17:17:12,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 300 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:12,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:12,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 339 [2024-10-11 17:17:12,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:13,938 INFO L124 PetriNetUnfolderBase]: 2053/8822 cut-off events. [2024-10-11 17:17:13,938 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-10-11 17:17:13,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11725 conditions, 8822 events. 2053/8822 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 91934 event pairs, 1520 based on Foata normal form. 0/7237 useless extension candidates. Maximal degree in co-relation 11687. Up to 2804 conditions per place. [2024-10-11 17:17:14,044 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 38 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2024-10-11 17:17:14,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 299 transitions, 692 flow [2024-10-11 17:17:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1760 transitions. [2024-10-11 17:17:14,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8652900688298918 [2024-10-11 17:17:14,050 INFO L175 Difference]: Start difference. First operand has 298 places, 300 transitions, 608 flow. Second operand 6 states and 1760 transitions. [2024-10-11 17:17:14,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 299 transitions, 692 flow [2024-10-11 17:17:14,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 299 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:14,056 INFO L231 Difference]: Finished difference. Result has 301 places, 299 transitions, 615 flow [2024-10-11 17:17:14,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, 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-10-11 17:17:14,059 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -10 predicate places. [2024-10-11 17:17:14,060 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 615 flow [2024-10-11 17:17:14,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:14,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:14,062 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] [2024-10-11 17:17:14,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:17:14,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:14,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1424960186, now seen corresponding path program 1 times [2024-10-11 17:17:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:14,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554362851] [2024-10-11 17:17:14,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:14,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554362851] [2024-10-11 17:17:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554362851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:14,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547395611] [2024-10-11 17:17:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:14,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:14,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:14,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:14,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 339 [2024-10-11 17:17:14,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:14,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:14,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 339 [2024-10-11 17:17:14,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:14,324 INFO L124 PetriNetUnfolderBase]: 84/906 cut-off events. [2024-10-11 17:17:14,324 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:17:14,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 906 events. 84/906 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5289 event pairs, 56 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 1023. Up to 112 conditions per place. [2024-10-11 17:17:14,334 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 15 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-10-11 17:17:14,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 298 transitions, 647 flow [2024-10-11 17:17:14,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2024-10-11 17:17:14,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9351032448377581 [2024-10-11 17:17:14,338 INFO L175 Difference]: Start difference. First operand has 301 places, 299 transitions, 615 flow. Second operand 3 states and 951 transitions. [2024-10-11 17:17:14,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 298 transitions, 647 flow [2024-10-11 17:17:14,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 298 transitions, 637 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:14,344 INFO L231 Difference]: Finished difference. Result has 297 places, 298 transitions, 607 flow [2024-10-11 17:17:14,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, 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-10-11 17:17:14,346 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -14 predicate places. [2024-10-11 17:17:14,347 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 298 transitions, 607 flow [2024-10-11 17:17:14,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:14,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:14,348 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:14,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:17:14,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:14,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1920678985, now seen corresponding path program 1 times [2024-10-11 17:17:14,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:14,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782991953] [2024-10-11 17:17:14,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:14,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782991953] [2024-10-11 17:17:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782991953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:14,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:14,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:14,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941690513] [2024-10-11 17:17:14,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:14,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:14,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:14,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:14,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 339 [2024-10-11 17:17:14,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 298 transitions, 607 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-10-11 17:17:14,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:14,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 339 [2024-10-11 17:17:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:14,489 INFO L124 PetriNetUnfolderBase]: 17/396 cut-off events. [2024-10-11 17:17:14,489 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:17:14,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 396 events. 17/396 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1364 event pairs, 4 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 395. Up to 24 conditions per place. [2024-10-11 17:17:14,493 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 12 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-10-11 17:17:14,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 633 flow [2024-10-11 17:17:14,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2024-10-11 17:17:14,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2024-10-11 17:17:14,496 INFO L175 Difference]: Start difference. First operand has 297 places, 298 transitions, 607 flow. Second operand 3 states and 957 transitions. [2024-10-11 17:17:14,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 633 flow [2024-10-11 17:17:14,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 297 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:14,502 INFO L231 Difference]: Finished difference. Result has 296 places, 297 transitions, 605 flow [2024-10-11 17:17:14,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, 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-10-11 17:17:14,503 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -15 predicate places. [2024-10-11 17:17:14,504 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 297 transitions, 605 flow [2024-10-11 17:17:14,505 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-10-11 17:17:14,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:14,506 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] [2024-10-11 17:17:14,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:17:14,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:14,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash -501053886, now seen corresponding path program 1 times [2024-10-11 17:17:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:14,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110994377] [2024-10-11 17:17:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:14,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110994377] [2024-10-11 17:17:14,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110994377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:14,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:14,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:14,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387749109] [2024-10-11 17:17:14,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:14,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:14,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:14,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:14,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 339 [2024-10-11 17:17:14,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 297 transitions, 605 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-10-11 17:17:14,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:14,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 339 [2024-10-11 17:17:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:14,688 INFO L124 PetriNetUnfolderBase]: 16/410 cut-off events. [2024-10-11 17:17:14,689 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:17:14,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 410 events. 16/410 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1332 event pairs, 4 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 404. Up to 21 conditions per place. [2024-10-11 17:17:14,695 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-10-11 17:17:14,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 631 flow [2024-10-11 17:17:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2024-10-11 17:17:14,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2024-10-11 17:17:14,699 INFO L175 Difference]: Start difference. First operand has 296 places, 297 transitions, 605 flow. Second operand 3 states and 957 transitions. [2024-10-11 17:17:14,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 631 flow [2024-10-11 17:17:14,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:14,705 INFO L231 Difference]: Finished difference. Result has 295 places, 296 transitions, 603 flow [2024-10-11 17:17:14,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, 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-10-11 17:17:14,707 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -16 predicate places. [2024-10-11 17:17:14,707 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 296 transitions, 603 flow [2024-10-11 17:17:14,709 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-10-11 17:17:14,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:14,710 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] [2024-10-11 17:17:14,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:17:14,710 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:14,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1492001365, now seen corresponding path program 1 times [2024-10-11 17:17:14,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:14,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646010748] [2024-10-11 17:17:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:14,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646010748] [2024-10-11 17:17:14,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646010748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:14,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:14,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861204886] [2024-10-11 17:17:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:14,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:14,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:14,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 339 [2024-10-11 17:17:14,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 296 transitions, 603 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-10-11 17:17:14,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:14,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 339 [2024-10-11 17:17:14,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:14,850 INFO L124 PetriNetUnfolderBase]: 12/303 cut-off events. [2024-10-11 17:17:14,851 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:17:14,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 303 events. 12/303 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 731 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 295. Up to 21 conditions per place. [2024-10-11 17:17:14,854 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 12 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2024-10-11 17:17:14,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 295 transitions, 629 flow [2024-10-11 17:17:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2024-10-11 17:17:14,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2024-10-11 17:17:14,858 INFO L175 Difference]: Start difference. First operand has 295 places, 296 transitions, 603 flow. Second operand 3 states and 957 transitions. [2024-10-11 17:17:14,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 295 transitions, 629 flow [2024-10-11 17:17:14,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 295 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:14,866 INFO L231 Difference]: Finished difference. Result has 294 places, 295 transitions, 601 flow [2024-10-11 17:17:14,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=294, PETRI_TRANSITIONS=295} [2024-10-11 17:17:14,869 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2024-10-11 17:17:14,870 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 295 transitions, 601 flow [2024-10-11 17:17:14,871 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-10-11 17:17:14,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:14,872 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:14,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:17:14,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:14,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -403365518, now seen corresponding path program 1 times [2024-10-11 17:17:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459318931] [2024-10-11 17:17:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:14,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:14,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459318931] [2024-10-11 17:17:14,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459318931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:14,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:14,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:14,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980419932] [2024-10-11 17:17:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:14,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:14,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:14,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:14,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 339 [2024-10-11 17:17:14,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 295 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:14,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:14,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 339 [2024-10-11 17:17:14,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:15,083 INFO L124 PetriNetUnfolderBase]: 49/747 cut-off events. [2024-10-11 17:17:15,083 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-11 17:17:15,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 747 events. 49/747 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4076 event pairs, 20 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 776. Up to 56 conditions per place. [2024-10-11 17:17:15,092 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 14 selfloop transitions, 1 changer transitions 0/291 dead transitions. [2024-10-11 17:17:15,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 291 transitions, 623 flow [2024-10-11 17:17:15,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2024-10-11 17:17:15,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9360865290068829 [2024-10-11 17:17:15,096 INFO L175 Difference]: Start difference. First operand has 294 places, 295 transitions, 601 flow. Second operand 3 states and 952 transitions. [2024-10-11 17:17:15,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 291 transitions, 623 flow [2024-10-11 17:17:15,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 291 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:15,103 INFO L231 Difference]: Finished difference. Result has 290 places, 291 transitions, 591 flow [2024-10-11 17:17:15,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=290, PETRI_TRANSITIONS=291} [2024-10-11 17:17:15,106 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2024-10-11 17:17:15,106 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 291 transitions, 591 flow [2024-10-11 17:17:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:15,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:15,107 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] [2024-10-11 17:17:15,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:17:15,108 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash -80520043, now seen corresponding path program 1 times [2024-10-11 17:17:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:15,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473234267] [2024-10-11 17:17:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:15,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:15,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473234267] [2024-10-11 17:17:15,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473234267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:15,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:15,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618553654] [2024-10-11 17:17:15,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:15,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:15,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:15,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-11 17:17:15,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 291 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:15,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:15,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-11 17:17:15,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:15,264 INFO L124 PetriNetUnfolderBase]: 19/388 cut-off events. [2024-10-11 17:17:15,264 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:17:15,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 388 events. 19/388 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1359 event pairs, 2 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 391. Up to 14 conditions per place. [2024-10-11 17:17:15,269 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 11 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2024-10-11 17:17:15,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 291 transitions, 621 flow [2024-10-11 17:17:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-11 17:17:15,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478859390363815 [2024-10-11 17:17:15,273 INFO L175 Difference]: Start difference. First operand has 290 places, 291 transitions, 591 flow. Second operand 3 states and 964 transitions. [2024-10-11 17:17:15,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 291 transitions, 621 flow [2024-10-11 17:17:15,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 291 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:15,279 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 592 flow [2024-10-11 17:17:15,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2024-10-11 17:17:15,281 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -22 predicate places. [2024-10-11 17:17:15,282 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 592 flow [2024-10-11 17:17:15,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:15,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:15,283 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:15,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:17:15,283 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:15,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1137513529, now seen corresponding path program 1 times [2024-10-11 17:17:15,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226381888] [2024-10-11 17:17:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:15,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:15,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226381888] [2024-10-11 17:17:15,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226381888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:15,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:15,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:15,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504372142] [2024-10-11 17:17:15,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:15,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:15,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:15,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:15,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:15,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 339 [2024-10-11 17:17:15,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:15,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:15,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 339 [2024-10-11 17:17:15,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:15,868 INFO L124 PetriNetUnfolderBase]: 460/3169 cut-off events. [2024-10-11 17:17:15,868 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-11 17:17:15,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3819 conditions, 3169 events. 460/3169 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 28112 event pairs, 172 based on Foata normal form. 0/2737 useless extension candidates. Maximal degree in co-relation 3781. Up to 577 conditions per place. [2024-10-11 17:17:15,906 INFO L140 encePairwiseOnDemand]: 330/339 looper letters, 24 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2024-10-11 17:17:15,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 291 transitions, 655 flow [2024-10-11 17:17:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2024-10-11 17:17:15,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9321533923303835 [2024-10-11 17:17:15,911 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 592 flow. Second operand 3 states and 948 transitions. [2024-10-11 17:17:15,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 291 transitions, 655 flow [2024-10-11 17:17:15,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 291 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:15,920 INFO L231 Difference]: Finished difference. Result has 284 places, 286 transitions, 595 flow [2024-10-11 17:17:15,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=284, PETRI_TRANSITIONS=286} [2024-10-11 17:17:15,921 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2024-10-11 17:17:15,922 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 286 transitions, 595 flow [2024-10-11 17:17:15,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:15,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:15,922 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] [2024-10-11 17:17:15,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:17:15,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:15,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1075872973, now seen corresponding path program 1 times [2024-10-11 17:17:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:15,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025856980] [2024-10-11 17:17:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:15,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025856980] [2024-10-11 17:17:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025856980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:15,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:15,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:15,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366966595] [2024-10-11 17:17:15,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:15,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:15,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:15,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-11 17:17:15,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 286 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:15,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:15,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-11 17:17:15,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:16,139 INFO L124 PetriNetUnfolderBase]: 73/842 cut-off events. [2024-10-11 17:17:16,140 INFO L125 PetriNetUnfolderBase]: For 16/42 co-relation queries the response was YES. [2024-10-11 17:17:16,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 842 events. 73/842 cut-off events. For 16/42 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4428 event pairs, 6 based on Foata normal form. 2/753 useless extension candidates. Maximal degree in co-relation 931. Up to 40 conditions per place. [2024-10-11 17:17:16,150 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 11 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2024-10-11 17:17:16,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 286 transitions, 625 flow [2024-10-11 17:17:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-11 17:17:16,154 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478859390363815 [2024-10-11 17:17:16,154 INFO L175 Difference]: Start difference. First operand has 284 places, 286 transitions, 595 flow. Second operand 3 states and 964 transitions. [2024-10-11 17:17:16,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 286 transitions, 625 flow [2024-10-11 17:17:16,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 286 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:16,159 INFO L231 Difference]: Finished difference. Result has 284 places, 284 transitions, 597 flow [2024-10-11 17:17:16,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=284, PETRI_TRANSITIONS=284} [2024-10-11 17:17:16,161 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2024-10-11 17:17:16,161 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 284 transitions, 597 flow [2024-10-11 17:17:16,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:16,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:16,162 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] [2024-10-11 17:17:16,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:17:16,163 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:16,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2065179203, now seen corresponding path program 1 times [2024-10-11 17:17:16,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:16,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006870893] [2024-10-11 17:17:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006870893] [2024-10-11 17:17:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006870893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:16,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:16,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253330582] [2024-10-11 17:17:16,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:16,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:16,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:16,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:16,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-11 17:17:16,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 284 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:16,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:16,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-11 17:17:16,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:16,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([909] thread3EXIT-->L89: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_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[][265], [Black: 368#true, 370#(= |#race~A~0| 0), 372#true, 244#L89true, 343#(= |#race~N~0| 0), 364#(= |#race~M~0| 0), 375#true]) [2024-10-11 17:17:16,343 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-10-11 17:17:16,343 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-11 17:17:16,343 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-11 17:17:16,343 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-10-11 17:17:16,343 INFO L124 PetriNetUnfolderBase]: 65/761 cut-off events. [2024-10-11 17:17:16,343 INFO L125 PetriNetUnfolderBase]: For 8/46 co-relation queries the response was YES. [2024-10-11 17:17:16,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 761 events. 65/761 cut-off events. For 8/46 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3663 event pairs, 13 based on Foata normal form. 5/694 useless extension candidates. Maximal degree in co-relation 871. Up to 52 conditions per place. [2024-10-11 17:17:16,355 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 13 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-10-11 17:17:16,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 285 transitions, 631 flow [2024-10-11 17:17:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-11 17:17:16,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478859390363815 [2024-10-11 17:17:16,358 INFO L175 Difference]: Start difference. First operand has 284 places, 284 transitions, 597 flow. Second operand 3 states and 964 transitions. [2024-10-11 17:17:16,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 285 transitions, 631 flow [2024-10-11 17:17:16,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 285 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:16,363 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 593 flow [2024-10-11 17:17:16,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2024-10-11 17:17:16,365 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -28 predicate places. [2024-10-11 17:17:16,365 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 593 flow [2024-10-11 17:17:16,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:16,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:16,366 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] [2024-10-11 17:17:16,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:17:16,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:16,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1128922688, now seen corresponding path program 1 times [2024-10-11 17:17:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:16,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036983417] [2024-10-11 17:17:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:16,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:16,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036983417] [2024-10-11 17:17:16,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036983417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:16,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:16,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:17:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642681189] [2024-10-11 17:17:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:16,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:17:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:16,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:17:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:17:16,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-11 17:17:16,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 593 flow. Second operand has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:16,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:16,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-11 17:17:16,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:17,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([909] thread3EXIT-->L89: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_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[][293], [378#true, Black: 368#true, 370#(= |#race~A~0| 0), 244#L89true, 343#(= |#race~N~0| 0), 375#true, 364#(= |#race~M~0| 0)]) [2024-10-11 17:17:17,015 INFO L294 olderBase$Statistics]: this new event has 260 ancestors and is cut-off event [2024-10-11 17:17:17,015 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2024-10-11 17:17:17,015 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-10-11 17:17:17,015 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2024-10-11 17:17:17,015 INFO L124 PetriNetUnfolderBase]: 95/1385 cut-off events. [2024-10-11 17:17:17,015 INFO L125 PetriNetUnfolderBase]: For 11/40 co-relation queries the response was YES. [2024-10-11 17:17:17,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 1385 events. 95/1385 cut-off events. For 11/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8646 event pairs, 18 based on Foata normal form. 4/1259 useless extension candidates. Maximal degree in co-relation 1560. Up to 67 conditions per place. [2024-10-11 17:17:17,031 INFO L140 encePairwiseOnDemand]: 326/339 looper letters, 22 selfloop transitions, 14 changer transitions 0/298 dead transitions. [2024-10-11 17:17:17,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 298 transitions, 703 flow [2024-10-11 17:17:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:17:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:17:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3127 transitions. [2024-10-11 17:17:17,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9224188790560472 [2024-10-11 17:17:17,038 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 593 flow. Second operand 10 states and 3127 transitions. [2024-10-11 17:17:17,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 298 transitions, 703 flow [2024-10-11 17:17:17,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 298 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:17,045 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 655 flow [2024-10-11 17:17:17,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=655, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2024-10-11 17:17:17,046 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2024-10-11 17:17:17,046 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 655 flow [2024-10-11 17:17:17,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:17,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:17,048 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:17,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:17:17,049 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:17,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash 298348699, now seen corresponding path program 1 times [2024-10-11 17:17:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934621410] [2024-10-11 17:17:17,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934621410] [2024-10-11 17:17:17,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934621410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127649578] [2024-10-11 17:17:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:17,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-11 17:17:17,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 655 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-10-11 17:17:17,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:17,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-11 17:17:17,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:17,371 INFO L124 PetriNetUnfolderBase]: 145/1650 cut-off events. [2024-10-11 17:17:17,371 INFO L125 PetriNetUnfolderBase]: For 53/108 co-relation queries the response was YES. [2024-10-11 17:17:17,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1959 conditions, 1650 events. 145/1650 cut-off events. For 53/108 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10800 event pairs, 29 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 1913. Up to 120 conditions per place. [2024-10-11 17:17:17,394 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 13 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-10-11 17:17:17,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 291 transitions, 689 flow [2024-10-11 17:17:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-11 17:17:17,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478859390363815 [2024-10-11 17:17:17,397 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 655 flow. Second operand 3 states and 964 transitions. [2024-10-11 17:17:17,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 291 transitions, 689 flow [2024-10-11 17:17:17,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 291 transitions, 685 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:17,403 INFO L231 Difference]: Finished difference. Result has 294 places, 289 transitions, 653 flow [2024-10-11 17:17:17,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=294, PETRI_TRANSITIONS=289} [2024-10-11 17:17:17,405 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2024-10-11 17:17:17,405 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 653 flow [2024-10-11 17:17:17,406 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-10-11 17:17:17,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:17,406 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] [2024-10-11 17:17:17,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:17:17,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1856901994, now seen corresponding path program 1 times [2024-10-11 17:17:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547606363] [2024-10-11 17:17:17,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:17,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:17,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547606363] [2024-10-11 17:17:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547606363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:17,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:17,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:17,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487282959] [2024-10-11 17:17:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:17,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:17,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:17,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:17,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:17,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-11 17:17:17,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:17,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:17,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-11 17:17:17,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:17,654 INFO L124 PetriNetUnfolderBase]: 119/1101 cut-off events. [2024-10-11 17:17:17,654 INFO L125 PetriNetUnfolderBase]: For 58/89 co-relation queries the response was YES. [2024-10-11 17:17:17,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 1101 events. 119/1101 cut-off events. For 58/89 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6223 event pairs, 11 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 1306. Up to 79 conditions per place. [2024-10-11 17:17:17,663 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 9 selfloop transitions, 2 changer transitions 8/289 dead transitions. [2024-10-11 17:17:17,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 681 flow [2024-10-11 17:17:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2024-10-11 17:17:17,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9469026548672567 [2024-10-11 17:17:17,666 INFO L175 Difference]: Start difference. First operand has 294 places, 289 transitions, 653 flow. Second operand 3 states and 963 transitions. [2024-10-11 17:17:17,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 289 transitions, 681 flow [2024-10-11 17:17:17,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 677 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:17,671 INFO L231 Difference]: Finished difference. Result has 292 places, 279 transitions, 632 flow [2024-10-11 17:17:17,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=292, PETRI_TRANSITIONS=279} [2024-10-11 17:17:17,672 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -19 predicate places. [2024-10-11 17:17:17,673 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 279 transitions, 632 flow [2024-10-11 17:17:17,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:17,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:17,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:17,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:17:17,674 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:17,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash -280137186, now seen corresponding path program 1 times [2024-10-11 17:17:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102862268] [2024-10-11 17:17:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102862268] [2024-10-11 17:17:17,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102862268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:17,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:17,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143893504] [2024-10-11 17:17:17,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:17,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:17:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:17,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:17:17,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:17:17,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 339 [2024-10-11 17:17:17,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 279 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:17,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:17,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 339 [2024-10-11 17:17:17,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:18,130 INFO L124 PetriNetUnfolderBase]: 133/1669 cut-off events. [2024-10-11 17:17:18,130 INFO L125 PetriNetUnfolderBase]: For 60/70 co-relation queries the response was YES. [2024-10-11 17:17:18,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1669 events. 133/1669 cut-off events. For 60/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11162 event pairs, 40 based on Foata normal form. 8/1543 useless extension candidates. Maximal degree in co-relation 1968. Up to 114 conditions per place. [2024-10-11 17:17:18,153 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 22 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2024-10-11 17:17:18,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 713 flow [2024-10-11 17:17:18,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:17:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:17:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1583 transitions. [2024-10-11 17:17:18,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9339233038348083 [2024-10-11 17:17:18,157 INFO L175 Difference]: Start difference. First operand has 292 places, 279 transitions, 632 flow. Second operand 5 states and 1583 transitions. [2024-10-11 17:17:18,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 713 flow [2024-10-11 17:17:18,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:18,164 INFO L231 Difference]: Finished difference. Result has 288 places, 281 transitions, 653 flow [2024-10-11 17:17:18,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=653, PETRI_PLACES=288, PETRI_TRANSITIONS=281} [2024-10-11 17:17:18,165 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -23 predicate places. [2024-10-11 17:17:18,165 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 281 transitions, 653 flow [2024-10-11 17:17:18,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:18,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:18,166 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] [2024-10-11 17:17:18,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:17:18,167 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:18,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1546674034, now seen corresponding path program 1 times [2024-10-11 17:17:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737074209] [2024-10-11 17:17:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:18,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:18,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737074209] [2024-10-11 17:17:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737074209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:18,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:18,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:18,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514443190] [2024-10-11 17:17:18,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:18,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:18,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:18,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:18,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-11 17:17:18,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 281 transitions, 653 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-10-11 17:17:18,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:18,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-11 17:17:18,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:18,505 INFO L124 PetriNetUnfolderBase]: 233/1746 cut-off events. [2024-10-11 17:17:18,505 INFO L125 PetriNetUnfolderBase]: For 147/218 co-relation queries the response was YES. [2024-10-11 17:17:18,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1746 events. 233/1746 cut-off events. For 147/218 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12167 event pairs, 56 based on Foata normal form. 0/1602 useless extension candidates. Maximal degree in co-relation 2196. Up to 235 conditions per place. [2024-10-11 17:17:18,526 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 11 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-10-11 17:17:18,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 282 transitions, 683 flow [2024-10-11 17:17:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2024-10-11 17:17:18,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9459193706981318 [2024-10-11 17:17:18,529 INFO L175 Difference]: Start difference. First operand has 288 places, 281 transitions, 653 flow. Second operand 3 states and 962 transitions. [2024-10-11 17:17:18,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 282 transitions, 683 flow [2024-10-11 17:17:18,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 282 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:18,535 INFO L231 Difference]: Finished difference. Result has 287 places, 280 transitions, 650 flow [2024-10-11 17:17:18,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=287, PETRI_TRANSITIONS=280} [2024-10-11 17:17:18,536 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -24 predicate places. [2024-10-11 17:17:18,536 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 280 transitions, 650 flow [2024-10-11 17:17:18,537 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-10-11 17:17:18,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:18,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:18,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:17:18,537 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:18,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:18,538 INFO L85 PathProgramCache]: Analyzing trace with hash -218885246, now seen corresponding path program 1 times [2024-10-11 17:17:18,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:18,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644538056] [2024-10-11 17:17:18,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:18,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:18,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-10-11 17:17:18,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644538056] [2024-10-11 17:17:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644538056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:18,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:18,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650102306] [2024-10-11 17:17:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:18,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:18,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:18,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:18,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:19,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-11 17:17:19,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 280 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:19,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:19,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-11 17:17:19,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:19,558 INFO L124 PetriNetUnfolderBase]: 151/1753 cut-off events. [2024-10-11 17:17:19,559 INFO L125 PetriNetUnfolderBase]: For 141/150 co-relation queries the response was YES. [2024-10-11 17:17:19,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1753 events. 151/1753 cut-off events. For 141/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11812 event pairs, 37 based on Foata normal form. 0/1636 useless extension candidates. Maximal degree in co-relation 2170. Up to 142 conditions per place. [2024-10-11 17:17:19,587 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 25 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2024-10-11 17:17:19,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 288 transitions, 734 flow [2024-10-11 17:17:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-11 17:17:19,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-11 17:17:19,591 INFO L175 Difference]: Start difference. First operand has 287 places, 280 transitions, 650 flow. Second operand 6 states and 1883 transitions. [2024-10-11 17:17:19,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 288 transitions, 734 flow [2024-10-11 17:17:19,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:19,597 INFO L231 Difference]: Finished difference. Result has 290 places, 280 transitions, 660 flow [2024-10-11 17:17:19,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=290, PETRI_TRANSITIONS=280} [2024-10-11 17:17:19,599 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2024-10-11 17:17:19,599 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 280 transitions, 660 flow [2024-10-11 17:17:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:19,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:19,600 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] [2024-10-11 17:17:19,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:17:19,600 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:19,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash -738393419, now seen corresponding path program 1 times [2024-10-11 17:17:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:19,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952282106] [2024-10-11 17:17:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:20,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952282106] [2024-10-11 17:17:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952282106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:20,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:20,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535816771] [2024-10-11 17:17:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:20,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:20,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:20,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:20,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:20,437 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-11 17:17:20,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 280 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:20,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:20,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-11 17:17:20,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:20,759 INFO L124 PetriNetUnfolderBase]: 232/1738 cut-off events. [2024-10-11 17:17:20,759 INFO L125 PetriNetUnfolderBase]: For 147/268 co-relation queries the response was YES. [2024-10-11 17:17:20,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 1738 events. 232/1738 cut-off events. For 147/268 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12186 event pairs, 52 based on Foata normal form. 4/1628 useless extension candidates. Maximal degree in co-relation 2227. Up to 219 conditions per place. [2024-10-11 17:17:20,781 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 23 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2024-10-11 17:17:20,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 740 flow [2024-10-11 17:17:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-11 17:17:20,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-11 17:17:20,786 INFO L175 Difference]: Start difference. First operand has 290 places, 280 transitions, 660 flow. Second operand 6 states and 1883 transitions. [2024-10-11 17:17:20,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 740 flow [2024-10-11 17:17:20,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 288 transitions, 732 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:17:20,791 INFO L231 Difference]: Finished difference. Result has 291 places, 280 transitions, 666 flow [2024-10-11 17:17:20,792 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=666, PETRI_PLACES=291, PETRI_TRANSITIONS=280} [2024-10-11 17:17:20,792 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -20 predicate places. [2024-10-11 17:17:20,792 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 280 transitions, 666 flow [2024-10-11 17:17:20,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:20,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:20,794 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-10-11 17:17:20,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:17:20,794 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:20,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1502202117, now seen corresponding path program 1 times [2024-10-11 17:17:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:20,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817472722] [2024-10-11 17:17:20,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:20,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:20,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:20,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817472722] [2024-10-11 17:17:20,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817472722] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:17:20,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850989374] [2024-10-11 17:17:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:20,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:17:20,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:20,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:17:20,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:17:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:21,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 17:17:21,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:17:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:21,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:17:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:21,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850989374] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:17:21,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:17:21,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-11 17:17:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274912127] [2024-10-11 17:17:21,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:17:21,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:17:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:17:21,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:17:22,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 339 [2024-10-11 17:17:22,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 280 transitions, 666 flow. Second operand has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:22,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:22,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 339 [2024-10-11 17:17:22,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:22,969 INFO L124 PetriNetUnfolderBase]: 208/3310 cut-off events. [2024-10-11 17:17:22,969 INFO L125 PetriNetUnfolderBase]: For 94/118 co-relation queries the response was YES. [2024-10-11 17:17:23,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 3310 events. 208/3310 cut-off events. For 94/118 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 28074 event pairs, 35 based on Foata normal form. 9/3136 useless extension candidates. Maximal degree in co-relation 4077. Up to 108 conditions per place. [2024-10-11 17:17:23,013 INFO L140 encePairwiseOnDemand]: 322/339 looper letters, 26 selfloop transitions, 27 changer transitions 0/302 dead transitions. [2024-10-11 17:17:23,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 838 flow [2024-10-11 17:17:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:17:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 17:17:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4930 transitions. [2024-10-11 17:17:23,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9089233038348082 [2024-10-11 17:17:23,022 INFO L175 Difference]: Start difference. First operand has 291 places, 280 transitions, 666 flow. Second operand 16 states and 4930 transitions. [2024-10-11 17:17:23,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 838 flow [2024-10-11 17:17:23,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 830 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:17:23,030 INFO L231 Difference]: Finished difference. Result has 310 places, 291 transitions, 797 flow [2024-10-11 17:17:23,030 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=797, PETRI_PLACES=310, PETRI_TRANSITIONS=291} [2024-10-11 17:17:23,031 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -1 predicate places. [2024-10-11 17:17:23,031 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 291 transitions, 797 flow [2024-10-11 17:17:23,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:23,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:23,034 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] [2024-10-11 17:17:23,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:17:23,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:17:23,235 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:23,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash -636323606, now seen corresponding path program 1 times [2024-10-11 17:17:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967400277] [2024-10-11 17:17:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:23,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:23,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967400277] [2024-10-11 17:17:23,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967400277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:23,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:23,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230858261] [2024-10-11 17:17:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:23,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:24,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-11 17:17:24,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 291 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:24,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:24,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-11 17:17:24,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:24,517 INFO L124 PetriNetUnfolderBase]: 198/2471 cut-off events. [2024-10-11 17:17:24,517 INFO L125 PetriNetUnfolderBase]: For 285/294 co-relation queries the response was YES. [2024-10-11 17:17:24,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 2471 events. 198/2471 cut-off events. For 285/294 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 18739 event pairs, 51 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 3195. Up to 196 conditions per place. [2024-10-11 17:17:24,558 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 25 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2024-10-11 17:17:24,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 298 transitions, 879 flow [2024-10-11 17:17:24,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-11 17:17:24,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-11 17:17:24,564 INFO L175 Difference]: Start difference. First operand has 310 places, 291 transitions, 797 flow. Second operand 6 states and 1883 transitions. [2024-10-11 17:17:24,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 298 transitions, 879 flow [2024-10-11 17:17:24,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 298 transitions, 862 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:24,572 INFO L231 Difference]: Finished difference. Result has 312 places, 290 transitions, 788 flow [2024-10-11 17:17:24,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=778, 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=788, PETRI_PLACES=312, PETRI_TRANSITIONS=290} [2024-10-11 17:17:24,573 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, 1 predicate places. [2024-10-11 17:17:24,574 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 290 transitions, 788 flow [2024-10-11 17:17:24,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:24,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:24,575 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] [2024-10-11 17:17:24,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:17:24,576 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:24,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1931194269, now seen corresponding path program 1 times [2024-10-11 17:17:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162001923] [2024-10-11 17:17:24,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162001923] [2024-10-11 17:17:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162001923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:24,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690218004] [2024-10-11 17:17:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:24,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:24,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:24,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:24,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:25,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-11 17:17:25,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 290 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:25,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:25,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-11 17:17:25,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:25,706 INFO L124 PetriNetUnfolderBase]: 310/2227 cut-off events. [2024-10-11 17:17:25,707 INFO L125 PetriNetUnfolderBase]: For 335/504 co-relation queries the response was YES. [2024-10-11 17:17:25,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 2227 events. 310/2227 cut-off events. For 335/504 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 16454 event pairs, 75 based on Foata normal form. 20/2123 useless extension candidates. Maximal degree in co-relation 3081. Up to 307 conditions per place. [2024-10-11 17:17:25,736 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 23 selfloop transitions, 5 changer transitions 13/297 dead transitions. [2024-10-11 17:17:25,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 297 transitions, 866 flow [2024-10-11 17:17:25,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-11 17:17:25,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-11 17:17:25,740 INFO L175 Difference]: Start difference. First operand has 312 places, 290 transitions, 788 flow. Second operand 6 states and 1883 transitions. [2024-10-11 17:17:25,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 297 transitions, 866 flow [2024-10-11 17:17:25,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 297 transitions, 854 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:25,747 INFO L231 Difference]: Finished difference. Result has 311 places, 276 transitions, 694 flow [2024-10-11 17:17:25,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=311, PETRI_TRANSITIONS=276} [2024-10-11 17:17:25,748 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, 0 predicate places. [2024-10-11 17:17:25,749 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 276 transitions, 694 flow [2024-10-11 17:17:25,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:25,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:25,750 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-11 17:17:25,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:17:25,750 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:25,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:25,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1277161248, now seen corresponding path program 2 times [2024-10-11 17:17:25,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:25,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653361404] [2024-10-11 17:17:25,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:25,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 17:17:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653361404] [2024-10-11 17:17:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653361404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:26,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:26,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:26,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962707228] [2024-10-11 17:17:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:26,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:26,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:26,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:26,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-11 17:17:26,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 276 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:26,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:26,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-11 17:17:26,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:26,611 INFO L124 PetriNetUnfolderBase]: 96/1255 cut-off events. [2024-10-11 17:17:26,612 INFO L125 PetriNetUnfolderBase]: For 40/64 co-relation queries the response was YES. [2024-10-11 17:17:26,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1255 events. 96/1255 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7426 event pairs, 21 based on Foata normal form. 8/1214 useless extension candidates. Maximal degree in co-relation 1656. Up to 88 conditions per place. [2024-10-11 17:17:26,625 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 23 selfloop transitions, 5 changer transitions 0/284 dead transitions. [2024-10-11 17:17:26,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 284 transitions, 774 flow [2024-10-11 17:17:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-11 17:17:26,632 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-11 17:17:26,632 INFO L175 Difference]: Start difference. First operand has 311 places, 276 transitions, 694 flow. Second operand 6 states and 1883 transitions. [2024-10-11 17:17:26,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 284 transitions, 774 flow [2024-10-11 17:17:26,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 284 transitions, 722 flow, removed 4 selfloop flow, removed 18 redundant places. [2024-10-11 17:17:26,638 INFO L231 Difference]: Finished difference. Result has 290 places, 276 transitions, 656 flow [2024-10-11 17:17:26,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=656, PETRI_PLACES=290, PETRI_TRANSITIONS=276} [2024-10-11 17:17:26,639 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2024-10-11 17:17:26,639 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 276 transitions, 656 flow [2024-10-11 17:17:26,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:26,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:26,640 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-11 17:17:26,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:17:26,641 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-11 17:17:26,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash -296542840, now seen corresponding path program 1 times [2024-10-11 17:17:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:26,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761886983] [2024-10-11 17:17:26,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 17:17:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761886983] [2024-10-11 17:17:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761886983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145405942] [2024-10-11 17:17:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:27,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:27,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-11 17:17:27,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 276 transitions, 656 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:27,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:27,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-11 17:17:27,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:27,542 INFO L124 PetriNetUnfolderBase]: 96/1249 cut-off events. [2024-10-11 17:17:27,542 INFO L125 PetriNetUnfolderBase]: For 33/57 co-relation queries the response was YES. [2024-10-11 17:17:27,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 1249 events. 96/1249 cut-off events. For 33/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7346 event pairs, 21 based on Foata normal form. 8/1202 useless extension candidates. Maximal degree in co-relation 1603. Up to 88 conditions per place. [2024-10-11 17:17:27,551 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 0 selfloop transitions, 0 changer transitions 283/283 dead transitions. [2024-10-11 17:17:27,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 283 transitions, 734 flow [2024-10-11 17:17:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-11 17:17:27,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-11 17:17:27,555 INFO L175 Difference]: Start difference. First operand has 290 places, 276 transitions, 656 flow. Second operand 6 states and 1883 transitions. [2024-10-11 17:17:27,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 283 transitions, 734 flow [2024-10-11 17:17:27,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 283 transitions, 726 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:17:27,559 INFO L231 Difference]: Finished difference. Result has 290 places, 0 transitions, 0 flow [2024-10-11 17:17:27,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=290, PETRI_TRANSITIONS=0} [2024-10-11 17:17:27,560 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2024-10-11 17:17:27,560 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 0 transitions, 0 flow [2024-10-11 17:17:27,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:27,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (60 of 61 remaining) [2024-10-11 17:17:27,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2024-10-11 17:17:27,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2024-10-11 17:17:27,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2024-10-11 17:17:27,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2024-10-11 17:17:27,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2024-10-11 17:17:27,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2024-10-11 17:17:27,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2024-10-11 17:17:27,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2024-10-11 17:17:27,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2024-10-11 17:17:27,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2024-10-11 17:17:27,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2024-10-11 17:17:27,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2024-10-11 17:17:27,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2024-10-11 17:17:27,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2024-10-11 17:17:27,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2024-10-11 17:17:27,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2024-10-11 17:17:27,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2024-10-11 17:17:27,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2024-10-11 17:17:27,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2024-10-11 17:17:27,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2024-10-11 17:17:27,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2024-10-11 17:17:27,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2024-10-11 17:17:27,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2024-10-11 17:17:27,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2024-10-11 17:17:27,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2024-10-11 17:17:27,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2024-10-11 17:17:27,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2024-10-11 17:17:27,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2024-10-11 17:17:27,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2024-10-11 17:17:27,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2024-10-11 17:17:27,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2024-10-11 17:17:27,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2024-10-11 17:17:27,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2024-10-11 17:17:27,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2024-10-11 17:17:27,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (25 of 61 remaining) [2024-10-11 17:17:27,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2024-10-11 17:17:27,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2024-10-11 17:17:27,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2024-10-11 17:17:27,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2024-10-11 17:17:27,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2024-10-11 17:17:27,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2024-10-11 17:17:27,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2024-10-11 17:17:27,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2024-10-11 17:17:27,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2024-10-11 17:17:27,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2024-10-11 17:17:27,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2024-10-11 17:17:27,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2024-10-11 17:17:27,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2024-10-11 17:17:27,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2024-10-11 17:17:27,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2024-10-11 17:17:27,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2024-10-11 17:17:27,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2024-10-11 17:17:27,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2024-10-11 17:17:27,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2024-10-11 17:17:27,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2024-10-11 17:17:27,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2024-10-11 17:17:27,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2024-10-11 17:17:27,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2024-10-11 17:17:27,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2024-10-11 17:17:27,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2024-10-11 17:17:27,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:17:27,573 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-10-11 17:17:27,579 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:17:27,579 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:17:27,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:17:27 BasicIcfg [2024-10-11 17:17:27,584 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:17:27,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:17:27,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:17:27,585 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:17:27,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:09" (3/4) ... [2024-10-11 17:17:27,587 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:17:27,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:17:27,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:17:27,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:17:27,596 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-11 17:17:27,597 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:17:27,597 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:17:27,597 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:17:27,707 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:17:27,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:17:27,708 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:17:27,708 INFO L158 Benchmark]: Toolchain (without parser) took 19224.32ms. Allocated memory was 159.4MB in the beginning and 725.6MB in the end (delta: 566.2MB). Free memory was 103.7MB in the beginning and 564.1MB in the end (delta: -460.4MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2024-10-11 17:17:27,708 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:17:27,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.05ms. Allocated memory is still 159.4MB. Free memory was 103.7MB in the beginning and 89.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:17:27,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.53ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 87.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:27,709 INFO L158 Benchmark]: Boogie Preprocessor took 58.62ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 84.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:27,709 INFO L158 Benchmark]: RCFGBuilder took 909.89ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 120.9MB in the end (delta: -36.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-10-11 17:17:27,710 INFO L158 Benchmark]: TraceAbstraction took 17745.12ms. Allocated memory was 159.4MB in the beginning and 725.6MB in the end (delta: 566.2MB). Free memory was 120.1MB in the beginning and 570.4MB in the end (delta: -450.4MB). Peak memory consumption was 522.5MB. Max. memory is 16.1GB. [2024-10-11 17:17:27,710 INFO L158 Benchmark]: Witness Printer took 122.90ms. Allocated memory is still 725.6MB. Free memory was 570.4MB in the beginning and 564.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:17:27,711 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.17ms. Allocated memory is still 159.4MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.05ms. Allocated memory is still 159.4MB. Free memory was 103.7MB in the beginning and 89.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.53ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 87.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.62ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 84.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 909.89ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 120.9MB in the end (delta: -36.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17745.12ms. Allocated memory was 159.4MB in the beginning and 725.6MB in the end (delta: 566.2MB). Free memory was 120.1MB in the beginning and 570.4MB in the end (delta: -450.4MB). Peak memory consumption was 522.5MB. Max. memory is 16.1GB. * Witness Printer took 122.90ms. Allocated memory is still 725.6MB. Free memory was 570.4MB in the beginning and 564.1MB 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: 103]: 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: 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, 473 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: 17.5s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2585 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1575 mSDsluCounter, 1421 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1211 mSDsCounter, 587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4285 IncrementalHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 587 mSolverCounterUnsat, 210 mSDtfsCounter, 4285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred 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.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2631 NumberOfCodeBlocks, 2631 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2733 ConstructedInterpolants, 0 QuantifiedInterpolants, 4644 SizeOfPredicates, 7 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 34/37 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-10-11 17:17:27,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE