./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:58:50,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:58:50,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:58:50,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:58:50,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:58:50,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:58:50,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:58:50,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:58:50,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:58:50,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:58:50,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:58:50,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:58:50,446 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:58:50,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:58:50,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:58:50,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:58:50,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:58:50,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:58:50,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:58:50,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:58:50,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:58:50,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:58:50,453 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:58:50,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:58:50,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:58:50,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:58:50,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:58:50,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:58:50,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:58:50,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:58:50,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:58:50,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:50,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:58:50,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:58:50,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:58:50,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:58:50,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:58:50,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:58:50,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:58:50,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:58:50,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:58:50,460 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2024-11-09 06:58:50,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:58:50,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:58:50,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:58:50,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:58:50,729 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:58:50,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2024-11-09 06:58:52,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:58:52,408 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:58:52,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2024-11-09 06:58:52,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8668da759/46a842e959744a22a3575b9b6367a3e5/FLAG86c309f1e [2024-11-09 06:58:52,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8668da759/46a842e959744a22a3575b9b6367a3e5 [2024-11-09 06:58:52,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:58:52,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:58:52,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:52,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:58:52,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:58:52,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129be75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52, skipping insertion in model container [2024-11-09 06:58:52,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:58:52,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:52,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:58:52,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:52,860 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:58:52,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52 WrapperNode [2024-11-09 06:58:52,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:52,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:52,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:58:52,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:58:52,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,917 INFO L138 Inliner]: procedures = 25, calls = 33, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 446 [2024-11-09 06:58:52,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:52,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:58:52,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:58:52,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:58:52,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:52,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:58:52,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:58:52,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:58:52,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:58:52,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (1/1) ... [2024-11-09 06:58:53,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:58:53,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:58:53,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:58:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:58:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 06:58:53,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 06:58:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 06:58:53,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 06:58:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 06:58:53,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 06:58:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:58:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:58:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:58:53,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:58:53,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:58:53,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:58:53,096 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:58:53,217 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:58:53,219 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:58:53,774 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:58:53,774 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:58:53,791 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:58:53,792 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 06:58:53,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:53 BoogieIcfgContainer [2024-11-09 06:58:53,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:58:53,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:58:53,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:58:53,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:58:53,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:58:52" (1/3) ... [2024-11-09 06:58:53,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e41815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:53, skipping insertion in model container [2024-11-09 06:58:53,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:52" (2/3) ... [2024-11-09 06:58:53,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e41815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:53, skipping insertion in model container [2024-11-09 06:58:53,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:53" (3/3) ... [2024-11-09 06:58:53,799 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2024-11-09 06:58:53,812 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:58:53,812 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2024-11-09 06:58:53,813 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:58:54,004 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 06:58:54,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 566 places, 589 transitions, 1199 flow [2024-11-09 06:58:54,292 INFO L124 PetriNetUnfolderBase]: 33/586 cut-off events. [2024-11-09 06:58:54,292 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:58:54,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 586 events. 33/586 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1247 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 436. Up to 2 conditions per place. [2024-11-09 06:58:54,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 566 places, 589 transitions, 1199 flow [2024-11-09 06:58:54,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 545 places, 566 transitions, 1150 flow [2024-11-09 06:58:54,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:58:54,342 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;@19d568b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:58:54,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-11-09 06:58:54,357 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:58:54,357 INFO L124 PetriNetUnfolderBase]: 3/63 cut-off events. [2024-11-09 06:58:54,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:58:54,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:54,359 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] [2024-11-09 06:58:54,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:58:54,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1756171046, now seen corresponding path program 1 times [2024-11-09 06:58:54,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938845106] [2024-11-09 06:58:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:55,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938845106] [2024-11-09 06:58:55,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938845106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:55,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:55,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642908200] [2024-11-09 06:58:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:55,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:55,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:55,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:55,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 493 out of 589 [2024-11-09 06:58:55,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 566 transitions, 1150 flow. Second operand has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:55,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:55,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 493 of 589 [2024-11-09 06:58:55,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:58,511 INFO L124 PetriNetUnfolderBase]: 2074/15191 cut-off events. [2024-11-09 06:58:58,512 INFO L125 PetriNetUnfolderBase]: For 633/635 co-relation queries the response was YES. [2024-11-09 06:58:58,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18394 conditions, 15191 events. 2074/15191 cut-off events. For 633/635 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 184180 event pairs, 1520 based on Foata normal form. 1015/13833 useless extension candidates. Maximal degree in co-relation 16163. Up to 2820 conditions per place. [2024-11-09 06:58:58,635 INFO L140 encePairwiseOnDemand]: 549/589 looper letters, 54 selfloop transitions, 15 changer transitions 7/541 dead transitions. [2024-11-09 06:58:58,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 541 transitions, 1238 flow [2024-11-09 06:58:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3052 transitions. [2024-11-09 06:58:58,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8636106395019808 [2024-11-09 06:58:58,664 INFO L175 Difference]: Start difference. First operand has 545 places, 566 transitions, 1150 flow. Second operand 6 states and 3052 transitions. [2024-11-09 06:58:58,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 541 transitions, 1238 flow [2024-11-09 06:58:58,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 541 transitions, 1226 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 06:58:58,679 INFO L231 Difference]: Finished difference. Result has 541 places, 534 transitions, 1104 flow [2024-11-09 06:58:58,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1104, PETRI_PLACES=541, PETRI_TRANSITIONS=534} [2024-11-09 06:58:58,684 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -4 predicate places. [2024-11-09 06:58:58,684 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 534 transitions, 1104 flow [2024-11-09 06:58:58,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:58,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:58,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:58,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:58:58,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:58:58,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2135015568, now seen corresponding path program 1 times [2024-11-09 06:58:58,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:58,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024919572] [2024-11-09 06:58:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:58,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:58,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:58,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024919572] [2024-11-09 06:58:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024919572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:58,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:58,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559073739] [2024-11-09 06:58:58,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:58,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:58,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:58,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:58,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:58,736 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-09 06:58:58,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 534 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:58,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:58,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-09 06:58:58,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:58,993 INFO L124 PetriNetUnfolderBase]: 24/956 cut-off events. [2024-11-09 06:58:58,993 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-11-09 06:58:58,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 956 events. 24/956 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3936 event pairs, 7 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 959. Up to 25 conditions per place. [2024-11-09 06:58:59,003 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2024-11-09 06:58:59,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 533 transitions, 1128 flow [2024-11-09 06:58:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-09 06:58:59,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-09 06:58:59,007 INFO L175 Difference]: Start difference. First operand has 541 places, 534 transitions, 1104 flow. Second operand 3 states and 1664 transitions. [2024-11-09 06:58:59,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 533 transitions, 1128 flow [2024-11-09 06:58:59,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 533 transitions, 1098 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:58:59,014 INFO L231 Difference]: Finished difference. Result has 530 places, 533 transitions, 1076 flow [2024-11-09 06:58:59,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1076, PETRI_PLACES=530, PETRI_TRANSITIONS=533} [2024-11-09 06:58:59,016 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -15 predicate places. [2024-11-09 06:58:59,016 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 533 transitions, 1076 flow [2024-11-09 06:58:59,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:59,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:59,017 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:59,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:58:59,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:58:59,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:59,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1256574315, now seen corresponding path program 1 times [2024-11-09 06:58:59,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051732049] [2024-11-09 06:58:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:59,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051732049] [2024-11-09 06:58:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051732049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:59,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:59,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402939009] [2024-11-09 06:58:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:59,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:59,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:59,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:59,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:59,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-09 06:58:59,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 533 transitions, 1076 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:59,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:59,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-09 06:58:59,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:59,177 INFO L124 PetriNetUnfolderBase]: 18/748 cut-off events. [2024-11-09 06:58:59,177 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-09 06:58:59,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 748 events. 18/748 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2600 event pairs, 5 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 708. Up to 22 conditions per place. [2024-11-09 06:58:59,185 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2024-11-09 06:58:59,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 532 transitions, 1100 flow [2024-11-09 06:58:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-09 06:58:59,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-09 06:58:59,195 INFO L175 Difference]: Start difference. First operand has 530 places, 533 transitions, 1076 flow. Second operand 3 states and 1664 transitions. [2024-11-09 06:58:59,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 532 transitions, 1100 flow [2024-11-09 06:58:59,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 532 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:59,207 INFO L231 Difference]: Finished difference. Result has 529 places, 532 transitions, 1074 flow [2024-11-09 06:58:59,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=529, PETRI_TRANSITIONS=532} [2024-11-09 06:58:59,209 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -16 predicate places. [2024-11-09 06:58:59,209 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 532 transitions, 1074 flow [2024-11-09 06:58:59,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:59,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:59,210 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-11-09 06:58:59,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:58:59,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:58:59,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1445982715, now seen corresponding path program 1 times [2024-11-09 06:58:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271193675] [2024-11-09 06:58:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:59,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:59,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271193675] [2024-11-09 06:58:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271193675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:59,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:59,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:59,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60449768] [2024-11-09 06:58:59,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:59,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:59,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:59,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:59,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:59,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-09 06:58:59,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 532 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:59,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:59,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-09 06:58:59,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:59,390 INFO L124 PetriNetUnfolderBase]: 18/645 cut-off events. [2024-11-09 06:58:59,390 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-09 06:58:59,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 645 events. 18/645 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1998 event pairs, 7 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 560. Up to 25 conditions per place. [2024-11-09 06:58:59,396 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2024-11-09 06:58:59,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 531 transitions, 1098 flow [2024-11-09 06:58:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-09 06:58:59,400 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-09 06:58:59,400 INFO L175 Difference]: Start difference. First operand has 529 places, 532 transitions, 1074 flow. Second operand 3 states and 1664 transitions. [2024-11-09 06:58:59,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 531 transitions, 1098 flow [2024-11-09 06:58:59,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 531 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:59,408 INFO L231 Difference]: Finished difference. Result has 528 places, 531 transitions, 1072 flow [2024-11-09 06:58:59,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=528, PETRI_TRANSITIONS=531} [2024-11-09 06:58:59,409 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -17 predicate places. [2024-11-09 06:58:59,410 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 531 transitions, 1072 flow [2024-11-09 06:58:59,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:59,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:59,411 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:59,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:58:59,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:58:59,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash -464666885, now seen corresponding path program 1 times [2024-11-09 06:58:59,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:59,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252188703] [2024-11-09 06:58:59,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:59,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:59,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:59,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252188703] [2024-11-09 06:58:59,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252188703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:59,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:59,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:59,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060837144] [2024-11-09 06:58:59,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:59,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:59,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:59,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:59,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-09 06:58:59,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 531 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:59,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:59,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-09 06:58:59,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:59,653 INFO L124 PetriNetUnfolderBase]: 28/1131 cut-off events. [2024-11-09 06:58:59,653 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:58:59,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 1131 events. 28/1131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5491 event pairs, 7 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1002. Up to 25 conditions per place. [2024-11-09 06:58:59,673 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2024-11-09 06:58:59,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 530 transitions, 1096 flow [2024-11-09 06:58:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-09 06:58:59,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-09 06:58:59,679 INFO L175 Difference]: Start difference. First operand has 528 places, 531 transitions, 1072 flow. Second operand 3 states and 1664 transitions. [2024-11-09 06:58:59,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 530 transitions, 1096 flow [2024-11-09 06:58:59,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 530 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:59,690 INFO L231 Difference]: Finished difference. Result has 527 places, 530 transitions, 1070 flow [2024-11-09 06:58:59,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=527, PETRI_TRANSITIONS=530} [2024-11-09 06:58:59,692 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2024-11-09 06:58:59,692 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 530 transitions, 1070 flow [2024-11-09 06:58:59,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:59,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:59,694 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] [2024-11-09 06:58:59,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:58:59,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:58:59,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:59,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1972077386, now seen corresponding path program 1 times [2024-11-09 06:58:59,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:59,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345741456] [2024-11-09 06:58:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:59,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:59,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-11-09 06:58:59,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:59,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345741456] [2024-11-09 06:58:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345741456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:59,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536448686] [2024-11-09 06:58:59,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:59,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:59,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-09 06:58:59,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 530 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:59,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:59,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-09 06:58:59,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:59,957 INFO L124 PetriNetUnfolderBase]: 22/941 cut-off events. [2024-11-09 06:58:59,957 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2024-11-09 06:58:59,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 941 events. 22/941 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3551 event pairs, 5 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 799. Up to 22 conditions per place. [2024-11-09 06:58:59,971 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2024-11-09 06:58:59,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 529 transitions, 1094 flow [2024-11-09 06:58:59,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-09 06:58:59,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-09 06:58:59,975 INFO L175 Difference]: Start difference. First operand has 527 places, 530 transitions, 1070 flow. Second operand 3 states and 1664 transitions. [2024-11-09 06:58:59,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 529 transitions, 1094 flow [2024-11-09 06:58:59,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1090 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:59,984 INFO L231 Difference]: Finished difference. Result has 526 places, 529 transitions, 1068 flow [2024-11-09 06:58:59,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=526, PETRI_TRANSITIONS=529} [2024-11-09 06:58:59,985 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2024-11-09 06:58:59,985 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 529 transitions, 1068 flow [2024-11-09 06:58:59,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:59,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:59,987 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:59,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:58:59,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:58:59,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash -761241225, now seen corresponding path program 1 times [2024-11-09 06:58:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990134573] [2024-11-09 06:58:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:59,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:00,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:00,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990134573] [2024-11-09 06:59:00,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990134573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:00,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:00,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:00,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197852086] [2024-11-09 06:59:00,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:00,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:00,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:00,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:00,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:00,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-09 06:59:00,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 529 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:00,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:00,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-09 06:59:00,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:00,190 INFO L124 PetriNetUnfolderBase]: 24/906 cut-off events. [2024-11-09 06:59:00,190 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-11-09 06:59:00,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 906 events. 24/906 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3249 event pairs, 7 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 758. Up to 25 conditions per place. [2024-11-09 06:59:00,200 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2024-11-09 06:59:00,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 528 transitions, 1092 flow [2024-11-09 06:59:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-09 06:59:00,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-09 06:59:00,203 INFO L175 Difference]: Start difference. First operand has 526 places, 529 transitions, 1068 flow. Second operand 3 states and 1664 transitions. [2024-11-09 06:59:00,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 528 transitions, 1092 flow [2024-11-09 06:59:00,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 528 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:00,209 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1066 flow [2024-11-09 06:59:00,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2024-11-09 06:59:00,211 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2024-11-09 06:59:00,211 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1066 flow [2024-11-09 06:59:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:00,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:00,212 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:00,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:59:00,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1859492096, now seen corresponding path program 1 times [2024-11-09 06:59:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813275471] [2024-11-09 06:59:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813275471] [2024-11-09 06:59:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813275471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:00,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584223425] [2024-11-09 06:59:00,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:00,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:00,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:00,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-09 06:59:00,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:00,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:00,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-09 06:59:00,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:00,425 INFO L124 PetriNetUnfolderBase]: 45/1330 cut-off events. [2024-11-09 06:59:00,425 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:59:00,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1330 events. 45/1330 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7336 event pairs, 6 based on Foata normal form. 0/1148 useless extension candidates. Maximal degree in co-relation 1204. Up to 43 conditions per place. [2024-11-09 06:59:00,443 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2024-11-09 06:59:00,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 530 transitions, 1102 flow [2024-11-09 06:59:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2024-11-09 06:59:00,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468024900962083 [2024-11-09 06:59:00,446 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1066 flow. Second operand 3 states and 1673 transitions. [2024-11-09 06:59:00,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 530 transitions, 1102 flow [2024-11-09 06:59:00,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 530 transitions, 1098 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:00,456 INFO L231 Difference]: Finished difference. Result has 524 places, 528 transitions, 1072 flow [2024-11-09 06:59:00,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=524, PETRI_TRANSITIONS=528} [2024-11-09 06:59:00,458 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -21 predicate places. [2024-11-09 06:59:00,458 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 528 transitions, 1072 flow [2024-11-09 06:59:00,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:00,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:00,460 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:00,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:59:00,461 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:00,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash -731927162, now seen corresponding path program 1 times [2024-11-09 06:59:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:00,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333105528] [2024-11-09 06:59:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:00,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333105528] [2024-11-09 06:59:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333105528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:00,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:00,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104838884] [2024-11-09 06:59:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:00,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:00,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:00,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:00,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-09 06:59:00,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 528 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:00,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:00,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-09 06:59:00,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:00,675 INFO L124 PetriNetUnfolderBase]: 36/1203 cut-off events. [2024-11-09 06:59:00,676 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 06:59:00,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 1203 events. 36/1203 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5729 event pairs, 6 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 953. Up to 31 conditions per place. [2024-11-09 06:59:00,691 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2024-11-09 06:59:00,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 530 transitions, 1108 flow [2024-11-09 06:59:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2024-11-09 06:59:00,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468024900962083 [2024-11-09 06:59:00,695 INFO L175 Difference]: Start difference. First operand has 524 places, 528 transitions, 1072 flow. Second operand 3 states and 1673 transitions. [2024-11-09 06:59:00,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 530 transitions, 1108 flow [2024-11-09 06:59:00,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 530 transitions, 1108 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:00,704 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1082 flow [2024-11-09 06:59:00,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2024-11-09 06:59:00,705 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2024-11-09 06:59:00,705 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1082 flow [2024-11-09 06:59:00,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:00,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:00,707 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:00,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:59:00,707 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:00,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2007253713, now seen corresponding path program 1 times [2024-11-09 06:59:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:00,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791052569] [2024-11-09 06:59:00,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:00,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791052569] [2024-11-09 06:59:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791052569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:00,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:00,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:00,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270660812] [2024-11-09 06:59:00,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:00,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:00,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:00,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:00,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:00,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 589 [2024-11-09 06:59:00,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1082 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:00,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:00,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 589 [2024-11-09 06:59:00,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:00,967 INFO L124 PetriNetUnfolderBase]: 39/1108 cut-off events. [2024-11-09 06:59:00,967 INFO L125 PetriNetUnfolderBase]: For 2/14 co-relation queries the response was YES. [2024-11-09 06:59:00,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1108 events. 39/1108 cut-off events. For 2/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5604 event pairs, 12 based on Foata normal form. 1/971 useless extension candidates. Maximal degree in co-relation 891. Up to 38 conditions per place. [2024-11-09 06:59:00,985 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 15 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2024-11-09 06:59:00,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2024-11-09 06:59:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2024-11-09 06:59:00,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9422750424448217 [2024-11-09 06:59:00,989 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1082 flow. Second operand 3 states and 1665 transitions. [2024-11-09 06:59:00,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2024-11-09 06:59:00,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1120 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:00,997 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1084 flow [2024-11-09 06:59:00,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2024-11-09 06:59:00,999 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2024-11-09 06:59:00,999 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1084 flow [2024-11-09 06:59:01,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:01,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:01,000 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:01,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:59:01,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:01,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1969250575, now seen corresponding path program 1 times [2024-11-09 06:59:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:01,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367354320] [2024-11-09 06:59:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:01,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:01,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367354320] [2024-11-09 06:59:01,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367354320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:01,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:01,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:01,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753154885] [2024-11-09 06:59:01,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:01,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:01,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:01,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:01,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:01,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-09 06:59:01,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:01,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:01,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-09 06:59:01,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:01,388 INFO L124 PetriNetUnfolderBase]: 77/2149 cut-off events. [2024-11-09 06:59:01,388 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-09 06:59:01,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 2149 events. 77/2149 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 15002 event pairs, 16 based on Foata normal form. 0/1857 useless extension candidates. Maximal degree in co-relation 1651. Up to 66 conditions per place. [2024-11-09 06:59:01,412 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2024-11-09 06:59:01,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2024-11-09 06:59:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2024-11-09 06:59:01,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468024900962083 [2024-11-09 06:59:01,416 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1084 flow. Second operand 3 states and 1673 transitions. [2024-11-09 06:59:01,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2024-11-09 06:59:01,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 529 transitions, 1116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:01,424 INFO L231 Difference]: Finished difference. Result has 525 places, 527 transitions, 1090 flow [2024-11-09 06:59:01,425 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=525, PETRI_TRANSITIONS=527} [2024-11-09 06:59:01,425 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2024-11-09 06:59:01,425 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 527 transitions, 1090 flow [2024-11-09 06:59:01,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:01,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:01,427 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:01,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:59:01,427 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:01,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash 21472046, now seen corresponding path program 1 times [2024-11-09 06:59:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:01,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565382793] [2024-11-09 06:59:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:01,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:01,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:01,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565382793] [2024-11-09 06:59:01,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565382793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:01,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:01,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:01,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668427435] [2024-11-09 06:59:01,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:01,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:01,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:01,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:01,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:01,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-09 06:59:01,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 527 transitions, 1090 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:01,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:01,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-09 06:59:01,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:01,842 INFO L124 PetriNetUnfolderBase]: 77/1945 cut-off events. [2024-11-09 06:59:01,842 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2024-11-09 06:59:01,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 1945 events. 77/1945 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 12822 event pairs, 4 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 1564. Up to 69 conditions per place. [2024-11-09 06:59:01,863 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 16 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2024-11-09 06:59:01,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 532 transitions, 1141 flow [2024-11-09 06:59:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2024-11-09 06:59:01,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9485002829654782 [2024-11-09 06:59:01,866 INFO L175 Difference]: Start difference. First operand has 525 places, 527 transitions, 1090 flow. Second operand 3 states and 1676 transitions. [2024-11-09 06:59:01,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 532 transitions, 1141 flow [2024-11-09 06:59:01,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 532 transitions, 1141 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:01,873 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1100 flow [2024-11-09 06:59:01,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2024-11-09 06:59:01,874 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2024-11-09 06:59:01,874 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1100 flow [2024-11-09 06:59:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:01,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:01,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:01,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:59:01,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:01,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:01,876 INFO L85 PathProgramCache]: Analyzing trace with hash 665665593, now seen corresponding path program 1 times [2024-11-09 06:59:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:01,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108545341] [2024-11-09 06:59:01,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:01,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:01,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108545341] [2024-11-09 06:59:01,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108545341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:01,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:01,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:01,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607176051] [2024-11-09 06:59:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:01,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:01,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 547 out of 589 [2024-11-09 06:59:01,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:01,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:01,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 547 of 589 [2024-11-09 06:59:01,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:02,333 INFO L124 PetriNetUnfolderBase]: 90/2599 cut-off events. [2024-11-09 06:59:02,334 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-11-09 06:59:02,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 2599 events. 90/2599 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 17764 event pairs, 10 based on Foata normal form. 0/2265 useless extension candidates. Maximal degree in co-relation 2373. Up to 40 conditions per place. [2024-11-09 06:59:02,366 INFO L140 encePairwiseOnDemand]: 581/589 looper letters, 15 selfloop transitions, 5 changer transitions 0/529 dead transitions. [2024-11-09 06:59:02,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 529 transitions, 1146 flow [2024-11-09 06:59:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-09 06:59:02,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-09 06:59:02,369 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1100 flow. Second operand 3 states and 1664 transitions. [2024-11-09 06:59:02,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 529 transitions, 1146 flow [2024-11-09 06:59:02,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 529 transitions, 1146 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:02,376 INFO L231 Difference]: Finished difference. Result has 527 places, 527 transitions, 1126 flow [2024-11-09 06:59:02,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=527, PETRI_TRANSITIONS=527} [2024-11-09 06:59:02,377 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2024-11-09 06:59:02,377 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 527 transitions, 1126 flow [2024-11-09 06:59:02,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:02,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:02,379 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:02,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:59:02,379 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:02,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:02,379 INFO L85 PathProgramCache]: Analyzing trace with hash -852237650, now seen corresponding path program 1 times [2024-11-09 06:59:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:02,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311698394] [2024-11-09 06:59:02,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:02,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:02,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311698394] [2024-11-09 06:59:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311698394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:02,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:02,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777590030] [2024-11-09 06:59:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:02,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:02,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:02,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:02,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-09 06:59:02,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 527 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:02,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:02,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-09 06:59:02,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:02,715 INFO L124 PetriNetUnfolderBase]: 104/2074 cut-off events. [2024-11-09 06:59:02,715 INFO L125 PetriNetUnfolderBase]: For 31/63 co-relation queries the response was YES. [2024-11-09 06:59:02,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 2074 events. 104/2074 cut-off events. For 31/63 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13927 event pairs, 36 based on Foata normal form. 1/1806 useless extension candidates. Maximal degree in co-relation 1940. Up to 112 conditions per place. [2024-11-09 06:59:02,747 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 16 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2024-11-09 06:59:02,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 528 transitions, 1166 flow [2024-11-09 06:59:02,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2024-11-09 06:59:02,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411431805319751 [2024-11-09 06:59:02,751 INFO L175 Difference]: Start difference. First operand has 527 places, 527 transitions, 1126 flow. Second operand 3 states and 1663 transitions. [2024-11-09 06:59:02,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 528 transitions, 1166 flow [2024-11-09 06:59:02,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 528 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:02,757 INFO L231 Difference]: Finished difference. Result has 526 places, 526 transitions, 1118 flow [2024-11-09 06:59:02,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=526, PETRI_TRANSITIONS=526} [2024-11-09 06:59:02,758 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2024-11-09 06:59:02,758 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 526 transitions, 1118 flow [2024-11-09 06:59:02,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:02,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:02,760 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:02,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:59:02,760 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:02,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1010636245, now seen corresponding path program 1 times [2024-11-09 06:59:02,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:02,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655596605] [2024-11-09 06:59:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:02,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:02,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:02,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655596605] [2024-11-09 06:59:02,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655596605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:02,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:02,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:59:02,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535699940] [2024-11-09 06:59:02,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:02,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:59:02,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:02,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:59:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:59:02,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 589 [2024-11-09 06:59:02,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 526 transitions, 1118 flow. Second operand has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:02,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:02,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 589 [2024-11-09 06:59:02,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:03,328 INFO L124 PetriNetUnfolderBase]: 99/3208 cut-off events. [2024-11-09 06:59:03,329 INFO L125 PetriNetUnfolderBase]: For 9/43 co-relation queries the response was YES. [2024-11-09 06:59:03,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 3208 events. 99/3208 cut-off events. For 9/43 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 22079 event pairs, 15 based on Foata normal form. 4/2801 useless extension candidates. Maximal degree in co-relation 3059. Up to 50 conditions per place. [2024-11-09 06:59:03,357 INFO L140 encePairwiseOnDemand]: 584/589 looper letters, 27 selfloop transitions, 4 changer transitions 0/542 dead transitions. [2024-11-09 06:59:03,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 542 transitions, 1222 flow [2024-11-09 06:59:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:59:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:59:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2787 transitions. [2024-11-09 06:59:03,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9463497453310696 [2024-11-09 06:59:03,362 INFO L175 Difference]: Start difference. First operand has 526 places, 526 transitions, 1118 flow. Second operand 5 states and 2787 transitions. [2024-11-09 06:59:03,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 542 transitions, 1222 flow [2024-11-09 06:59:03,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 542 transitions, 1218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:03,369 INFO L231 Difference]: Finished difference. Result has 531 places, 528 transitions, 1139 flow [2024-11-09 06:59:03,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1139, PETRI_PLACES=531, PETRI_TRANSITIONS=528} [2024-11-09 06:59:03,371 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -14 predicate places. [2024-11-09 06:59:03,371 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 528 transitions, 1139 flow [2024-11-09 06:59:03,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:03,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:03,373 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:03,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:59:03,373 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:03,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:03,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2101153416, now seen corresponding path program 1 times [2024-11-09 06:59:03,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:03,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956409680] [2024-11-09 06:59:03,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:03,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956409680] [2024-11-09 06:59:03,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956409680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:03,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:03,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:03,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849367298] [2024-11-09 06:59:03,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:03,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:03,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:03,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:03,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 589 [2024-11-09 06:59:03,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 528 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:03,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:03,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 589 [2024-11-09 06:59:03,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:04,018 INFO L124 PetriNetUnfolderBase]: 142/4425 cut-off events. [2024-11-09 06:59:04,019 INFO L125 PetriNetUnfolderBase]: For 43/90 co-relation queries the response was YES. [2024-11-09 06:59:04,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4796 conditions, 4425 events. 142/4425 cut-off events. For 43/90 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 35259 event pairs, 28 based on Foata normal form. 7/3863 useless extension candidates. Maximal degree in co-relation 4377. Up to 95 conditions per place. [2024-11-09 06:59:04,074 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 17 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2024-11-09 06:59:04,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 529 transitions, 1181 flow [2024-11-09 06:59:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2024-11-09 06:59:04,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9422750424448217 [2024-11-09 06:59:04,078 INFO L175 Difference]: Start difference. First operand has 531 places, 528 transitions, 1139 flow. Second operand 3 states and 1665 transitions. [2024-11-09 06:59:04,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 529 transitions, 1181 flow [2024-11-09 06:59:04,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 529 transitions, 1181 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:04,085 INFO L231 Difference]: Finished difference. Result has 532 places, 527 transitions, 1141 flow [2024-11-09 06:59:04,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1141, PETRI_PLACES=532, PETRI_TRANSITIONS=527} [2024-11-09 06:59:04,086 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -13 predicate places. [2024-11-09 06:59:04,086 INFO L471 AbstractCegarLoop]: Abstraction has has 532 places, 527 transitions, 1141 flow [2024-11-09 06:59:04,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:04,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:04,088 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:04,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:59:04,088 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:04,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1312894679, now seen corresponding path program 1 times [2024-11-09 06:59:04,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231094748] [2024-11-09 06:59:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:04,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:04,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231094748] [2024-11-09 06:59:04,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231094748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:04,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:04,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:04,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597832046] [2024-11-09 06:59:04,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:04,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:59:04,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:04,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:59:04,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:59:04,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 589 [2024-11-09 06:59:04,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 527 transitions, 1141 flow. Second operand has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:04,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:04,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 589 [2024-11-09 06:59:04,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:04,537 INFO L124 PetriNetUnfolderBase]: 33/1365 cut-off events. [2024-11-09 06:59:04,537 INFO L125 PetriNetUnfolderBase]: For 11/25 co-relation queries the response was YES. [2024-11-09 06:59:04,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 1365 events. 33/1365 cut-off events. For 11/25 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6531 event pairs, 1 based on Foata normal form. 3/1218 useless extension candidates. Maximal degree in co-relation 1368. Up to 20 conditions per place. [2024-11-09 06:59:04,556 INFO L140 encePairwiseOnDemand]: 568/589 looper letters, 18 selfloop transitions, 18 changer transitions 0/530 dead transitions. [2024-11-09 06:59:04,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 530 transitions, 1219 flow [2024-11-09 06:59:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:59:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:59:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2699 transitions. [2024-11-09 06:59:04,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9164685908319186 [2024-11-09 06:59:04,560 INFO L175 Difference]: Start difference. First operand has 532 places, 527 transitions, 1141 flow. Second operand 5 states and 2699 transitions. [2024-11-09 06:59:04,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 530 transitions, 1219 flow [2024-11-09 06:59:04,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 530 transitions, 1215 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:04,567 INFO L231 Difference]: Finished difference. Result has 535 places, 530 transitions, 1197 flow [2024-11-09 06:59:04,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1197, PETRI_PLACES=535, PETRI_TRANSITIONS=530} [2024-11-09 06:59:04,568 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -10 predicate places. [2024-11-09 06:59:04,568 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 530 transitions, 1197 flow [2024-11-09 06:59:04,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:04,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:04,569 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:04,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:59:04,569 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:04,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash 386569357, now seen corresponding path program 1 times [2024-11-09 06:59:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469465819] [2024-11-09 06:59:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:04,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469465819] [2024-11-09 06:59:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469465819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25799065] [2024-11-09 06:59:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:04,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:04,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:59:04,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:04,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:59:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:04,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:59:04,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:05,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25799065] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:05,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:59:05,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-09 06:59:05,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978278531] [2024-11-09 06:59:05,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:59:05,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 06:59:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 06:59:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:59:05,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 589 [2024-11-09 06:59:05,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 530 transitions, 1197 flow. Second operand has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:05,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:05,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 589 [2024-11-09 06:59:05,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:06,080 INFO L124 PetriNetUnfolderBase]: 33/1416 cut-off events. [2024-11-09 06:59:06,080 INFO L125 PetriNetUnfolderBase]: For 23/37 co-relation queries the response was YES. [2024-11-09 06:59:06,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1416 events. 33/1416 cut-off events. For 23/37 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6420 event pairs, 1 based on Foata normal form. 6/1272 useless extension candidates. Maximal degree in co-relation 1480. Up to 20 conditions per place. [2024-11-09 06:59:06,105 INFO L140 encePairwiseOnDemand]: 559/589 looper letters, 30 selfloop transitions, 39 changer transitions 0/554 dead transitions. [2024-11-09 06:59:06,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 554 transitions, 1389 flow [2024-11-09 06:59:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:59:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 06:59:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5828 transitions. [2024-11-09 06:59:06,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8995215311004785 [2024-11-09 06:59:06,114 INFO L175 Difference]: Start difference. First operand has 535 places, 530 transitions, 1197 flow. Second operand 11 states and 5828 transitions. [2024-11-09 06:59:06,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 554 transitions, 1389 flow [2024-11-09 06:59:06,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 554 transitions, 1359 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 06:59:06,123 INFO L231 Difference]: Finished difference. Result has 545 places, 548 transitions, 1347 flow [2024-11-09 06:59:06,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1347, PETRI_PLACES=545, PETRI_TRANSITIONS=548} [2024-11-09 06:59:06,124 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 0 predicate places. [2024-11-09 06:59:06,124 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 548 transitions, 1347 flow [2024-11-09 06:59:06,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:06,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:06,127 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:06,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:59:06,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 06:59:06,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:06,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash 58646157, now seen corresponding path program 2 times [2024-11-09 06:59:06,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123201283] [2024-11-09 06:59:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 06:59:07,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:07,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123201283] [2024-11-09 06:59:07,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123201283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:07,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96087143] [2024-11-09 06:59:07,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:59:07,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:07,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:59:07,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:07,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:59:07,188 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 06:59:07,188 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:59:07,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:59:07,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:07,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 06:59:07,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 06:59:07,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:07,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 06:59:07,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:07,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-09 06:59:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 06:59:07,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:59:07,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96087143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:07,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:59:07,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-09 06:59:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409736247] [2024-11-09 06:59:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:07,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:59:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:07,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:59:07,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:59:07,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-09 06:59:07,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 548 transitions, 1347 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:07,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:07,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-09 06:59:07,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:08,611 INFO L124 PetriNetUnfolderBase]: 77/2316 cut-off events. [2024-11-09 06:59:08,611 INFO L125 PetriNetUnfolderBase]: For 50/92 co-relation queries the response was YES. [2024-11-09 06:59:08,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2316 events. 77/2316 cut-off events. For 50/92 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14073 event pairs, 5 based on Foata normal form. 8/2072 useless extension candidates. Maximal degree in co-relation 2564. Up to 70 conditions per place. [2024-11-09 06:59:08,669 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 30 selfloop transitions, 6 changer transitions 0/555 dead transitions. [2024-11-09 06:59:08,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 555 transitions, 1441 flow [2024-11-09 06:59:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2024-11-09 06:59:08,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9219015280135824 [2024-11-09 06:59:08,677 INFO L175 Difference]: Start difference. First operand has 545 places, 548 transitions, 1347 flow. Second operand 6 states and 3258 transitions. [2024-11-09 06:59:08,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 555 transitions, 1441 flow [2024-11-09 06:59:08,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 555 transitions, 1405 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-09 06:59:08,690 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1321 flow [2024-11-09 06:59:08,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1321, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2024-11-09 06:59:08,691 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2024-11-09 06:59:08,691 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1321 flow [2024-11-09 06:59:08,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:08,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:08,694 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:08,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:59:08,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:08,895 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:08,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash 465710012, now seen corresponding path program 1 times [2024-11-09 06:59:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887467672] [2024-11-09 06:59:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 06:59:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:09,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887467672] [2024-11-09 06:59:09,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887467672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769314649] [2024-11-09 06:59:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:09,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:09,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:09,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-09 06:59:09,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:09,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:09,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-09 06:59:09,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:09,643 INFO L124 PetriNetUnfolderBase]: 145/2185 cut-off events. [2024-11-09 06:59:09,643 INFO L125 PetriNetUnfolderBase]: For 121/165 co-relation queries the response was YES. [2024-11-09 06:59:09,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 2185 events. 145/2185 cut-off events. For 121/165 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 14531 event pairs, 61 based on Foata normal form. 1/1889 useless extension candidates. Maximal degree in co-relation 2262. Up to 187 conditions per place. [2024-11-09 06:59:09,688 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 16 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2024-11-09 06:59:09,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1361 flow [2024-11-09 06:59:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2024-11-09 06:59:09,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411431805319751 [2024-11-09 06:59:09,691 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1321 flow. Second operand 3 states and 1663 transitions. [2024-11-09 06:59:09,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1361 flow [2024-11-09 06:59:09,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 548 transitions, 1349 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:59:09,702 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1311 flow [2024-11-09 06:59:09,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2024-11-09 06:59:09,703 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2024-11-09 06:59:09,703 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1311 flow [2024-11-09 06:59:09,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:09,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:09,705 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:09,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:59:09,705 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:09,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash 694514784, now seen corresponding path program 1 times [2024-11-09 06:59:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:09,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492045696] [2024-11-09 06:59:09,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 06:59:09,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:09,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492045696] [2024-11-09 06:59:09,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492045696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:09,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:09,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358749576] [2024-11-09 06:59:09,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:09,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:09,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:09,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 589 [2024-11-09 06:59:09,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:09,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:09,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 589 [2024-11-09 06:59:09,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:10,567 INFO L124 PetriNetUnfolderBase]: 154/3695 cut-off events. [2024-11-09 06:59:10,567 INFO L125 PetriNetUnfolderBase]: For 47/115 co-relation queries the response was YES. [2024-11-09 06:59:10,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4180 conditions, 3695 events. 154/3695 cut-off events. For 47/115 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 27416 event pairs, 25 based on Foata normal form. 1/3273 useless extension candidates. Maximal degree in co-relation 3851. Up to 110 conditions per place. [2024-11-09 06:59:10,612 INFO L140 encePairwiseOnDemand]: 580/589 looper letters, 17 selfloop transitions, 5 changer transitions 0/547 dead transitions. [2024-11-09 06:59:10,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 547 transitions, 1359 flow [2024-11-09 06:59:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1658 transitions. [2024-11-09 06:59:10,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9383135257498585 [2024-11-09 06:59:10,616 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1311 flow. Second operand 3 states and 1658 transitions. [2024-11-09 06:59:10,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 547 transitions, 1359 flow [2024-11-09 06:59:10,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 547 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:10,623 INFO L231 Difference]: Finished difference. Result has 540 places, 545 transitions, 1331 flow [2024-11-09 06:59:10,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=540, PETRI_TRANSITIONS=545} [2024-11-09 06:59:10,624 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -5 predicate places. [2024-11-09 06:59:10,624 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 545 transitions, 1331 flow [2024-11-09 06:59:10,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:10,625 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:10,625 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:10,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:59:10,625 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:10,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash 524426800, now seen corresponding path program 1 times [2024-11-09 06:59:10,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:10,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988353908] [2024-11-09 06:59:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 06:59:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:10,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988353908] [2024-11-09 06:59:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988353908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:10,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569548848] [2024-11-09 06:59:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:10,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:10,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:10,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:10,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:10,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-09 06:59:10,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 545 transitions, 1331 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:10,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:10,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-09 06:59:10,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:11,368 INFO L124 PetriNetUnfolderBase]: 136/3757 cut-off events. [2024-11-09 06:59:11,369 INFO L125 PetriNetUnfolderBase]: For 76/112 co-relation queries the response was YES. [2024-11-09 06:59:11,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 3757 events. 136/3757 cut-off events. For 76/112 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 28116 event pairs, 30 based on Foata normal form. 1/3336 useless extension candidates. Maximal degree in co-relation 3883. Up to 141 conditions per place. [2024-11-09 06:59:11,426 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 16 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-09 06:59:11,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 550 transitions, 1382 flow [2024-11-09 06:59:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2024-11-09 06:59:11,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9485002829654782 [2024-11-09 06:59:11,429 INFO L175 Difference]: Start difference. First operand has 540 places, 545 transitions, 1331 flow. Second operand 3 states and 1676 transitions. [2024-11-09 06:59:11,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 550 transitions, 1382 flow [2024-11-09 06:59:11,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 550 transitions, 1372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:11,437 INFO L231 Difference]: Finished difference. Result has 539 places, 545 transitions, 1331 flow [2024-11-09 06:59:11,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=539, PETRI_TRANSITIONS=545} [2024-11-09 06:59:11,438 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2024-11-09 06:59:11,438 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 545 transitions, 1331 flow [2024-11-09 06:59:11,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:11,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:11,439 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:11,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:59:11,439 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:11,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1463529398, now seen corresponding path program 1 times [2024-11-09 06:59:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:11,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136657660] [2024-11-09 06:59:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 06:59:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136657660] [2024-11-09 06:59:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136657660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:11,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:11,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:59:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090201764] [2024-11-09 06:59:11,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:11,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:59:11,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:11,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:59:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:59:11,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 589 [2024-11-09 06:59:11,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 545 transitions, 1331 flow. Second operand has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:11,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:11,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 589 [2024-11-09 06:59:11,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:12,872 INFO L124 PetriNetUnfolderBase]: 244/6510 cut-off events. [2024-11-09 06:59:12,873 INFO L125 PetriNetUnfolderBase]: For 89/254 co-relation queries the response was YES. [2024-11-09 06:59:12,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 6510 events. 244/6510 cut-off events. For 89/254 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56550 event pairs, 58 based on Foata normal form. 6/5735 useless extension candidates. Maximal degree in co-relation 6989. Up to 155 conditions per place. [2024-11-09 06:59:12,931 INFO L140 encePairwiseOnDemand]: 584/589 looper letters, 25 selfloop transitions, 4 changer transitions 0/559 dead transitions. [2024-11-09 06:59:12,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 559 transitions, 1425 flow [2024-11-09 06:59:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:59:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:59:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2785 transitions. [2024-11-09 06:59:12,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456706281833617 [2024-11-09 06:59:12,935 INFO L175 Difference]: Start difference. First operand has 539 places, 545 transitions, 1331 flow. Second operand 5 states and 2785 transitions. [2024-11-09 06:59:12,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 559 transitions, 1425 flow [2024-11-09 06:59:12,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 559 transitions, 1425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:12,942 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1356 flow [2024-11-09 06:59:12,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1356, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2024-11-09 06:59:12,943 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2024-11-09 06:59:12,943 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1356 flow [2024-11-09 06:59:12,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:12,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:12,944 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:12,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:59:12,944 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:12,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash -662526951, now seen corresponding path program 1 times [2024-11-09 06:59:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:12,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397799716] [2024-11-09 06:59:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 06:59:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397799716] [2024-11-09 06:59:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397799716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:13,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:13,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739648867] [2024-11-09 06:59:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:13,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:13,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-09 06:59:13,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1356 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:13,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:13,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-09 06:59:13,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:14,851 INFO L124 PetriNetUnfolderBase]: 386/9202 cut-off events. [2024-11-09 06:59:14,851 INFO L125 PetriNetUnfolderBase]: For 237/455 co-relation queries the response was YES. [2024-11-09 06:59:15,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10421 conditions, 9202 events. 386/9202 cut-off events. For 237/455 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 92101 event pairs, 113 based on Foata normal form. 6/8092 useless extension candidates. Maximal degree in co-relation 10088. Up to 310 conditions per place. [2024-11-09 06:59:15,338 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 18 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2024-11-09 06:59:15,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1400 flow [2024-11-09 06:59:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2024-11-09 06:59:15,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411431805319751 [2024-11-09 06:59:15,340 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1356 flow. Second operand 3 states and 1663 transitions. [2024-11-09 06:59:15,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1400 flow [2024-11-09 06:59:15,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 548 transitions, 1400 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:15,347 INFO L231 Difference]: Finished difference. Result has 547 places, 546 transitions, 1358 flow [2024-11-09 06:59:15,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=547, PETRI_TRANSITIONS=546} [2024-11-09 06:59:15,348 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 2 predicate places. [2024-11-09 06:59:15,348 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 546 transitions, 1358 flow [2024-11-09 06:59:15,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:15,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:15,349 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:15,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 06:59:15,349 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:15,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1543446152, now seen corresponding path program 1 times [2024-11-09 06:59:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:15,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613079007] [2024-11-09 06:59:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 06:59:15,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:15,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613079007] [2024-11-09 06:59:15,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613079007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:15,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305086113] [2024-11-09 06:59:15,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:15,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:15,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:59:15,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:15,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:59:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:15,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 06:59:15,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 06:59:16,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 06:59:16,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305086113] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:16,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:59:16,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2024-11-09 06:59:16,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258731509] [2024-11-09 06:59:16,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:59:16,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 06:59:16,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 06:59:16,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-11-09 06:59:16,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 589 [2024-11-09 06:59:16,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 546 transitions, 1358 flow. Second operand has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:16,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:16,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 589 [2024-11-09 06:59:16,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:17,590 INFO L124 PetriNetUnfolderBase]: 50/2302 cut-off events. [2024-11-09 06:59:17,590 INFO L125 PetriNetUnfolderBase]: For 84/116 co-relation queries the response was YES. [2024-11-09 06:59:17,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 2302 events. 50/2302 cut-off events. For 84/116 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13159 event pairs, 4 based on Foata normal form. 6/2101 useless extension candidates. Maximal degree in co-relation 2482. Up to 37 conditions per place. [2024-11-09 06:59:17,629 INFO L140 encePairwiseOnDemand]: 559/589 looper letters, 36 selfloop transitions, 57 changer transitions 0/576 dead transitions. [2024-11-09 06:59:17,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 576 transitions, 1688 flow [2024-11-09 06:59:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:59:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-09 06:59:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 8990 transitions. [2024-11-09 06:59:17,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8978328173374613 [2024-11-09 06:59:17,637 INFO L175 Difference]: Start difference. First operand has 547 places, 546 transitions, 1358 flow. Second operand 17 states and 8990 transitions. [2024-11-09 06:59:17,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 576 transitions, 1688 flow [2024-11-09 06:59:17,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 576 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:17,646 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1630 flow [2024-11-09 06:59:17,646 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1630, PETRI_PLACES=564, PETRI_TRANSITIONS=567} [2024-11-09 06:59:17,647 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 19 predicate places. [2024-11-09 06:59:17,647 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1630 flow [2024-11-09 06:59:17,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:17,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:17,649 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:17,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:59:17,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:17,850 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:17,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 577215352, now seen corresponding path program 2 times [2024-11-09 06:59:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015489873] [2024-11-09 06:59:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:20,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015489873] [2024-11-09 06:59:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015489873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:20,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:20,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:20,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473180383] [2024-11-09 06:59:20,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:20,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:59:20,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:20,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:59:20,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:59:21,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-09 06:59:21,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1630 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:21,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:21,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-09 06:59:21,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:22,332 INFO L124 PetriNetUnfolderBase]: 200/4564 cut-off events. [2024-11-09 06:59:22,332 INFO L125 PetriNetUnfolderBase]: For 219/444 co-relation queries the response was YES. [2024-11-09 06:59:22,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5524 conditions, 4564 events. 200/4564 cut-off events. For 219/444 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 34934 event pairs, 18 based on Foata normal form. 17/4114 useless extension candidates. Maximal degree in co-relation 5209. Up to 147 conditions per place. [2024-11-09 06:59:22,389 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 30 selfloop transitions, 6 changer transitions 0/574 dead transitions. [2024-11-09 06:59:22,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 574 transitions, 1724 flow [2024-11-09 06:59:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2024-11-09 06:59:22,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9219015280135824 [2024-11-09 06:59:22,392 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1630 flow. Second operand 6 states and 3258 transitions. [2024-11-09 06:59:22,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 574 transitions, 1724 flow [2024-11-09 06:59:22,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 574 transitions, 1646 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-09 06:59:22,400 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1562 flow [2024-11-09 06:59:22,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=560, PETRI_TRANSITIONS=566} [2024-11-09 06:59:22,401 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 15 predicate places. [2024-11-09 06:59:22,401 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1562 flow [2024-11-09 06:59:22,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:22,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:22,402 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:22,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 06:59:22,403 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:22,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1951064292, now seen corresponding path program 1 times [2024-11-09 06:59:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:22,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228471400] [2024-11-09 06:59:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228471400] [2024-11-09 06:59:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228471400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:22,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:22,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:22,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895344682] [2024-11-09 06:59:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:22,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:22,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:22,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 589 [2024-11-09 06:59:22,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 566 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:22,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:22,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 589 [2024-11-09 06:59:22,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:23,856 INFO L124 PetriNetUnfolderBase]: 235/4728 cut-off events. [2024-11-09 06:59:23,856 INFO L125 PetriNetUnfolderBase]: For 255/339 co-relation queries the response was YES. [2024-11-09 06:59:23,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5621 conditions, 4728 events. 235/4728 cut-off events. For 255/339 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 39057 event pairs, 56 based on Foata normal form. 14/4236 useless extension candidates. Maximal degree in co-relation 5108. Up to 240 conditions per place. [2024-11-09 06:59:23,928 INFO L140 encePairwiseOnDemand]: 580/589 looper letters, 13 selfloop transitions, 4 changer transitions 18/567 dead transitions. [2024-11-09 06:59:23,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 567 transitions, 1608 flow [2024-11-09 06:59:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1657 transitions. [2024-11-09 06:59:23,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9377475947934352 [2024-11-09 06:59:23,931 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1562 flow. Second operand 3 states and 1657 transitions. [2024-11-09 06:59:23,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 567 transitions, 1608 flow [2024-11-09 06:59:23,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 567 transitions, 1596 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:59:23,942 INFO L231 Difference]: Finished difference. Result has 555 places, 547 transitions, 1529 flow [2024-11-09 06:59:23,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=555, PETRI_TRANSITIONS=547} [2024-11-09 06:59:23,943 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 10 predicate places. [2024-11-09 06:59:23,943 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 547 transitions, 1529 flow [2024-11-09 06:59:23,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:23,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:23,944 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:23,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 06:59:23,944 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:23,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:23,945 INFO L85 PathProgramCache]: Analyzing trace with hash 926838452, now seen corresponding path program 1 times [2024-11-09 06:59:23,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:23,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196523676] [2024-11-09 06:59:23,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:24,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196523676] [2024-11-09 06:59:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196523676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:24,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:24,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:24,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027397976] [2024-11-09 06:59:24,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:24,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:59:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:24,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:59:24,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:59:25,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-09 06:59:25,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 547 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:25,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:25,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-09 06:59:25,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:26,183 INFO L124 PetriNetUnfolderBase]: 124/3943 cut-off events. [2024-11-09 06:59:26,183 INFO L125 PetriNetUnfolderBase]: For 193/293 co-relation queries the response was YES. [2024-11-09 06:59:26,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 3943 events. 124/3943 cut-off events. For 193/293 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 27071 event pairs, 15 based on Foata normal form. 16/3623 useless extension candidates. Maximal degree in co-relation 4718. Up to 107 conditions per place. [2024-11-09 06:59:26,266 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2024-11-09 06:59:26,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 554 transitions, 1621 flow [2024-11-09 06:59:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2024-11-09 06:59:26,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216185625353707 [2024-11-09 06:59:26,269 INFO L175 Difference]: Start difference. First operand has 555 places, 547 transitions, 1529 flow. Second operand 6 states and 3257 transitions. [2024-11-09 06:59:26,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 554 transitions, 1621 flow [2024-11-09 06:59:26,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 554 transitions, 1613 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:26,279 INFO L231 Difference]: Finished difference. Result has 539 places, 546 transitions, 1531 flow [2024-11-09 06:59:26,279 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=539, PETRI_TRANSITIONS=546} [2024-11-09 06:59:26,280 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2024-11-09 06:59:26,280 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 546 transitions, 1531 flow [2024-11-09 06:59:26,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:26,281 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:26,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 06:59:26,281 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:26,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:26,282 INFO L85 PathProgramCache]: Analyzing trace with hash 653220187, now seen corresponding path program 1 times [2024-11-09 06:59:26,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:26,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716665545] [2024-11-09 06:59:26,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:26,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716665545] [2024-11-09 06:59:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716665545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:26,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:26,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999692543] [2024-11-09 06:59:26,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:26,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:26,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:26,426 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-09 06:59:26,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 546 transitions, 1531 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:26,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-09 06:59:26,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:29,834 INFO L124 PetriNetUnfolderBase]: 497/10763 cut-off events. [2024-11-09 06:59:29,835 INFO L125 PetriNetUnfolderBase]: For 245/255 co-relation queries the response was YES. [2024-11-09 06:59:29,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 10763 events. 497/10763 cut-off events. For 245/255 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 112234 event pairs, 162 based on Foata normal form. 0/9765 useless extension candidates. Maximal degree in co-relation 11900. Up to 618 conditions per place. [2024-11-09 06:59:29,924 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2024-11-09 06:59:29,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 549 transitions, 1570 flow [2024-11-09 06:59:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2024-11-09 06:59:29,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468024900962083 [2024-11-09 06:59:29,926 INFO L175 Difference]: Start difference. First operand has 539 places, 546 transitions, 1531 flow. Second operand 3 states and 1673 transitions. [2024-11-09 06:59:29,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 549 transitions, 1570 flow [2024-11-09 06:59:29,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 549 transitions, 1558 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:59:29,934 INFO L231 Difference]: Finished difference. Result has 535 places, 546 transitions, 1529 flow [2024-11-09 06:59:29,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=535, PETRI_TRANSITIONS=546} [2024-11-09 06:59:29,936 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -10 predicate places. [2024-11-09 06:59:29,936 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 546 transitions, 1529 flow [2024-11-09 06:59:29,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:29,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:29,937 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:29,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 06:59:29,937 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:29,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash 395073562, now seen corresponding path program 1 times [2024-11-09 06:59:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:29,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757924730] [2024-11-09 06:59:29,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:30,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757924730] [2024-11-09 06:59:30,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757924730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:30,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:30,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:59:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804278146] [2024-11-09 06:59:30,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:30,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:59:30,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:30,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:59:30,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:59:30,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 589 [2024-11-09 06:59:30,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 546 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:30,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:30,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 589 [2024-11-09 06:59:30,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:32,280 INFO L124 PetriNetUnfolderBase]: 373/7895 cut-off events. [2024-11-09 06:59:32,280 INFO L125 PetriNetUnfolderBase]: For 359/421 co-relation queries the response was YES. [2024-11-09 06:59:32,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9567 conditions, 7895 events. 373/7895 cut-off events. For 359/421 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 79620 event pairs, 146 based on Foata normal form. 4/7091 useless extension candidates. Maximal degree in co-relation 9053. Up to 444 conditions per place. [2024-11-09 06:59:32,698 INFO L140 encePairwiseOnDemand]: 584/589 looper letters, 20 selfloop transitions, 4 changer transitions 0/556 dead transitions. [2024-11-09 06:59:32,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 556 transitions, 1601 flow [2024-11-09 06:59:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:59:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:59:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2780 transitions. [2024-11-09 06:59:32,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9439728353140917 [2024-11-09 06:59:32,701 INFO L175 Difference]: Start difference. First operand has 535 places, 546 transitions, 1529 flow. Second operand 5 states and 2780 transitions. [2024-11-09 06:59:32,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 556 transitions, 1601 flow [2024-11-09 06:59:32,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 556 transitions, 1601 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:32,715 INFO L231 Difference]: Finished difference. Result has 542 places, 548 transitions, 1554 flow [2024-11-09 06:59:32,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=548} [2024-11-09 06:59:32,716 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2024-11-09 06:59:32,717 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 548 transitions, 1554 flow [2024-11-09 06:59:32,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:32,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:32,718 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:32,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 06:59:32,718 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:32,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:32,719 INFO L85 PathProgramCache]: Analyzing trace with hash -951398275, now seen corresponding path program 1 times [2024-11-09 06:59:32,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:32,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204108675] [2024-11-09 06:59:32,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:32,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204108675] [2024-11-09 06:59:32,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204108675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:32,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:32,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:32,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768806769] [2024-11-09 06:59:32,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:32,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:32,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:32,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:32,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:32,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-09 06:59:32,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 548 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:32,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:32,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-09 06:59:32,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:35,020 INFO L124 PetriNetUnfolderBase]: 534/7743 cut-off events. [2024-11-09 06:59:35,020 INFO L125 PetriNetUnfolderBase]: For 830/900 co-relation queries the response was YES. [2024-11-09 06:59:35,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10197 conditions, 7743 events. 534/7743 cut-off events. For 830/900 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 80196 event pairs, 275 based on Foata normal form. 2/7077 useless extension candidates. Maximal degree in co-relation 9680. Up to 783 conditions per place. [2024-11-09 06:59:35,096 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 14 selfloop transitions, 2 changer transitions 1/549 dead transitions. [2024-11-09 06:59:35,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 549 transitions, 1592 flow [2024-11-09 06:59:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2024-11-09 06:59:35,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394453876627051 [2024-11-09 06:59:35,189 INFO L175 Difference]: Start difference. First operand has 542 places, 548 transitions, 1554 flow. Second operand 3 states and 1660 transitions. [2024-11-09 06:59:35,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 549 transitions, 1592 flow [2024-11-09 06:59:35,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 549 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:35,199 INFO L231 Difference]: Finished difference. Result has 543 places, 547 transitions, 1556 flow [2024-11-09 06:59:35,200 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=543, PETRI_TRANSITIONS=547} [2024-11-09 06:59:35,200 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2024-11-09 06:59:35,200 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 547 transitions, 1556 flow [2024-11-09 06:59:35,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:35,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:35,201 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:35,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 06:59:35,201 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:35,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1832317476, now seen corresponding path program 1 times [2024-11-09 06:59:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658254073] [2024-11-09 06:59:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658254073] [2024-11-09 06:59:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658254073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:36,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267919149] [2024-11-09 06:59:36,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:36,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:59:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:36,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:59:36,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:59:36,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-09 06:59:36,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 547 transitions, 1556 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:36,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:36,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-09 06:59:36,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:39,547 INFO L124 PetriNetUnfolderBase]: 363/7609 cut-off events. [2024-11-09 06:59:39,548 INFO L125 PetriNetUnfolderBase]: For 673/763 co-relation queries the response was YES. [2024-11-09 06:59:39,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9897 conditions, 7609 events. 363/7609 cut-off events. For 673/763 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 75622 event pairs, 64 based on Foata normal form. 8/7100 useless extension candidates. Maximal degree in co-relation 9317. Up to 224 conditions per place. [2024-11-09 06:59:39,781 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2024-11-09 06:59:39,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 554 transitions, 1648 flow [2024-11-09 06:59:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2024-11-09 06:59:39,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216185625353707 [2024-11-09 06:59:39,785 INFO L175 Difference]: Start difference. First operand has 543 places, 547 transitions, 1556 flow. Second operand 6 states and 3257 transitions. [2024-11-09 06:59:39,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 554 transitions, 1648 flow [2024-11-09 06:59:39,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 554 transitions, 1644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:39,799 INFO L231 Difference]: Finished difference. Result has 545 places, 546 transitions, 1562 flow [2024-11-09 06:59:39,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=545, PETRI_TRANSITIONS=546} [2024-11-09 06:59:39,801 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 0 predicate places. [2024-11-09 06:59:39,801 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 546 transitions, 1562 flow [2024-11-09 06:59:39,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:39,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:39,806 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:39,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 06:59:39,807 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:39,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash 859933343, now seen corresponding path program 1 times [2024-11-09 06:59:39,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:39,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072837366] [2024-11-09 06:59:39,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:41,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072837366] [2024-11-09 06:59:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072837366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:41,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:41,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408503024] [2024-11-09 06:59:41,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:41,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:59:41,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:59:41,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:59:41,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-09 06:59:41,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 546 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:41,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:41,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-09 06:59:41,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:44,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1479] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_23|)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][381], [620#true, Black: 640#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 4860#true, Black: 4865#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork2_~stop~2#1| 256) 0))), 595#(= |#race~isNull_1~0| 0), 260#L104-1true, Black: 593#true, Black: 2899#true, Black: 597#true, 4880#(= (select (select |#race| ~o_4~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~o_4~0.offset)) 0), Black: 2904#true, 2908#true, Black: 604#true, 4862#(= |thread3Thread1of1ForFork2_~i~2#1| 0), 2906#(= |#race~o_2~0| 0), 281#L82-9true, Black: 2910#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 608#true, Black: 2913#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork1_~stop~1#1| 256) 0))), 4877#(and (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2 ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~o_2~0.offset)) 0)), Black: 4809#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4829#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 4835#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 606#(= |#race~isNull_5~0| 0), Black: 614#(= |#race~result_7~0| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 234#L68-12true, Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4847#(= |#race~result_13~0| 0), 610#(= |#race~o_0~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), 599#(= |#race~isNull_3~0| 0), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 4856#true, 4858#(= |#race~o_4~0| 0)]) [2024-11-09 06:59:44,022 INFO L294 olderBase$Statistics]: this new event has 684 ancestors and is cut-off event [2024-11-09 06:59:44,022 INFO L297 olderBase$Statistics]: existing Event has 578 ancestors and is cut-off event [2024-11-09 06:59:44,022 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2024-11-09 06:59:44,023 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2024-11-09 06:59:44,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1479] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_23|)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][381], [Black: 640#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 4860#true, Black: 4865#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork2_~stop~2#1| 256) 0))), 595#(= |#race~isNull_1~0| 0), 260#L104-1true, Black: 593#true, Black: 2899#true, Black: 597#true, Black: 2904#true, 4880#(= (select (select |#race| ~o_4~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~o_4~0.offset)) 0), 2908#true, 4862#(= |thread3Thread1of1ForFork2_~i~2#1| 0), 2906#(= |#race~o_2~0| 0), Black: 604#true, 281#L82-9true, 623#(not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0)), Black: 2910#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 2913#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork1_~stop~1#1| 256) 0))), 4877#(and (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2 ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~o_2~0.offset)) 0)), Black: 608#true, Black: 4809#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4829#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), 606#(= |#race~isNull_5~0| 0), Black: 4835#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 614#(= |#race~result_7~0| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 234#L68-12true, Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4847#(= |#race~result_13~0| 0), Black: 620#true, 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 4856#true, 4858#(= |#race~o_4~0| 0)]) [2024-11-09 06:59:44,026 INFO L294 olderBase$Statistics]: this new event has 686 ancestors and is cut-off event [2024-11-09 06:59:44,027 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2024-11-09 06:59:44,027 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2024-11-09 06:59:44,027 INFO L297 olderBase$Statistics]: existing Event has 580 ancestors and is cut-off event [2024-11-09 06:59:44,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1479] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_23|)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][381], [620#true, Black: 640#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 4865#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork2_~stop~2#1| 256) 0))), Black: 4862#(= |thread3Thread1of1ForFork2_~i~2#1| 0), 595#(= |#race~isNull_1~0| 0), 260#L104-1true, Black: 593#true, Black: 2899#true, Black: 597#true, Black: 2904#true, 4880#(= (select (select |#race| ~o_4~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~o_4~0.offset)) 0), 2908#true, Black: 604#true, 2906#(= |#race~o_2~0| 0), 281#L82-9true, Black: 2910#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 2913#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork1_~stop~1#1| 256) 0))), 4877#(and (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2 ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~o_2~0.offset)) 0)), Black: 608#true, Black: 4809#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4829#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 4835#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 606#(= |#race~isNull_5~0| 0), Black: 614#(= |#race~result_7~0| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 234#L68-12true, Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4845#true, 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4860#true, Black: 4856#true, 4858#(= |#race~o_4~0| 0)]) [2024-11-09 06:59:44,374 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2024-11-09 06:59:44,374 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2024-11-09 06:59:44,375 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2024-11-09 06:59:44,375 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2024-11-09 06:59:44,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1479] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_23|)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][381], [Black: 640#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 4865#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork2_~stop~2#1| 256) 0))), Black: 4862#(= |thread3Thread1of1ForFork2_~i~2#1| 0), 595#(= |#race~isNull_1~0| 0), 260#L104-1true, Black: 593#true, Black: 2899#true, Black: 597#true, Black: 2904#true, 4880#(= (select (select |#race| ~o_4~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~o_4~0.offset)) 0), 2908#true, 2906#(= |#race~o_2~0| 0), Black: 604#true, 281#L82-9true, 623#(not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0)), Black: 2910#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 2913#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork1_~stop~1#1| 256) 0))), 4877#(and (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2 ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~o_2~0.offset)) 0)), Black: 608#true, Black: 4809#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4829#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), 606#(= |#race~isNull_5~0| 0), Black: 4835#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 614#(= |#race~result_7~0| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 234#L68-12true, Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4845#true, 610#(= |#race~o_0~0| 0), Black: 620#true, 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4860#true, Black: 4856#true, 4858#(= |#race~o_4~0| 0)]) [2024-11-09 06:59:44,376 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2024-11-09 06:59:44,376 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2024-11-09 06:59:44,377 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2024-11-09 06:59:44,377 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2024-11-09 06:59:44,377 INFO L124 PetriNetUnfolderBase]: 331/7564 cut-off events. [2024-11-09 06:59:44,377 INFO L125 PetriNetUnfolderBase]: For 463/512 co-relation queries the response was YES. [2024-11-09 06:59:44,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9684 conditions, 7564 events. 331/7564 cut-off events. For 463/512 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 68329 event pairs, 39 based on Foata normal form. 0/7058 useless extension candidates. Maximal degree in co-relation 9468. Up to 169 conditions per place. [2024-11-09 06:59:44,480 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 29 selfloop transitions, 6 changer transitions 0/553 dead transitions. [2024-11-09 06:59:44,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 553 transitions, 1654 flow [2024-11-09 06:59:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2024-11-09 06:59:44,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216185625353707 [2024-11-09 06:59:44,484 INFO L175 Difference]: Start difference. First operand has 545 places, 546 transitions, 1562 flow. Second operand 6 states and 3257 transitions. [2024-11-09 06:59:44,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 553 transitions, 1654 flow [2024-11-09 06:59:44,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 553 transitions, 1642 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:59:44,501 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1560 flow [2024-11-09 06:59:44,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2024-11-09 06:59:44,502 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -1 predicate places. [2024-11-09 06:59:44,502 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1560 flow [2024-11-09 06:59:44,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:44,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:44,507 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:44,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 06:59:44,507 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:44,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2133921027, now seen corresponding path program 1 times [2024-11-09 06:59:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710624763] [2024-11-09 06:59:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710624763] [2024-11-09 06:59:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710624763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178997620] [2024-11-09 06:59:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:59:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:59:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:59:45,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-09 06:59:45,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1560 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:45,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:45,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-09 06:59:45,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:48,426 INFO L124 PetriNetUnfolderBase]: 413/7689 cut-off events. [2024-11-09 06:59:48,427 INFO L125 PetriNetUnfolderBase]: For 649/739 co-relation queries the response was YES. [2024-11-09 06:59:48,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9999 conditions, 7689 events. 413/7689 cut-off events. For 649/739 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 77077 event pairs, 62 based on Foata normal form. 16/7268 useless extension candidates. Maximal degree in co-relation 9420. Up to 276 conditions per place. [2024-11-09 06:59:48,495 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 29 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2024-11-09 06:59:48,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 552 transitions, 1652 flow [2024-11-09 06:59:48,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2024-11-09 06:59:48,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216185625353707 [2024-11-09 06:59:48,497 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1560 flow. Second operand 6 states and 3257 transitions. [2024-11-09 06:59:48,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 552 transitions, 1652 flow [2024-11-09 06:59:48,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 552 transitions, 1640 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:59:48,508 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1558 flow [2024-11-09 06:59:48,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2024-11-09 06:59:48,510 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2024-11-09 06:59:48,510 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1558 flow [2024-11-09 06:59:48,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:48,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:48,515 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:48,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 06:59:48,516 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:48,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1732435684, now seen corresponding path program 1 times [2024-11-09 06:59:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868558893] [2024-11-09 06:59:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:48,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868558893] [2024-11-09 06:59:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868558893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:48,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370954679] [2024-11-09 06:59:48,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:48,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:48,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 589 [2024-11-09 06:59:48,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:48,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:48,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 589 [2024-11-09 06:59:48,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:51,318 INFO L124 PetriNetUnfolderBase]: 180/7839 cut-off events. [2024-11-09 06:59:51,319 INFO L125 PetriNetUnfolderBase]: For 322/508 co-relation queries the response was YES. [2024-11-09 06:59:51,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9862 conditions, 7839 events. 180/7839 cut-off events. For 322/508 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 71770 event pairs, 69 based on Foata normal form. 6/7496 useless extension candidates. Maximal degree in co-relation 9594. Up to 166 conditions per place. [2024-11-09 06:59:51,389 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 14 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2024-11-09 06:59:51,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 545 transitions, 1596 flow [2024-11-09 06:59:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2024-11-09 06:59:51,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411431805319751 [2024-11-09 06:59:51,391 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1558 flow. Second operand 3 states and 1663 transitions. [2024-11-09 06:59:51,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 545 transitions, 1596 flow [2024-11-09 06:59:51,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1584 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:59:51,400 INFO L231 Difference]: Finished difference. Result has 539 places, 543 transitions, 1550 flow [2024-11-09 06:59:51,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=539, PETRI_TRANSITIONS=543} [2024-11-09 06:59:51,401 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2024-11-09 06:59:51,402 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 543 transitions, 1550 flow [2024-11-09 06:59:51,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:51,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:51,402 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:51,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 06:59:51,403 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:51,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 250594319, now seen corresponding path program 1 times [2024-11-09 06:59:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:51,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222870350] [2024-11-09 06:59:51,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:51,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222870350] [2024-11-09 06:59:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222870350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:51,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:51,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581248606] [2024-11-09 06:59:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:51,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:51,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:51,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-09 06:59:51,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 543 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:51,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:51,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-09 06:59:51,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:54,369 INFO L124 PetriNetUnfolderBase]: 468/9815 cut-off events. [2024-11-09 06:59:54,369 INFO L125 PetriNetUnfolderBase]: For 574/648 co-relation queries the response was YES. [2024-11-09 06:59:54,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12366 conditions, 9815 events. 468/9815 cut-off events. For 574/648 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 99395 event pairs, 177 based on Foata normal form. 0/9279 useless extension candidates. Maximal degree in co-relation 11848. Up to 516 conditions per place. [2024-11-09 06:59:54,462 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 14 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2024-11-09 06:59:54,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1588 flow [2024-11-09 06:59:54,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2024-11-09 06:59:54,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394453876627051 [2024-11-09 06:59:54,464 INFO L175 Difference]: Start difference. First operand has 539 places, 543 transitions, 1550 flow. Second operand 3 states and 1660 transitions. [2024-11-09 06:59:54,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1588 flow [2024-11-09 06:59:54,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:54,472 INFO L231 Difference]: Finished difference. Result has 538 places, 542 transitions, 1548 flow [2024-11-09 06:59:54,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=538, PETRI_TRANSITIONS=542} [2024-11-09 06:59:54,473 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -7 predicate places. [2024-11-09 06:59:54,473 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 542 transitions, 1548 flow [2024-11-09 06:59:54,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:54,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:54,474 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:54,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 06:59:54,474 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-09 06:59:54,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:54,475 INFO L85 PathProgramCache]: Analyzing trace with hash 461798003, now seen corresponding path program 1 times [2024-11-09 06:59:54,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:54,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009399004] [2024-11-09 06:59:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:54,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-09 06:59:54,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:54,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009399004] [2024-11-09 06:59:54,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009399004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:54,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:54,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:54,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602198304] [2024-11-09 06:59:54,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:54,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:54,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:54,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:54,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-09 06:59:54,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 542 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:54,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:54,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-09 06:59:54,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:56,725 INFO L124 PetriNetUnfolderBase]: 493/7668 cut-off events. [2024-11-09 06:59:56,725 INFO L125 PetriNetUnfolderBase]: For 731/777 co-relation queries the response was YES. [2024-11-09 06:59:56,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10078 conditions, 7668 events. 493/7668 cut-off events. For 731/777 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 78832 event pairs, 260 based on Foata normal form. 0/7276 useless extension candidates. Maximal degree in co-relation 9560. Up to 746 conditions per place. [2024-11-09 06:59:56,792 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 0 selfloop transitions, 0 changer transitions 543/543 dead transitions. [2024-11-09 06:59:56,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 543 transitions, 1586 flow [2024-11-09 06:59:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2024-11-09 06:59:56,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394453876627051 [2024-11-09 06:59:56,794 INFO L175 Difference]: Start difference. First operand has 538 places, 542 transitions, 1548 flow. Second operand 3 states and 1660 transitions. [2024-11-09 06:59:56,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 543 transitions, 1586 flow [2024-11-09 06:59:56,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 543 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:56,802 INFO L231 Difference]: Finished difference. Result has 537 places, 0 transitions, 0 flow [2024-11-09 06:59:56,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=537, PETRI_TRANSITIONS=0} [2024-11-09 06:59:56,803 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -8 predicate places. [2024-11-09 06:59:56,803 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 0 transitions, 0 flow [2024-11-09 06:59:56,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:56,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (82 of 83 remaining) [2024-11-09 06:59:56,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (81 of 83 remaining) [2024-11-09 06:59:56,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (80 of 83 remaining) [2024-11-09 06:59:56,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (79 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (75 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (72 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (71 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (70 of 83 remaining) [2024-11-09 06:59:56,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (68 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (67 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (66 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (64 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (63 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (60 of 83 remaining) [2024-11-09 06:59:56,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (59 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (58 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (57 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (56 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (55 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (54 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (53 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (52 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 83 remaining) [2024-11-09 06:59:56,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 83 remaining) [2024-11-09 06:59:56,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 83 remaining) [2024-11-09 06:59:56,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 83 remaining) [2024-11-09 06:59:56,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 83 remaining) [2024-11-09 06:59:56,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 83 remaining) [2024-11-09 06:59:56,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 83 remaining) [2024-11-09 06:59:56,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (43 of 83 remaining) [2024-11-09 06:59:56,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (42 of 83 remaining) [2024-11-09 06:59:56,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (41 of 83 remaining) [2024-11-09 06:59:56,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (40 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (38 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (37 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (36 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 83 remaining) [2024-11-09 06:59:56,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 83 remaining) [2024-11-09 06:59:56,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 83 remaining) [2024-11-09 06:59:56,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (28 of 83 remaining) [2024-11-09 06:59:56,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (27 of 83 remaining) [2024-11-09 06:59:56,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 83 remaining) [2024-11-09 06:59:56,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 83 remaining) [2024-11-09 06:59:56,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 83 remaining) [2024-11-09 06:59:56,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 83 remaining) [2024-11-09 06:59:56,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 83 remaining) [2024-11-09 06:59:56,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 83 remaining) [2024-11-09 06:59:56,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 83 remaining) [2024-11-09 06:59:56,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 83 remaining) [2024-11-09 06:59:56,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 83 remaining) [2024-11-09 06:59:56,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (17 of 83 remaining) [2024-11-09 06:59:56,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (16 of 83 remaining) [2024-11-09 06:59:56,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (15 of 83 remaining) [2024-11-09 06:59:56,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 83 remaining) [2024-11-09 06:59:56,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 83 remaining) [2024-11-09 06:59:56,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (12 of 83 remaining) [2024-11-09 06:59:56,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 83 remaining) [2024-11-09 06:59:56,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 83 remaining) [2024-11-09 06:59:56,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 83 remaining) [2024-11-09 06:59:56,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 83 remaining) [2024-11-09 06:59:56,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (7 of 83 remaining) [2024-11-09 06:59:56,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 83 remaining) [2024-11-09 06:59:56,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 83 remaining) [2024-11-09 06:59:56,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 83 remaining) [2024-11-09 06:59:56,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 83 remaining) [2024-11-09 06:59:56,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 83 remaining) [2024-11-09 06:59:56,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (1 of 83 remaining) [2024-11-09 06:59:56,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (0 of 83 remaining) [2024-11-09 06:59:56,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 06:59:56,818 INFO L407 BasicCegarLoop]: Path program histogram: [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] [2024-11-09 06:59:56,823 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:59:56,823 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:59:56,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:59:56 BasicIcfg [2024-11-09 06:59:56,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:59:56,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:59:56,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:59:56,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:59:56,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:53" (3/4) ... [2024-11-09 06:59:56,829 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 06:59:56,831 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 06:59:56,832 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 06:59:56,832 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 06:59:56,836 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-09 06:59:56,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 06:59:56,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 06:59:56,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 06:59:56,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:59:56,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 06:59:56,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:59:56,939 INFO L158 Benchmark]: Toolchain (without parser) took 64509.55ms. Allocated memory was 138.4MB in the beginning and 10.8GB in the end (delta: 10.6GB). Free memory was 69.0MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-09 06:59:56,939 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory was 92.2MB in the beginning and 92.0MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:59:56,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.24ms. Allocated memory is still 138.4MB. Free memory was 68.7MB in the beginning and 103.3MB in the end (delta: -34.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 06:59:56,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.63ms. Allocated memory is still 138.4MB. Free memory was 103.3MB in the beginning and 99.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:59:56,939 INFO L158 Benchmark]: Boogie Preprocessor took 75.40ms. Allocated memory is still 138.4MB. Free memory was 99.9MB in the beginning and 96.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:59:56,940 INFO L158 Benchmark]: RCFGBuilder took 798.25ms. Allocated memory is still 138.4MB. Free memory was 96.4MB in the beginning and 54.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-09 06:59:56,940 INFO L158 Benchmark]: TraceAbstraction took 63032.47ms. Allocated memory was 138.4MB in the beginning and 10.8GB in the end (delta: 10.6GB). Free memory was 53.7MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-09 06:59:56,940 INFO L158 Benchmark]: Witness Printer took 111.45ms. Allocated memory is still 10.8GB. Free memory was 9.2GB in the beginning and 9.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 06:59:56,941 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory was 92.2MB in the beginning and 92.0MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.24ms. Allocated memory is still 138.4MB. Free memory was 68.7MB in the beginning and 103.3MB in the end (delta: -34.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.63ms. Allocated memory is still 138.4MB. Free memory was 103.3MB in the beginning and 99.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.40ms. Allocated memory is still 138.4MB. Free memory was 99.9MB in the beginning and 96.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 798.25ms. Allocated memory is still 138.4MB. Free memory was 96.4MB in the beginning and 54.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 63032.47ms. Allocated memory was 138.4MB in the beginning and 10.8GB in the end (delta: 10.6GB). Free memory was 53.7MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 111.45ms. Allocated memory is still 10.8GB. Free memory was 9.2GB in the beginning and 9.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: 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, 857 locations, 83 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: 62.8s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 48.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4121 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2684 mSDsluCounter, 1503 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1138 mSDsCounter, 742 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6695 IncrementalHoareTripleChecker+Invalid, 7437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 742 mSolverCounterUnsat, 365 mSDtfsCounter, 6695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1514 GetRequests, 1379 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1630occurred in iteration=25, InterpolantAutomatonStates: 162, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 10498 NumberOfCodeBlocks, 10363 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 10984 ConstructedInterpolants, 0 QuantifiedInterpolants, 13296 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1527 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 42 InterpolantComputations, 35 PerfectInterpolantSequences, 6834/7029 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 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 06:59:56,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE